On the black-box complexity of correlation intractability
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology – CRYPTO 2004
- Bit commitment using pseudorandomness
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Computationally Sound Proofs
- Correlation intractability and SNARGs from sub-exponential DDH
- Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications)
- Differential Privacy
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- From obfuscation to the security of Fiat-Shamir for proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1341868 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- scientific article; zbMATH DE number 7829334 (Why is no real title available?)
- Interactive oracle proofs
- Limits on the power of indistinguishability obfuscation and functional encryption
- Lower bounds for non-black-box zero knowledge
- Magic functions
- New directions in cryptography
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive zero knowledge from sub-exponential DDH
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the complexity of collision resistant hash functions: new and old black-box separations
- On the correlation intractability of obfuscated pseudorandom functions
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Practical and provably-secure commitment schemes from collision-free hashing
- Privately constraining and programming PRFs, the LWE way
- Probabilistic encryption
- Scalable zero knowledge with no trusted setup
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for P from sub-exponential DDH and QR
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- The random oracle methodology, revisited.
- Theory of Cryptography
- Trapdoor hash functions and their applications
- Why ``Fiat-Shamir for proofs lacks a proof
This page was built for publication: On the black-box complexity of correlation intractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906394)
