The round complexity of verifiable secret sharing revisited

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

Volumn 5677 LNCS, Issue , 2009, Pages 487-504

  Patra, Arpita ^a   Choudhary, Ashish ^a   Rabin, Tal ^b   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY MEASURES; INTERACTIVE PROTOCOLS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; PROBABILITY OF ERRORS; VERIFIABLE SECRET SHARING;

CONTROL THEORY; CRYPTOGRAPHY; PROBABILITY; REPAIR;

SPECTRUM ANALYZERS;

EID: 70350348919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_29     Document Type: Conference Paper

References (20)

1. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: STOC, pp. 1-10 (1988)
2. Chaum, D., Crpeau, C., Damgåard, I.: Multiparty Unconditionally Secure Protocols. In: FOCS, pp. 11-19 (1988)
3. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: STOC, pp. 383-395 (1985)
4. Cramer, R., Damgård, I., Dziembowski, S.: On the Complexity of Verifiable Secret Sharing and Multiparty Computation. In: STOC, pp. 325-334 (2000)
5. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations Secure Against an Adaptive Adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
6. Cramer, R., Damgård, I., Maurer, U.M.: General Secure Multi-Party Computation from Any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316-334. Springer, Heidelberg (2000)
7. Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly Secure Message Transmission. JACM 40(1), 17-47 (1993)
8. Dwork, C.: Strong Verifiable Secret Sharing. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 213-227. Springer, Heidelberg (1990)
9. Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In: FOCS, pp. 427-437 (1987)
10. Fitzi, M., Garay, J., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-Optimal and Efficient Verifiable Secret Sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329-342. Springer, Heidelberg (2006)
11. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: STOC, pp. 580-589 (2001)
12. Golderich, O., Micali, S., Wigderson, A.: How to Play a Mental Game- a Completeness Theorem for Protocols with Honest Majority. In: STOC 1987, pp. 218-229 (1987)
13. Goldreich, O.: Secure Multiparty Computation (2007), http://www.wisdom. weizman.ac.il/~oded/pp.html
14. J. Katz, C. Koo, and R. Kumaresan. Improving the Round Complexity of VSS in Point-to-Point Networks. Cryptology ePrint 2007/358; In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 499-510. Springer, Heidelberg (2008)
15. Patra, A., Choudhary, A., Rabin, T., Pandu Rangan, C.: The Round Complexity of Verifiable Secret Sharing Revisited. Cryptology ePrint 2008/172
16. Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129-140. Springer, Heidelberg (1992)
17. Rabin, T.: Robust Sharing of Secrets When the Dealer is Honest or Cheating. J. ACM 41(6), 1089-1109 (1994)
18. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: STOC, pp. 73-85 (1989)
19. Shamir, A.: How to Share a Secret. Comm. of the ACM 22(11), 612-613 (1979)
20. Tompa, M., Woll, H.: How to Share a Secret with Cheaters. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 261-265. Springer, Heidelberg (1986)