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 条
  • [31] Automated Synthesis of Optimized Circuits for Secure Computation
    Demmler, Daniel
    Dessouky, Ghada
    Koushanfar, Farinaz
    Sadeghi, Ahmad-Reza
    Schneider, Thomas
    Zeitouni, Shaza
    CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, : 1504 - 1517
  • [32] Optimizing Secure Computation Programs with Private Conditionals
    Laud, Peeter
    Pankova, Alisa
    INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2016, 2016, 9977 : 418 - 430
  • [33] Efficient Non-interactive Secure Computation
    Ishai, Yuval
    Kushilevitz, Eyal
    Ostrovsky, Rafail
    Prabhakaran, Manoj
    Sahai, Amit
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2011, 2011, 6632 : 406 - +
  • [34] Characterization of Secure Multiparty Computation Without Broadcast
    Ran Cohen
    Iftach Haitner
    Eran Omri
    Lior Rotem
    Journal of Cryptology, 2018, 31 : 587 - 609
  • [35] Secure Computation with Fixed-Point Numbers
    Catrina, Octavian
    Saxena, Amitabh
    FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, 2010, 6052 : 35 - 50
  • [36] Secure Massively Parallel Computation for Dishonest Majority
    Fernando, Rex
    Komargodski, Ilan
    Liu, Yanyi
    Shi, Elaine
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT II, 2020, 12551 : 379 - 409
  • [37] Characterization of Secure Multiparty Computation Without Broadcast
    Cohen, Ran
    Haitner, Iftach
    Omri, Eran
    Rotem, Lior
    THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT I, 2016, 9562 : 596 - 616
  • [38] Secure Error Correction Using Multiparty Computation
    Raeini, Mohammad G.
    Nojoumian, Mehrdad
    2018 IEEE 8TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE (CCWC), 2018, : 468 - 473
  • [39] Characterization of Secure Multiparty Computation Without Broadcast
    Cohen, Ran
    Haitner, Iftach
    Omri, Eran
    Rotem, Lior
    JOURNAL OF CRYPTOLOGY, 2018, 31 (02) : 587 - 609
  • [40] Gradual GRAM and secure computation for RAM programs
    Hazay, Carmit
    Lilintal, Mor
    JOURNAL OF COMPUTER SECURITY, 2022, 30 (01) : 197 - 229