Trading correctness for privacy in unconditional multi-party computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1462, Issue , 1998, Pages 121-136

  Fitzi, Matthias ^a   Hirt, Martin ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Secure multi party computation; Threshold cryptography; Unconditional security; Verifiable secret sharing

Indexed keywords

BROADCASTING; CODES (SYMBOLS); CRIME; PROBABILITY;

FAILURE PROBABILITY; MULTIPARTY COMPUTATION; PASSIVE CORRUPTIONS; SECURE MULTI-PARTY COMPUTATION; THRESHOLD CRYPTOGRAPHY; UNCONDITIONAL SECURITY; UNCONDITIONALLY SECURE; VERIFIABLE SECRET SHARING;

CRYPTOGRAPHY;

EID: 44449153600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055724     Document Type: Conference Paper

References (37)

1. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 1-10, 1988.
2. [Can95] R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995.
3. [Can97] R. Canetti. Modular composition of multi-party cryptographic protocols, Nov. 1997. Manuscript.
4. [Can98] R. Canetti. Security and composition of multi-party cryptographic protocols, June 1998. Manuscript.
5. [CCD88] D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 11-19, 1988.
6. [CDG87] D. Chaum, I. Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In Advances in Cryptology-CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 87-119. Springer-Verlag, 1987.
7. [CDM98] R. Cramer, I. Damgård, and U. Maurer. Span programs and general multiparty computation. Manuscript, 1998.
8. [CFGN96] R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multiparty computation. In Proc. 28th ACM Symposium on the Theory of Computing (STOC), pages 639-648, Nov. 1996.
9. [CFSY96] R. Cramer, M. K. Franklin, B. Schoenmakers, and M. Yung. Multiauthority secret-ballot elections with linear work. In Advances in Cryptology-EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 72-83. IACR, Springer-Verlag, May 1996.
10. [CG96] R. Canetti and R. Gennaro. Incoercible multiparty computation. In Proc. 37th IEEE Symposium on the Foundations of Computer Science (FOCS), 1996.
11. [CGKS95] B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. 36th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 41-51, Oct. 1995.
12. [CGT95] C. Crépeau, J. van de Graaf, and A. Tapp. Committed oblivious transfer and private multi-party computation. In Advances in Cryptology-CRYPTO '95, volume 963 of Lecture Notes in Computer Science, pages 110-123. Springer-Verlag, 1995.
13. [Cha89] D. Chaum. The spymasters double-agent problem. In Advances in Cryptology-CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 591-602. Springer-Verlag, 1989.
14. [DDWY93] D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(l):17-47, Jan. 1993.
15. [Dwo90] C. Dwork. Strong verifiable secret sharing. In Proc. International Workshop on Distributed Algorithms '90, volume 486 of Lecture Notes in Computer Science, pages 213-227. Springer-Verlag, 1990.
16. [FKN94] U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. 26th ACM Symposium on the Theory of Computing (STOC), pages 554-563, 1994.
17. [FM88] P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 148-161, 1988.
18. [FR96] M. K. Franklin and M. K. Reiter. The design and implementation of a secure auction service. IEEE Transactions on Software Engineering, 22(5):302-312, May 1996.
19. [Fra93] M. K. FVanklin. Complexity and Security of Distributed Protocols. PhD thesis, Columbia University, 1993.
20. [FY92] M. K. Franklin and M. Yung. Communication complexity of secure computation. In Proc. 24th ACM Symposium on the Theory of Computing (STOC), pages 699-710, 1992.
21. [GHY87] Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure fault-tolerant protocols and the public-key model. In Advances in Cryptology-CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 135-155. Springer-Verlag, 1987.
22. [GJKR96a] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Advances in Cryptology-CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 157-172. Springer-Verlag, Aug. 1996.
23. [GJKR96b] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Advances in Cryptology-EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 354-371. Springer-Verlag, May 1996.
24. [GM93] J. A. Garay and Y. Moses. Fully polynomial Byzantine agreement in t + 1 rounds (extended abstract). In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 31-41, San Diego, California, May 1993.
25. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game-a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on the Theory of Computing (STOC), pages 218-229, 1987.
26. [GRR98] R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998.
27. [HM97] M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), pages 25-34, Aug. 1997.
28. [K097] E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single data base computationally-private information retrieval. In Proc. 38th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 364-373, 1997.
29. [Kus89] E. Kushilevitz. Privacy and communication complexity (extended abstract). In Proc. 30th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 416-421, 1989.
30. [KY] A. Karlin and A. C. Yao. Unpublished manuscript.
31. [LSP82] L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
32. [MP91] F. J. Meyer and D. K. Pradhan. Consensus with dual failure modes. In IEEE Transactions on Parallel and Distributed Systems '91, volume 2, pages 214-221, 1991.
33. [MS81] R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Communications of the ACM, 24:583-584, 1981.
34. [RB89] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symposium on the Theory of Computing (STOC), pages 73-85, 1989.
35. [SDFY94] A. de Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. 26th ACM Symposium on the Theory of Computing (STOC), pages 522-533, 1994.
36. [Sha79] A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
37. [Yao82] A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science (FOCS), pages 160-164. IEEE, 1982.