Bit commitment using pseudorandomness
- 1 January 1991
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 4 (2) , 151-158
- https://doi.org/10.1007/bf00196774
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Pseudo-random generators under uniform assumptionsPublished by Association for Computing Machinery (ACM) ,1990
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- One-way functions are essential for complexity based cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the ResultPublished by Springer Nature ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972