Bit Commitment Using Pseudo-Randomness
Author:
- 6 July 2001
- book chapter
- Published by Springer Nature
- p. 128-136
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Pseudo-random generation from one-way functions1989
- One-way functions are essential for complexity based cryptography1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result1988
- How to play ANY mental game1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol design1986
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Theory and application of trapdoor functions1982
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972