Pages that link to "Item:Q2055602"
From MaRDI portal
The following pages link to Candidate iO from homomorphic encryption schemes (Q2055602):
Displaying 26 items.
- Secure software leasing (Q2056750) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Incompressible cryptography (Q2170026) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions (Q2170046) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Witness encryption and null-iO from evasive LWE (Q6135397) (← links)
- Candidate witness encryption from lattice techniques (Q6155267) (← links)
- Lockable obfuscation from circularly insecure fully homomorphic encryption (Q6169028) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- Distributed broadcast encryption from bilinear groups (Q6604936) (← links)
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
- How to garble mixed circuits that combine Boolean and arithmetic computations (Q6637574) (← links)
