Cryptanalysis of GGH map
From MaRDI portal
Recommendations
Cited in
(52)- Efficient subtree-based encryption for fuzzy-entity data sharing
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Towards breaking the exponential barrier for general secret sharing
- On virtual grey box obfuscation for general circuits
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)
- How to build time-lock encryption
- Efficient obfuscation for CNF circuits and applications in cloud computing
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Combiners for functional encryption, unconditionally
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Fast reduction of algebraic lattices over cyclotomic fields
- Cryptanalysis of candidate obfuscators for affine determinant programs
- From minicrypt to obfustopia via private-key functional encryption
- From FE combiners to secure MPC and back
- Attribute based encryption for deterministic finite automata from DLIN
- Multilinear maps from obfuscation
- Constrained pseudorandom functions from functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Cryptanalysis of multilinear maps from ideal lattices: revisited
- Algebraic generalization of Diffie-Hellman key exchange
- Cryptanalysis of the CLT13 multilinear map
- Indistinguishability obfuscation: from approximate to exact
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Cryptanalysis of GGH15 multilinear maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Fully secure functional encryption for inner products, from standard assumptions
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model
- Secure Obfuscation in a Weak Multilinear Map Model
- Practical order-revealing encryption with limited leakage
- Collusion resistant traitor tracing from learning with errors
- Obfuscating conjunctions
- Ciphertext-policy attribute-based encryption for general circuits from bilinear maps
- GGHLite: more efficient multilinear maps from ideal lattices
- Constraining pseudorandom functions privately
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Functional encryption: deterministic to randomized functions from simple assumptions
- Simultaneous diagonalization of incomplete matrices and applications
- Can PPAD hardness be based on standard cryptographic assumptions?
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Candidate iO from homomorphic encryption schemes
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Lattice-based programmable hash functions and applications
- Lattice-based post-quantum iO from circular security with random opening assumption
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
This page was built for publication: Cryptanalysis of GGH map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820496)
