On the Security of Goldreich’s One-Way Function-Reference-Cited by-同舟云学术

On the Security of Goldreich’s One-Way Function

Published:2009 Issue: Volume: Page:392-405
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Bogdanov Andrej,Qiao Youming

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03685-9_30

Reference12 articles.

1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 166–175 (2004)

2. Lecture Notes in Computer Science;B. Applebaum,2006

3. Braverman, M.: Polylogarithmic independence fools AC0. Technical Report TR09-011, Electronic Colloquium on Computational Complexity (ECCC) (2009)

4. Cook, J., Etesami, O., Miller, R., Trevisan, L.: Goldreich’s one-way function candidate and myopic backtracking algorithms. In: Proceedings of the 6th Theory of Cryptography Conference (TCC), pp. 521–538 (2009)

5. Lecture Notes in Computer Science;A. Coja-Oghlan,2006

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Public-Key Silent OT and More from Constrained Naor-Reingold;Lecture Notes in Computer Science;2024

2. Lossy Cryptography from Code-Based Assumptions;Lecture Notes in Computer Science;2024

3. Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. On the algebraic immunity—resiliency trade-off, implications for Goldreich’s pseudorandom generator;Designs, Codes and Cryptography;2023-05-25

5. Oblivious Transfer with Constant Computational Overhead;Advances in Cryptology – EUROCRYPT 2023;2023