Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 201-215
- https://doi.org/10.1007/3-540-68697-5_16
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop SignaturesPublished by Springer Nature ,2001
- Practical and Provably Secure Release of a Secret and Exchange of SignaturesPublished by Springer Nature ,2001
- Bit Commitment Using Pseudo-RandomnessPublished by Springer Nature ,2001
- Quantum Bit Commitment and Coin Tossing ProtocolsPublished by Springer Nature ,2001
- Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity AssumptionsPublished by Springer Nature ,2001
- Efficient Commitment Schemes with Bounded Sender and Unbounded ReceiverPublished by Springer Nature ,1995
- Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the SignerPublished by Springer Nature ,1992
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979