On the correlation intractability of obfuscated pseudorandom functions
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- 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 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
- Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part II
- Advances in cryptology -- EUROCRYPT 2014. 33rd annual international conference on the theory and applications of cryptographic techniques, Copenhagen, Denmark, May 11--15, 2014. Proceedings
- Candidate Multilinear Maps from Ideal Lattices
- Constrained pseudorandom functions and their applications
- Correlated-input secure hash functions
- Cryptanalysis of the multilinear map over the integers
- Foundations of non-malleable hash and one-way functions
- Functional signatures and pseudorandom functions
- How to obfuscate programs directly
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- Instantiating random oracles via UCEs
- Key homomorphic PRFs and their applications
- Lower bounds for non-black-box zero knowledge
- Obfuscating circuits via composite-order graded encoding
- Obfuscation for evasive functions
- Obfuscation of probabilistic circuits and applications
- On Seed-Incompressible Functions
- On strong simulation and composable point obfuscation
- On the (im)possibility of obfuscating programs
- On the public indifferentiability and correlation intractability of the 6-round Feistel construction
- On virtual grey box obfuscation for general circuits
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Practical multilinear maps over the integers
- Protecting obfuscation against algebraic attacks
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- The impossibility of obfuscation with auxiliary input or a universal simulator
- The random oracle methodology, revisited.
- Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
- Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
- Using indistinguishability obfuscation via UCEs
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Why ``Fiat-Shamir for proofs lacks a proof
Cited in
(27)- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Non-interactive zero knowledge from sub-exponential DDH
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- The magic of ELFs
- Fiat-Shamir for highly sound protocols is instantiable
- On the implausibility of constant-round public-coin zero-knowledge proofs
- The Magic of ELFs
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Correlated-input secure hash functions
- The GGM construction does NOT yield correlation intractable function ensembles
- scientific article; zbMATH DE number 1341868 (Why is no real title available?)
- Toward RSA-OAEP without random oracles
- Multi-theorem preprocessing NIZKs from lattices
- 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
- Quantum depth in the random oracle model
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
- Searching for ELFs in the cryptographic forest
- Towards a white-box secure Fiat-Shamir transformation
- How to prove false statements: practical attacks on Fiat-Shamir
- On the black-box complexity of correlation intractability
- Indistinguishability obfuscation from well-founded assumptions
- A Fiat-Shamir transformation from duplex sponges
- Seedless condensers for efficiently samplable sources
This page was built for publication: On the correlation intractability of obfuscated pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796135)
