Author:
Goldreich Oded,Goldwasser Shafi,Micali Silvio
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. D. Angluin and D. Lichtenstein, Provable Security of Cryptosystems: a Survey, YaleU/DCS/TR-288, 1983
2. L. Blum, M. Blum and M. Shub, A simple secure pseudo random number generator, Advances in Cryptology: Proc. of CRYPTO-82, ed. D. Shaum, R. L. Rivest and A.T. Sherman. Plenum press 1983, pp 61–78.
3. M. Blum and S. Goldwasser, An Efficient Probabilistic Public-Key Encryption Scheme Which Hides all Partial Information, preprint May 1984.
4. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. COMPUT., Vol 13, No. 4, Nov. 1984.
5. G. Brassard, On computationally secure authentication tags requiring short secret shared keys, Advances in Cryptology: Proc. of CRYPTO-82, ed. D. Sham, R.L. Rivest and A.T. Sherman. Plenum press 1983, pp 79–86.
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Simple Watermarking Pseudorandom Functions from Extractable Pseudorandom Generators;IACR Communications in Cryptology;2024-07-08
2. OPRFs from Isogenies;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07
3. Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. A Proposal of Equivalence Classes in Maximally Asymmetric Functions and Their Application to Benchmark Generation;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28
5. Cryptographic Primitives with Hinting Property;Journal of Cryptology;2024-04-23