Return of GGH15: provable security against zeroizing attacks
From MaRDI portal
Publication:1631349
DOI10.1007/978-3-030-03810-6_20zbMath1430.94056OpenAlexW2899995952MaRDI QIDQ1631349
Fermi Ma, Mark Zhandry, James Bartusek, Jiaxin Guan
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_20
Related Items (15)
New approaches for quantum copy-protection ⋮ Hidden cosets and applications to unclonable cryptography ⋮ One-Way Functions and (Im)perfect Obfuscation ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Witness encryption and null-iO from evasive LWE ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ Tracing quantum state distinguishers via backtracking ⋮ Secure software leasing from standard assumptions ⋮ Obfustopia built on secret-key functional encryption ⋮ Candidate obfuscation via oblivious LWE sampling
Cites Work
- Unnamed Item
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Factoring polynomials with rational coefficients
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Return of GGH15: provable security against zeroizing attacks
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of GGH15 Multilinear Maps
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Key Homomorphic PRFs and Their Applications
- Practical Multilinear Maps over the Integers
- Cryptanalysis of the Multilinear Map over the Integers
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Secure Obfuscation in a Weak Multilinear Map Model
- Trapdoors for hard lattices and new cryptographic constructions
- Reducing elliptic curve logarithms to logarithms in a finite field
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Candidate Multilinear Maps from Ideal Lattices
- Graph-Induced Multilinear Maps from Lattices
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
- Cryptanalyses of Candidate Branching Program Obfuscators
- Protecting Obfuscation against Algebraic Attacks
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Return of GGH15: provable security against zeroizing attacks
