Trapdoor pseudo-random number generators, with applications to protocol design

作者: Umesh V. Vazirani , Vijay V. Vazirani

DOI: 10.1109/SFCS.1983.78

关键词:

摘要: We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application this technique, we present provably secure protocol One-Bit Disclosures i.e. giving one-bit message exchange receipt.

参考文章(10)
Tom Tedrick, How to Exchange Half a Bit Advances in Cryptology. pp. 147- 151 ,(1984) , 10.1007/978-1-4684-4730-9_13
CE Shennon, Warren Weaver, A mathematical theory of communication Bell System Technical Journal. ,vol. 27, pp. 379- 423 ,(1948) , 10.1002/J.1538-7305.1948.TB01338.X
Manuel Blum, How to exchange (secret) keys ACM Transactions on Computer Systems. ,vol. 1, pp. 175- 193 ,(1983) , 10.1145/357360.357368
Shafi Goldwasser, Silvio Micali, Andy Yao, Strong signature schemes symposium on the theory of computing. pp. 431- 439 ,(1983) , 10.1145/800061.808774
Shafi Goldwasser, Silvio Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 365- 377 ,(1982) , 10.1145/800070.802212
Andrew C Yao, None, Theory and application of trapdoor functions foundations of computer science. pp. 80- 91 ,(1982) , 10.1109/SFCS.1982.95
Adi Shamir, On the Generation of Cryptographically Strong Pseudo-Random Sequences international colloquium on automata, languages and programming. pp. 544- 550 ,(1981) , 10.1007/3-540-10843-2_43
Manuel Blum, Silvio Micali, How to generate cryptographically strong sequences of pseudo random bits 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 112- 117 ,(1982) , 10.1109/SFCS.1982.72
Andrew C. Yao, Theory and application of trapdoor functions 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 80- 91 ,(1982) , 10.1109/SFCS.1982.45