Aayush Jain, Huijia Lin, Christian Matt 0002, Amit Sahai. How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O. In Yuval Ishai, Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part I. Volume 11476 of Lecture Notes in Computer Science, pages 251-281, Springer, 2019. [doi]
@inproceedings{JainL0S19,
title = {How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O},
author = {Aayush Jain and Huijia Lin and Christian Matt 0002 and Amit Sahai},
year = {2019},
doi = {10.1007/978-3-030-17653-2_9},
url = {https://doi.org/10.1007/978-3-030-17653-2_9},
researchr = {https://researchr.org/publication/JainL0S19},
cites = {0},
citedby = {0},
pages = {251-281},
booktitle = {Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part I},
editor = {Yuval Ishai and Vincent Rijmen},
volume = {11476},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-17653-2},
}