Computational verifiable secret sharing revisited

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

Volumn 7073 LNCS, Issue , 2011, Pages 590-609

  Backes, Michael ^a,b   Kate, Aniket ^a   Patra, Arpita ^c  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

Commitments; Homomorphism; Round Complexity; Verifiable Secret Sharing

Indexed keywords

ASYNCHRONOUS COMMUNICATION MODEL; COMMITMENTS; COMMUNICATION COMPLEXITY; COMPLEXITY MEASURES; COMPUTATIONAL SETTINGS; HOMOMORPHISM; ROUND COMPLEXITY; SYNCHRONOUS COMMUNICATIONS; VERIFIABLE SECRET SHARING;

COMMUNICATION; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; IMAGE QUALITY; INFORMATION THEORY; SECURITY OF DATA;

COMPUTATIONAL COMPLEXITY;

EID: 82955184587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25385-0_32     Document Type: Conference Paper

References (31)

1. Backes, M., Kate, A., Patra, A.: Computational Verifiable Secret Sharing Revisited. Cryptology ePrint Archive, Report 2011/281(2011)
2. Blakley, G. R.: Safeguarding Cryptographic Keys. In: The National Computer Conference, pp. 313-317(1979)
3. Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In: ACM CCS 2002, pp. 88-97(2002)
4. Canetti, R.: Studies in Secure Multiparty Computation and Applications. Ph. D. thesis, The Weizmann Institute of Science (1996)
5. Canetti, R., Rabin, T.: Fast Asynchronous Byzantine Agreement with Optimal Resilience. In: ACM STOC 1993, pp. 42-51(1993) (Pubitemid 23668795)
6. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: IEEE FOCS 1985, pp. 383-395(1985) (Pubitemid 16541437)
7. D'Arco, P., Stinson, D. R.: On Unconditionally Secure Robust Distributed Key Distribution Centers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 346-363. Springer, Heidelberg (2002)
8. Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM 40(1), 17-47(1993)
9. Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: IEEE FOCS 1987, pp. 427-437(1987) (Pubitemid 18538622)
10. Fitzi, M., Garay, J. A., Gollakota, S., Rangan, C. P., 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) (Pubitemid 43979856)
11. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: ACM STOC 2001, pp. 580-589(2001) (Pubitemid 32865774)
12. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. J. of Cryptology 20(1), 51-83(2007) (Pubitemid 46224826)
13. Gennaro, R., Rabin, M. O., Rabin, T.: Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography. In: ACM PODC 1998, pp. 101-111(1998)
14. Goldreich, O., Kahan, A.: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology 9(3), 167-190(1996)
15. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in np have zero-knowledge proof systems. J. ACM 38(3), 691-729(1991)
16. Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: ACM STOC 2007, pp. 1-10(2007) (Pubitemid 47630715)
17. Halevi, S., Micali, S.: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 201-215. Springer, Heidelberg (1996) (Pubitemid 126106241)
18. Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing or: How to Cope with Perpetual Leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339-352. Springer, Heidelberg (1995)
19. Kate, A., Goldberg, I.: Distributed Key Generation for the Internet. In: Proc. Intl. Conf. on Distributed Computing Systems (ICDCS), pp. 119-128(2009)
20. Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the Round Complexity of VSS in Point-to-Point Networks. 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)
21. Kumaresan, R., Patra, A., Rangan, C. P.: The Round Complexity of Verifiable Secret Sharing: The Statistical Case. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 431-447. Springer, Heidelberg (2010)
22. Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect Zero-Knowledge Arguments for P Using Any One-Way Permutation. J. Cryptology 11(2), 87-108(1998) (Pubitemid 128728046)
23. Patra, A., Choudhary, A., Rabin, T., Rangan, C. P.: The Round Complexity of Verifiable Secret Sharing Revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487-504. Springer, Heidelberg (2009)
24. Patra, A., Choudhary, A., Rangan, C. P.: Efficient Asynchronous Byzantine Agreement with Optimal Resilience. In: ACM PODC 2009, pp. 92-101(2009)
25. Patra, A., Choudhary, A., Rangan, C. P.: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. In: Kurosawa, K. (ed.) Information Theoretic Security. LNCS, vol. 5973, pp. 74-92. Springer, Heidelberg (2010)
26. Pedersen, T. P.: A Threshold Cryptosystem Without a Trusted Party. In: Davies, D. W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522-526. Springer, Heidelberg (1991)
27. 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)
28. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In: ACM STOC 1989, pp. 73-85(1989)
29. Schultz, D. A., Liskov, B., Liskov, M.: MPSS: Mobile Proactive Secret Sharing. ACM Trans. Inf. Syst. Secur. 13(4), 34(2010)
30. Shamir, A.: How to Share a Secret. Commun. ACM 22(11), 612-613(1979)
31. Zhou, L., Schneider, F. B., van Renesse, R.: APSS: Proactive Secret Sharing in Asynchronous Systems. ACM Trans. Inf. Syst. Secur. 8(3), 259-286(2005) (Pubitemid 43906386)