Pages that link to "Item:Q2829233"
From MaRDI portal
The following pages link to Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (Q2829233):
Displaying 45 items.
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← 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)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions (Q2170046) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information (Q2817818) (← links)
- Shorter Circuit Obfuscation in Challenging Security Models (Q2827739) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- Cryptanalysis of GGH15 Multilinear Maps (Q2829232) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model (Q2980868) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 (Q5738782) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← 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) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- Time-lock puzzles from lattices (Q6652906) (← links)
