Publisher
Springer Berlin Heidelberg
Reference48 articles.
1. Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: Schulman, L.J. (ed.) 42nd ACM STOC, pp. 171–180. ACM Press (2010)
2. Lecture Notes in Computer Science;B. Applebaum,2009
3. Lecture Notes in Computer Science;S. Arora,2011
4. Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, pp. 298–307. IEEE Computer Society Press (2003)
5. Lecture Notes in Computer Science;A. Blum,1994
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantum and Post-Quantum Security in Future Networks;2023 IEEE Future Networks World Forum (FNWF);2023-11-13
2. Cryptographic Primitives;Advances in Information Security;2023-08-10
3. Theoretical Limits of Provable Security Against Model Extraction by Efficient Observational Defenses;2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML);2023-02
4. Learning-Based Cryptography;Studies in Computational Intelligence;2023
5. Learning with Physical Rounding for Linear and Quadratic Leakage Functions;Advances in Cryptology – CRYPTO 2023;2023