Pages that link to "Item:Q2796138"
From MaRDI portal
The following pages link to Perfect Structure on the Edge of Chaos (Q2796138):
Displaying 23 items.
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Bounded KDM Security from iO and OWF (Q2827740) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
