Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation-Reference-Cited by-同舟云学术

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

Published:2006 Issue: Volume: Page:285-304
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Damgård Ivan,Fitzi Matthias,Kiltz Eike,Nielsen Jesper Buus,Toft Tomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11681878_15.pdf

Reference15 articles.

1. Lecture Notes in Computer Science;J. Algesheimer,2002

2. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: Proc. ACM PODC 1989, pp. 201–209 (1989)

3. Lecture Notes in Computer Science;D. Beaver,2000

4. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, October 14–17, pp. 136–145. IEEE, Los Alamitos (2001)

5. Lecture Notes in Computer Science;R. Cramer,2001

Cited by 175 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The oblivious comparison sorting protocols for secure multi-party computation;Multimedia Tools and Applications;2024-01-27

2. Practical and Efficient FHE-Based MPC;Cryptography and Coding;2023-12-04

3. Federated computation: a survey of concepts and challenges;Distributed and Parallel Databases;2023-11-23

4. Secure Groups for Threshold Cryptography and Number-Theoretic Multiparty Computation;Cryptography;2023-11-09

5. Secure Multi-Party Computation for Digital Assets Custody Purpose - Analysis of Open-Source Implementations;2023 Fifth International Conference on Blockchain Computing and Applications (BCCA);2023-10-24