Linear VSS and distributed commitments based on secret sharing and pairwise checks

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

Volumn 2442, Issue , 2002, Pages 565-580

  Fehr, Serge ^a   Maurer, Ueli ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; CRYPTOGRAPHY; INFORMATION THEORY; LINEAR ALGEBRA; VECTORS;

BUILDING BLOCKES; COMMON DENOMINATORS; GENERAL ADVERSARY; MIXED ADVERSARIES; SECRET SHARING; SECRET SHARING SCHEMES; SECURE MULTI-PARTY COMPUTATION; VERIFIABLE SECRET SHARING;

MOBILE SECURITY;

EID: 35248849224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In 20th Annual ACM Symposium on the Theory of Computing. ACM Press, 1988.
2. P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science. IEEE, 1989.
3. D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditional secure protocols. In 20th Annual ACM Symposium on the Theory of Computing. ACM Press, 1988.
4. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In 26th Annual Symposium on Foundations of Computer Science. IEEE, 1985.
5. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Advances in Cryptology - EUROCRYPT 2000, Lecture Notes in Computer Science. Springer, 2000.
6. M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Advances in Cryptology – CRYPTO ’98, Lecture Notes in Computer Science. Springer, 1998. Corrected proceedings version.
7. M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multiparty computation. In Advances in Cryptology - ASIACRYPT ’99, Lecture Notes in Computer Science. Springer, 1999.
8. M. Fitzi and U. Maurer. Efficient byzantine agreement secure against general adversaries. In International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science. Springer, 1998.
9. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd Annual ACM Symposium on the Theory of Computing. ACM Press, 2001.
10. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In 16th ACM Symposium on Principles of Distributed Computing, 1997. Final version appeared in Journal of Cryptology 2000.
11. M. Karchmer and A. Wigderson. On span programs. In 8th Annual Conference on Structure in Complexity Theory (SCTC ’93). IEEE, 1993.
12. A. Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11), 1979.