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 条
  • [21] Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
    Boyle, Elette
    Gilboa, Niv
    Ishai, Yuval
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT II, 2017, 10211 : 163 - 193
  • [22] Three-Party ORAM for Secure Computation
    Faber, Sky
    Jarecki, Stanislaw
    Kentros, Sotirios
    Wei, Boyang
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2015, PT I, 2015, 9452 : 360 - 385
  • [23] Efficient Perfectly Secure Computation with Optimal Resilience
    Abraham, Ittai
    Asharov, Gilad
    Yanai, Avishay
    JOURNAL OF CRYPTOLOGY, 2022, 35 (04)
  • [24] The Broadcast Message Complexity of Secure Multiparty Computation
    Garg, Sanjam
    Goel, Aarushi
    Jain, Abhishek
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2019, PT I, 2019, 11921 : 426 - 455
  • [25] On the Power of Secure Two-Party Computation
    Hazay, Carmit
    Venkitasubramaniam, Muthuramakrishnan
    ADVANCES IN CRYPTOLOGY (CRYPTO 2016), PT II, 2016, 9815 : 397 - 429
  • [26] Global-Scale Secure Multiparty Computation
    Wang, Xiao
    Ranellucci, Samuel
    Katz, Jonathan
    CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 39 - 56
  • [27] Asynchronous Secure Multiparty Computation in Constant Time
    Cohen, Ran
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2016, PT II, 2016, 9615 : 183 - 207
  • [28] Optimizing Secure Computation Programs with Private Conditionals
    Laud, Peeter
    Pankova, Alisa
    INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2016, 2016, 9977 : 418 - 430
  • [29] 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
  • [30] 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