Pages that link to "Item:Q5259583"
From MaRDI portal
The following pages link to How to use indistinguishability obfuscation (Q5259583):
Displaying 50 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Function-private functional encryption in the private-key setting (Q1747663) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Quantum-access-secure message authentication via blind-unforgeability (Q2055681) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
- Hidden cosets and applications to unclonable cryptography (Q2120094) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
