Practical and provably-secure commitment schemes from collision-free hashing

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

Volumn 1109, Issue , 1996, Pages 201-215

  Halevi, Shai ^a   Micali, Silvio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COLLISION-FREE; COMMITMENT SCHEME; COMPUTATIONAL ZERO KNOWLEDGE; CONSTANT FACTORS; PROVABLY SECURE; STATISTICAL ZERO KNOWLEDGE;

HASH FUNCTIONS;

EID: 0037519332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_16     Document Type: Conference Paper

References (19)

1. C.H. Bennett and G. Brassard Quantum Cryptography: Public Key Distribution and Coin Tossing. In Proc. of IEEE International Con/, on Computers, Systems, and Signal Processing, IEEE, 1984, pages 175-179.
2. G. Bleumer, B. Pfitzrnann and M. Waidner. A Remark on a Signature Scheme where Forgery can be Proved. In I.B. Damgård, editor, Proc. of Eurocrypt'90, Lecture Notes in Computer Science, volume 473, Springer-Verlag, 1990. pages 441-445.
3. M. Blum. Coin flipping by telephone. In Proc. IEEE Spring COMPCOM, pages 133-137. IEEE, 1982.
4. G. Brassard and C. Crèpeau. Nontransitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond. In Proc. 27th IEEE Symp. on Foundations of Comp. Science, IEEE, 1986. pages 188-195.
5. G. Brassard and C. Crèpeau. Quantum bit. commitment and coin tossing protocols. In A.J. Menezes and S.A. Vanstone. editors, Proc. Crypto '90, Lecture Notes in Computer Science, volume 537. Springer-Verlag, 1991. pages 49-61.
6. G. Brassard, C. Crèpeau, R. Jozsa and D. Langlois. A Quantum Bit Commitment Scheme Provably Unbreakable by Both Parties. In Proc. 34th IEEE Symp. on Foundations of Comp. Science, IEEE, 1993.
7. L. Carter and M. Wegman. Universal Hash Functions. J. of Computer and System Science 18, 143-154 (1979).
8. D. Chaum, E. van Heijst and B. Pfitzmann. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. In J. Feigenbaum, editor, Proc. Crypto '91, Lecture Notes in Computer Science, volume 576, Springer-Verlag, 1992pages 470-484.
9. I.B. Damgård, Practical and Provably Secure Release of a Secret and Exchange of Signatures. T. Helleseth, editor, Proc. EuroCrypt '93, Lecture Notes in Computer Science, volume 765, Springer-Verlag, 1994. pages 200-217.
10. I.B. Damgård, I.P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In D.R. Stinson, editor, Proc. Crypto '93, Lecture Notes in Computer Science, volume 773. Springer, 1994. pages 250-265.
11. O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proofs Systems for NP. Journal of Cryptology, Vol. 9, No. 2, 1996.
12. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, April 1988.
13. Moti Yung and Russell Impagliazzo. Direct minimum-knowledge computations. In C. Pomerance, editor, Proc. Crypto '87, Lecture Notes in Computer Science, volume 293, Springer-Verlag, 1988. Pages 40-51.
14. S. Halevi, Efficient commitment with bounded sender and unbounded receiver. In D. Coppersmith, editor, Proc. Crypto '95. Lecture Notes in Computer Science, volume 963, Springer-Verlag, 1995. pages 84-96.
15. M. Naor. Bit commitment using pseudo-randomness. In G. Brassard, editor, Proc. Crypto '89, Lecture Notes in Computer Science, volume 435. Springer- Verlag, 1990. pages 128-137.
16. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. In Ernest F. Brickell, editor, Proc. Crypto '92, Lecture Notes in Computer Science, volume 740, Springer-Verlag, 1993. pages 196-214.
17. M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In Proc. 21 st ACM Symp. on Theory of Computing, ACM, 1989. pages 33-43.
18. T.P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In J. Feigenbaum, editor, Proc. Crypto '91, Lecture Notes in Computer Science, volume 576, Springer-Verlag, 1992. pages 129-140.
19. Federal Information Processing Standards, Publication 180. Specifications for a Secure Hash Standard (SHS).