Oded Goldreich. Candidate One-Way Functions Based on Expander Graphs. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, . Volume 6650 of Lecture Notes in Computer Science, pages 76-87, Springer, 2011. [doi]
@incollection{Goldreich11b, title = {Candidate One-Way Functions Based on Expander Graphs}, author = {Oded Goldreich}, year = {2011}, doi = {10.1007/978-3-642-22670-0_10}, url = {http://dx.doi.org/10.1007/978-3-642-22670-0_10}, tags = {rule-based, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Goldreich11b}, cites = {0}, citedby = {0}, pages = {76-87}, booktitle = {Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, }, editor = {Oded Goldreich}, volume = {6650}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-22669-4}, }