The Cost of IEEE Arithmetic in Secure Computation

被引:2
|
作者
Archer, David W. [1 ]
Atapoor, Shahla [2 ]
Smart, Nigel P. [2 ,3 ]
机构
[1] Galois Inc, Portland, OR 97204 USA
[2] Katholieke Univ Leuven, Imec COSIC, Leuven, Belgium
[3] Univ Bristol, Bristol, England
来源
PROGRESS IN CRYPTOLOGY - LATINCRYPT 2021 | 2021年 / 12912卷
关键词
MULTIPARTY COMPUTATION; MPC; CIRCUITS;
D O I
10.1007/978-3-030-88238-9_21
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Programmers are used to the rounding and error properties of IEEE double precision arithmetic, however in secure computing paradigms, such as provided by Multi-Party Computation (MPC), usually a different form of approximation is provided for real number arithmetic. We compare the two standard variants using for LSSS-based MPC, with an implementation of IEEE compliant double precision using binary circuit-based MPC. We compare the relative performance, and conclude that the addition cost of IEEE compliance maybe too great for some applications. Thus in the secure domain standards bodies may wish to examine a different form of real number approximations.
引用
收藏
页码:431 / 452
页数:22
相关论文
共 50 条
  • [1] LevioSA: Lightweight Secure Arithmetic Computation
    Hazay, Carmit
    Ishai, Yuval
    Marcedone, Antonio
    Venkitasubramaniam, Muthuramakrishnan
    PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, : 327 - 344
  • [2] MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
    Keller, Marcel
    Orsini, Emmanuela
    Scholl, Peter
    CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, : 830 - 842
  • [3] Secure Outsourced Computation
    Loftus, Jake
    Smart, Nigel P.
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2011, 2011, 6737 : 1 - 20
  • [4] Foundations of Programmable Secure Computation
    Laur, Sven
    Pullonen-Raudvere, Pille
    CRYPTOGRAPHY, 2021, 5 (03)
  • [5] Secure Distributed Computation in the Exponent
    Wang, Hong
    Wei, Shimin
    HIGH PERFORMANCE STRUCTURES AND MATERIALS ENGINEERING, PTS 1 AND 2, 2011, 217-218 : 994 - 1000
  • [6] Secure Multiparty Graph Computation
    Kukkala, Varsha Bhat
    Iyengar, S. R. S.
    Saini, Jaspal Singh
    2016 8TH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORKS (COMSNETS), 2016,
  • [7] A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
    Toft, Tomas
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2013, 2014, 8565 : 20 - 33
  • [8] On the Exact Round Complexity of Secure Three-Party Computation
    Patra, Arpita
    Ravi, Divya
    JOURNAL OF CRYPTOLOGY, 2021, 34 (04)
  • [9] A New Approach to Efficient and Secure Fixed-Point Computation
    Frederiksen, Tore Kasper
    Lindstrom, Jonas
    Madsen, Mikkel Wienberg
    Spangsberg, Anne Dorte
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2024, PT I, 2024, 14583 : 58 - 87
  • [10] Adaptively Secure Computation for RAM Programs
    Bangalore, Laasya
    Ostrovsky, Rafail
    Poburinnaya, Oxana
    Venkitasubramaniam, Muthuramakrishnan
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT II, 2022, 13276 : 187 - 216