Cryptographic asynchronous multi-party computation with optimal resilience

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 322-340

  Hirt, Martin ^a   Nielsen, Jesper Buus ^b   Przydatek, Bartosz ^a  

^a ETH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

COMMUNICATION COMPLEXITY; MULTI-PARTY COMPUTATION; OPTIMAL RESILIENCE; SECURITY PARAMETERS;

CRYPTOGRAPHY;

EID: 24944494113     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_19     Document Type: Conference Paper

References (23)

1. [BCG93] Michael Ben-Or, Ran Canetti, and Oded Goldreich. Asynchronous secure computation. In Proc. 25th ACM STOC, pages 52-61, 1993.
2. [Bec54] Samuel Beckett. Waiting for Godot. New York: Grove Press, 1954.
3. [BGW88] Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM STOC, pages 1-10, 1988.
4. [BKR94] Michael Ben-Or, Boaz Kelmer, and Tal Rabin. Asynchronous secure computations with optimal resilience. In Proc. 13th ACM PODC, pages 183-192, 1994.
5. [Can95] Ran Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995.
6. [Can01] Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE FOCS, pages 136-145, 2001.
7. [CCD88] David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM STOC, pages 11-19, 1988.
8. [CDN01] Ronald Cramer, Ivan Damgård, and Jesper B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. EUROCRYPT '01, pages 280-300, 2001.
9. [CKS00] Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in Constantinopole: Practical asynchronous Byzantine agreement using cryptography. In Proc. 19th ACM PODC, pages 123-132, 2000.
10. [DJ01] Ivan Damgård and Mads Jurik. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In Proc. 4th PKC, pages 110-136, 2001.
11. [FH96] Matt Franklin and Stuart Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology, 9(4):217-232, 1996.
12. [FPS00] Pierre-Alain Fouque, Gouillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Proc. Financial Cryptography '00, 2000.
13. [GL02] S. Goldwasser and Y. Lindell. Secure computation without agreement. In DISC '02, pages 17-32, 2002.
14. [GMW87] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proc. 19th ACM STOC, pages 218-229, 1987.
15. [HNP04] Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek. Cryptographic asynchronous multi-party computation with optimal resilience, 2004. Cryptology ePrint Archive, eprint.iacr.org, report no. 2004/368.
16. [Nie02] Jesper B. Nielsen. A threshold pseudorandom function construction and its applications. In Proc. CRYPTO '02, pages 401-416, 2002.
17. [Pai99] Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proc. EUROCRYPT '99, pages 223-238, 1999.
18. [PSR02] B. Prabhu, K. Srinathan, and C. Pandu Rangan. Asynchronous unconditionally secure computation: An efficiency improvement. In Proc. Indocrypt 2002, pages 93-107, 2002.
19. [RSA78] Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21(2):120-126, 1978.
20. [Sho00] Victor Shoup. Practical threshold signatures. In Proc. EUROCRYPT '00, pages 207-220, 2000.
21. [SR00] K. Srinathan and C. Pandu Rangan. Efficient asynchronous secure multiparty distributed computation. In Proc. Indocrypt 2000, pages 117-129, 2000.
22. [ST04] Berry Schoenmakers and Pim Tuyls. Practical two-party computation based on the conditional gate. In Proc. ASIACRYPT '04, pages 119-136, 2004.
23. [Yao82] Andrew C. Yao. Protocols for secure computations. In Proc. 23rd IEEE FOCS, pages 160-164, 1982.