On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
- 13 July 2001
- book chapter
- Published by Springer Nature
- p. 250-265
- https://doi.org/10.1007/3-540-48329-2_22
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Design Principle for Hash FunctionsPublished by Springer Nature ,2001
- The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure ServiceabilityPublished by Springer Nature ,2001
- How to Make Efficient Fail-stop SignaturesPublished by Springer Nature ,1993
- New Constructions of Fail-Stop Signatures and Lower BoundsPublished by Springer Nature ,1993
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- A Digital Signature Based on a Conventional Encryption FunctionPublished by Springer Nature ,1988
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979