On the complexity of verifiable secret sharing and multiparty computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 325-334

  Cramer, Ronald ^a   Damgård, Ivan ^a   Dziembowski, Stefan ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ADVERSARY; BLACK-BOX REDUCTIONS; BROADCAST CHANNELS; GENERAL ACCESS STRUCTURE; IMPOSSIBILITY RESULTS; MULTIPARTY COMPUTATION; SECRET SHARING SCHEMES; VERIFIABLE SECRET SHARING; MULTIPARTY COMPUTATION (MPC); VERIFIABLE SECRET SHARING (VSS);

INFORMATION THEORY; MODEL PREDICTIVE CONTROL; POLYNOMIAL APPROXIMATION; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

COMPUTATION THEORY; SECURITY OF DATA;

EID: 0033706246     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335343     Document Type: Conference Paper

References (17)

1. A. Beimel: Secure Schemes for Secret Sharing and Key Distribution, Ph.D.-thesis, Technion, Haifa, June 1996.
2. M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of ACM STOC '88, pp. 1-10, ACM Press, 1988.
3. D. Chaum, C. Crépeau, I. Damgård: Multi-Party Unconditionally Secure Protocols, Proc. of ACM STOC '88, pp. 11-19, ACM Press, 1988.
4. B. Chor, S. Goldwasser, S. Micali, B. Awerbuch: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proc. of IEEE FOCS '85, pp. 383-395, 1985.
5. R. Cramer, I. Damg̊rd, S. Dziembowski, M. Hirt, T. Rabin: Efficient Multiparty Computations with Dishonest Minority, Proc. of EUROCRYPT '99, Springer Verlag LNCS, vol. 1592, pp. 311-326, 1999.
6. R. Cramer, I. Damg̊rd, U. Maurer: Secure and Efficient General Multiparty Computations from any Linear Secret Sharing Scheme, Proc. of EUROCRYPT '00, Springer Verlag LNCS, 2000.
7. M. Fitzi, U. Maurer: Efficient Byzantine Agreement Secure against General Adversaries, Proc. of Distributed Computing (DISC '98), Springer Verlag LNCS, vol. 1499, pp. 134-148, 1998.
8. R. Gennaro: Theory and Practice of Verifiable Secret Sharing, Ph.D.-thesis, Massachusetts Institute of Technology, 1995.
9. O. Goldreich, S. Micali and A. Wigderson: How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority, Proc. of ACM STOC '87, pp. 218-229.
10. M. Hirt, U. Maurer: Player Simulation and General Adversary Structures in Perfect Multiparty Computation, Journal of Cryptology, 13( 1): 31-61, 2000. Extended abstract in Proc. of ACM PODC'97, pp. 25-34, ACM Press, 1997.
11. M. Ito, A. Saito, T. Nishizeki: Secret sharing schemes realizing general access structures, Proc. of IEEE GlobeCom '87 Tokyo, pp. 99-102, 1987.
12. J. Kilian: A note on Efficient Proofs and Arguments, Proc. of ACM STOC '92, pp. 723-732, ACM Press, 1992.
13. M. Karchmer, A. Wigderson: On Span Programs, Proc. of Structure in Complexity '93, pp. 102-111, 1993. (Pubitemid 23688021)
14. M. Naor: Bit commitment using pseudorandomness, Journal of Cryptology, 4( 2): 151-158, 1991.
15. T. Rabin, M. Ben-Or: Verifiable Secret Sharing and Multiparty Protocols with Honest majority, Proc. of ACM STOC '89, pp. 73-85, ACM Press, 1989.
16. A. Shamir: How to Share a Secret, Communications of the ACM 22 ( 1979) 612-613.
17. A. Yao: Protocols for Secure Computation, Proc. of IEEE FOCS '82, pp. 160-164, 1982.