On the Correlation Intractability of Obfuscated Pseudorandom Functions
- 19 December 2015
- book chapter
- Published by Springer Nature
- p. 389-415
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Obfuscating Circuits via Composite-Order Graded Encoding2015
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation2014
- Protecting Obfuscation against Algebraic Attacks2014
- Obfuscation for Evasive Functions2014
- Instantiating Random Oracles via UCEs2013
- On the (im)possibility of obfuscating programsJournal of the ACM, 2012
- On Strong Simulation and Composable Point Obfuscation2010
- Lower bounds for non-black-box zero knowledgeJournal of Computer and System Sciences, 2006
- Generating hard instances of lattice problems (extended abstract)1996
- Random oracles are practical1993