On the cost of reconstructing a secret, or VSS with optimal reconstruction phase

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

Volumn 2139 LNCS, Issue , 2001, Pages 503-523

  Cramer, Ronald ^a   Damgard, Ivan ^a   Fehr, Serge ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; OUTAGES;

ACTIVE ADVERSARY; COMPUTING POWER; CONSTANT FACTORS; EFFICIENT RECONSTRUCTION; FAILURE PROBABILITY; GENERIC METHOD; MULTIPARTY COMPUTATION; SECRET SHARING SCHEMES; MAXIMAL VALUES;

OUTAGES; CRYPTOGRAPHY;

EID: 84880905357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_30     Document Type: Conference Paper

References (15)

1. D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO '91, LNCS 576, pages 420-432. Springer-Verlag, 1992.
2. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th Annual ACM Symposium on the Theory of Computing, pages 1-10, 1988.
3. R.E. Blahut. Priciples and Practice of Information Theory. Addison-Wesley, 1987.
4. R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT '99, LNCS 1592. Springer-Verlag, 1999.
5. R. Cramer, I. Damgaard, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT 2000, LNCS 1807. Springer-Verlag, 2000.
6. 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, pages 383-395, 1985.
7. S. Cabello, C. Padró, and G. Sáez. Secret sharing schemes with detection of cheaters for a general access structure. In Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT '99, LNCS 1233, pages 185-193, 1999.
8. R. Gennaro, M.O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM Symposium on Principles of Distributed Computing, 1998.
9. 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, pages 25-34, 1997.
10. M. Karchmer and A. Wigderson. On span programs. In 8th Annual Conference on Structure in Complexity Theory (SCTC '93), pages 102-111, 1993.
11. U. Maurer. Authentication theory and hypothesis testing. IEEE Transaction on Information Theory, 2000.
12. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In 21th Annual ACM Symposium on the Theory of Computing, pages 73-85, 1989.
13. A. Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11):612-613, 1979.
14. G.J. Simmons. Authentication theory/coding theory. In CRYPTO '84, LNCS 196, pages 411-431. Springer-Verlag, 1985.
15. D.R. Stinson. Cryptography - Theory and Practice. Number ISBN 0-8493-8521-0. CRC Press, 1995.