[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || Constrained Keys for Invertible Pseudorandom Functions
- 作者Kalai, Yael; Reyzin, Leonid
- 文件大小508.47KB
- 发表时间2017
- DOI10.1007/978-3-319-70500-2_9
- 页码237-263
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || The Edited TruthKalai, Yael; Reyzin, Leonid · 2017
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10678 || Adaptively Indistinguishable Garbled CircuitsKalai, Yael; Reyzin, Leonid · 2017
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || Bandwidth Hard Functions for ASIC ResistanceKalai, Yael; Reyzin, Leonid · 2017
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || Overcoming Cryptographic Impossibility Results Using BlockchainsKalai, Yael; Reyzin, Leonid · 2017
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || Four Round Secure Computation Without SetupKalai, Yael; Reyzin, Leonid · 2017
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || When Does Functional Encryption Imply Obfuscation?Kalai, Yael; Reyzin, Leonid · 2017
[Lecture Notes in Computer Science] Theory of Cryptography Volume 10677 || Functional Encryption for Bounded Collusions, RevisitedKalai, Yael; Reyzin, Leonid · 2017