Structure versus hardness through the obfuscation lens
From MaRDI portal
(Redirected from Publication:5149758)
Recommendations
- Structure vs. hardness through the obfuscation lens
- Lower bounds on assumptions behind indistinguishability obfuscation
- One-Way Functions and (Im)perfect Obfuscation
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
Cites work
- A complete problem for statistical zero knowledge
- A method for obtaining digital signatures and public-key cryptosystems
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- A punctured programming approach to adaptively secure functional encryption
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- An Equivalence Between Zero Knowledge and Commitments
- Black-box reductions and separations in cryptography
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Can PPAD hardness be based on standard cryptographic assumptions?
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Distributional collision resistance beyond one-way functions
- Does co-NP have short interactive proofs ?
- Dual vectors and lower bounds for the nearest lattice point problem
- Efficient fully homomorphic encryption from (standard) LWE
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- From absolute distinguishability to positive distinguishability
- Fully homomorphic encryption using ideal lattices
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Limits of provable security for homomorphic encryption
- Limits on the power of indistinguishability obfuscation and functional encryption
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- New directions in cryptography
- Notions of black-box reductions, revisited
- On basing one-way functions on NP-hardness
- On basing private information retrieval on NP-hardness
- On basing size-verifiable one-way functions on NP-hardness
- On black-box reductions between predicate encryption schemes
- On black-box separations among injective one-way functions
- On constructing one-way permutations from indistinguishability obfuscation
- On distributional collision resistant hashing
- On the (Im)Possibility of Key Dependent Encryption
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On the complexity of collision resistant hash functions: new and old black-box separations
- On the complexity of the parity argument and other inefficient proofs of existence
- On the instantiability of hash-and-sign RSA signatures
- On total functions, existence theorems and computational complexity
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public-key cryptography from different assumptions
- Relativized cryptography
- Settling the complexity of computing two-player Nash equilibria
- Statistical zero-knowledge languages can be recognized in two rounds
- Structure vs combinatorics in computational complexity
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
- The complexity of computing a Nash equilibrium
- The complexity of promise problems with applications to public-key cryptography
- The dual BKR inequality and Rudich's conjecture
- The knowledge complexity of interactive proof-systems
- Theory of Cryptography
- Theory of cryptography. 8th theory of cryptography conference, TCC 2011, Providence, RI, USA, March 28--30, 2011. Proceedings
- Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19--21, 2012. Proceedings
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- Zaps and Their Applications
Cited in
(6)- Structure vs. hardness through the obfuscation lens
- One-Way Functions and (Im)perfect Obfuscation
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- (Inefficient prover) ZAPs from hard-to-invert functions
- One-way functions vs. TFNP: Simpler and improved
This page was built for publication: Structure versus hardness through the obfuscation lens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149758)
