General secure multi-party computation from any linear secret-sharing scheme

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

Volumn 1807, Issue , 2000, Pages 316-334

  Cramer, Ronald ^a   Damgård, Ivan ^a   Maurer, Ueli ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

ACCESS STRUCTURE; ADVERSARY STRUCTURES; GENERIC CONSTRUCTION; LINEAR SECRET SHARING SCHEMES; SECURE MULTI-PARTY COMPUTATION; SECURE PROTOCOLS; SUPER-POLYNOMIALS; VERIFIABLE SECRET SHARING;

CRYPTOGRAPHY;

EID: 84948975649     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_22     Document Type: Conference Paper

References (32)

1. D. Beaver, Foundations of secure interactive computing, Proc. CRYPTO ’91, Springer Verlag LNCS, vol. 576, pp. 377-391.
2. D. Beaver and A. Wool, Quorum-based multi-party computations, Proc. EUROCRYPT ’98, Springer Verlag LNCS, vol. 1403, pp. 375-390.
3. A. Beimel, Secure schemes for secret sharing and key distribution, Ph.D.-thesis, Technion, Haifa, June 1996.
4. J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, Proc. CRYPTO ’88, Springer Verlag LNCS, vol. 403, pp. 25-35.
5. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-crypto-graphic fault-tolerant distributed computation, Proc. ACM STOC ’88, pp. 1-10.
6. M. Bertilsson, I. Ingemarsson, A construction of practical secret sharing schemes using linear block codes, Proc. AUSCRYPT ’92, Springer Verlag LNCS, vol. 718, pp. 67-79.
7. E. F. Brickell, Some ideal secret sharing schemes, J. Combin. Maths. & Combin. Comp. 9 (1989), pp. 105-113.
8. R. Canetti, Studies in secure multi-party computation and applications, Ph. D. thesis, Weizmann Institute of Science, Rehovot, 1995.
9. R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, Proc. ACM STOC ’96, pp. 639-648.
10. D. Chaum, C. Crépeau, I. Damgård, Multi-party unconditionally secure protocols, Proc. ACM STOC ’88, pp. 11-19.
11. B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifible secret sharing and achieving simultaneity in the presence of faults, Proc. FOCS ’85, pp. 383-395.
12. R. Cramer, I. Damgård, Zero Knowledge for Finite Field Arithmetic or: Can Zero Knowledge be for Free?, Proc. CRYPTO’98, Springer Verlag LNCS, vol. 1462, pp. 424-441.
13. R. Cramer, I. Damgård, S. Dziembowski, On the complexity of Verifible secret sharing and multi-party computation, Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC ’00), Portland, Oregon, May 2000.
14. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt and T. Rabin, Efficient multi-party computations secure against an adaptive adversary, Proc. EUROCRYPT ’99, Springer Verlag LNCS, vol. 1592, pp. 311-326.
15. C. Crépeau, J. van de Graaf and A. Tapp, Committed oblivious transfer and private multi-party computation, proc. CRYPTO ’95, Springer Verlag LNCS, vol. 963, pp. 110-123.
16. M. van Dijk, Secret key sharing and secret key generation, Ph.D. Thesis, Eindhoven University of Technology, 1997.
17. S. Fehr, Efficient construction of dual MSP, manuscript 1999.
18. M. Fitzi, U. Maurer, Efficient Byzantine agreement secure against general adversaries, Proc. 12th Int. Symp. on Distributed Computing (DISC ’98), Springer Verlag LNCS, vol. 1499, pp. 134-148.
19. A. Gál, A characterization of span program size and improved lower bounds for monotone span programs, Proceedings of the 30th ACM Symposium on the Theory of Computing, 1998, pp. 429-437.
20. A. Gál, Combinatorial methods in Boolean function complexity, Ph.D.thesis, University of Chicago, 1995.
21. Z. Galil, S. Haber and M. Yung, Cryptographic computation: Secure fault-tolerant protocols and the public-key model, Proc. CRYPTO’87, Springer Verlag LNCS, vol. 293, pp. 135-155.
22. R. Gennaro, Theory and practice of Verifible secret sharing, Ph.D. thesis, MIT, 1996.
23. R. Gennaro, M. Rabin, T. Rabin, Simplified VSS and fast-track multi-party computations with applications to threshold cryptography, Proc. ACM PODC’98.
24. O. Goldreich, S. Micali and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, Proc. ACM STOC ’87, pp. 218-229.
25. M. Hirt, U. Maurer, Player simulation and general adversary structures in perfect multi-party computation, Journal of Cryptology, vol. 13, no. 1, pp. 31-60, 2000. (Preliminary version in Proc. ACM PODC’97, pp. 25-34.)
26. M. Ito, A. Saito and T. Nishizeki, Secret sharing schemes realizing general access structures, Proc. IEEE GlobeCom ’87 Tokyo, pp. 99-102.
27. M. Karchmer, A. Wigderson, On span programs, Proc. of Structure in Complexity ’93, pp. 102-111.
28. S. Micali and P. Rogaway, Secure computation, Manuscript, Preliminary version in Proc. CRYPTO ’91, Springer Verlag LNCS, vol. 576, pp. 392-404
29. T. Rabin, M. Ben-Or, Verifible secret sharing and multi-party protocols with honest majority, Proc. ACM STOC ’89, pp. 73-85.
30. T. Rabin, Robust sharing of secrets when the dealer is honest or cheating, J. ACM, 41(6): 1089-1109, November 1994.
31. A. Shamir, How to share a secret, Communications of the ACM 22 (1979) 612-613.
32. Technical report, full version of this paper. Will be posted on the Web and is available from the authors. Obsolete are the earlier versions: Span programs and general secure multi-party computation, BRICS Report RS-97-28, Nov. 1997, and Enforcing the multiplication property on MSPs, with only constant overhead, Jan. 1999.