Minimal complete primitives for secure multi-party computation

Journal of Cryptology

Volumn 18, Issue 1, 2005, Pages 37-61

  Fitzi, Matthias ^a   Garay, Juan A ^b   Maurer, Ueli ^c   Ostrovsky, Rafail ^d  

^a University of California Davis   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c ETH ZURICH   (Switzerland)

^d TELCORDIA TECHNOLOGIES   (United States)

Author keywords

Complete functions; Multi party computation; Oblivious cast; Secure function evaluation; Unconditional security

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL METHODS; INFORMATION THEORY; MATHEMATICAL OPERATORS; SECURITY OF DATA;

COMPLETE FUNCTIONS; MULTI-PARTY COMPUTATIONS; OBLIVIOUS CAST; SECURE FUNCTION EVALUATION; UNCONDITIONAL SECURITY;

CRYPTOGRAPHY;

EID: 22044456389     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0150-y     Document Type: Article

References (26)

1. [Be] D. Beaver. Foundations of secure interactive computation. In Advances in Cryptology - CRYPTO '91, LNCS, pp. 377-391. Springer-Verlag, Berlin, 1992.
2. [BGW] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symp. on the Theory of Computing, pp. 1-10, 1988.
3. [Bl] M. Blaze. Oblivious key escrow. In R. Anderson, editor, Proc. First Infohiding, volume 1174 of LNCS, pp. 335-343, Springer-Verlag, Berlin, 1996.
4. [BMM] A. Beimel, T. Malkin, and S. Micali. The all-or-nothing nature of two-party secure computation. In Advances in Cryptology - CRYPTO '99, volume 1666 of LNCS, pp. 80-97. Springer-Verlag, Berlin, 1999.
5. [Ca] R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1): 143-202, 2000.
6. [CCD] D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symp. on the Theory of Computing, pp. 11-19, 1988.
7. -] R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In. Advances in Cryptology - EUROCRYPT '99, volume 1592 of LNCS, pp. 311-326. Springer-Verlag, Berlin, 1999.
8. [Ch] D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75, 1988.
9. [DDWY] D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(1): 17-47, Jan. 1993.
10. [FLM] M. J. Fischer, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-39, 1986.
11. [FM] M. Fitzi and U. Maurer. From partial consistency to global broadcast. In Proc. 32nd Annual Symp. on the Theory of Computing, pp. 494-503, 2000.
12. [GL] S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology - CRYPTO '90, volume 537 of LNCS, pp. 77-93. Springer-Verlag, Berlin, 1990.
13. [GMW] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th ACM Symp. on the Theory of Computing, pp. 218-229, 1987.
14. [Go1] O. Goldreich. Preface. Journal of Cryptology, Special issue on General Secure Multiparty Computation, 13(1): 1-8, 2000.
15. [Go2] O. Goldreich. Secure multi-party computation, Working draft, version 1.2, Mar. 2000.
16. [Kil] J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th Annual ACM Symp. on the Theory of Computing, pp. 20-31, 1988.
17. [Ki2] J. Kilian. A general completeness theorem for two-party games. In Proc. 23rd Annual ACM Symp. on the Theory of Computing, pp. 553-560, 1991.
18. [Ki3] J. Kilian. More general completeness theorems for secure two-party computation. In Proc. 32nd Annual ACM Symp. on the Theory of Computing, pp. 316-324, 2000.
19. [KKMO] J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM Journal on Computing, 29:1189-1208, 1999.
20. [KMO] E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in multi-party private computations. In Proc. 35th Annual IEEE Symp. on the Foundations of Computer Science, pp. 478-491, 1994.
21. [MR] S. Micali and P. Rogaway. Secure computation. In. Advances in Cryptology - CRYPTO '91, volume 576 of LNCS, pp. 392-404, Springer-Verlag, Berlin, 1992.
22. [PSL] M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, Apr. 1980.
23. [Ra] M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
24. [RB] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symp. on the Theory of Computing, pp. 73-85, 1989.
25. [Va] L. G. Valiant. Universal circuits. In Proc. ACM Symp. on Theory of Computing (STOC '76), pp. 196-203. ACM Press, New York, 1976.
26. [Ya] A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symp. on the Foundations of Computer Science, pp. 160-164, 1982.