Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop SignaturesPublished by Springer Nature ,2001
- Language Dependent Secure Bit CommitmentPublished by Springer Nature ,2001
- On the Existence of Bit Commitment Schemes and Zero-Knowledge ProofsPublished by Springer Nature ,2001
- Bit Commitment Using Pseudo-RandomnessPublished by Springer Nature ,2001
- Quantum Bit Commitment and Coin Tossing ProtocolsPublished by Springer Nature ,2001
- Collision Free Hash Functions and Public Key Signature SchemesPublished by Springer Nature ,2000
- The (true) complexity of statistical zero knowledgePublished by Association for Computing Machinery (ACM) ,1990
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984