How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O

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]

Abstract

Abstract is missing.