On the Correlation Intractability of Obfuscated Pseudorandom Functions

DOI10.1007/978-3-662-49096-9_17zbMath1388.94038OpenAlexW2295806187MaRDI QIDQ2796135

Leonid Reyzin, Ran Canetti, Yilei Chen

Publication date: 23 March 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Toward RSA-OAEP Without Random Oracles ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Augmented random oracles ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
• Advances in cryptology -- ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7--11, 2014, Proceedings, Part II
• Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part II
• Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
• Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
• Advances in cryptology -- EUROCRYPT 2014. 33rd annual international conference on the theory and applications of cryptographic techniques, Copenhagen, Denmark, May 11--15, 2014. Proceedings
• Lower bounds for non-black-box zero knowledge
• Key Homomorphic PRFs and Their Applications
• Practical Multilinear Maps over the Integers
• Instantiating Random Oracles via UCEs
• Constrained Pseudorandom Functions and Their Applications
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
• On Virtual Grey Box Obfuscation for General Circuits
• On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
• Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
• Using Indistinguishability Obfuscation via UCEs
• Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
• Cryptanalysis of the Multilinear Map over the Integers
• How to Obfuscate Programs Directly
• Correlated-Input Secure Hash Functions
• The random oracle methodology, revisited
• On Strong Simulation and Composable Point Obfuscation
• Foundations of Non-malleable Hash and One-Way Functions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Why “Fiat-Shamir for Proofs” Lacks a Proof
• Candidate Multilinear Maps from Ideal Lattices
• How to use indistinguishability obfuscation
• Obfuscation of Probabilistic Circuits and Applications
• Obfuscating Circuits via Composite-Order Graded Encoding
• On the (im)possibility of obfuscating programs
• Functional Signatures and Pseudorandom Functions
• Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
• Protecting Obfuscation against Algebraic Attacks
• Advances in Cryptology - CRYPTO 2003
• On Seed-Incompressible Functions
• Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Obfuscation for Evasive Functions

This page was built for publication: On the Correlation Intractability of Obfuscated Pseudorandom Functions