Author:
Ames Scott,Gennaro Rosario,Venkitasubramaniam Muthuramakrishnan
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. SIAM Journal of Computing, 112–117 (1982)
2. Lecture Notes in Computer Science;A. Santis De,1991
3. Gennaro, R., Trevisan, L.: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. In: FOCS 2000, pp. 305–313 (2000)
4. Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM Journal of Computing 22(6), 1163–1175 (1993)
5. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989, pp. 25–32 (1989)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献