Graph-Induced Multilinear Maps from Lattices
From MaRDI portal
Publication:5261689
DOI10.1007/978-3-662-46497-7_20zbMath1315.94076OpenAlexW57039937MaRDI QIDQ5261689
Sergey Gorbunov, Shai Halevi, Craig Gentry
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_20
Related Items (61)
Tensors in computations ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ Obfuscating finite automata ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ Cryptanalysis of multilinear maps from ideal lattices: revisited ⋮ Proofs of Work from worst-case assumptions ⋮ New approaches to traitor tracing with embedded identities ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Multilinear maps from obfuscation ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Candidate witness encryption from lattice techniques ⋮ Cryptographic multilinear maps using pro-\(p\) groups ⋮ A survey on functional encryption ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ On the complexity of compressing obfuscation ⋮ Constraining Pseudorandom Functions Privately ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Candidate iO from homomorphic encryption schemes ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Multilinear Maps from Obfuscation ⋮ How to build time-lock encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Candidate iO from homomorphic encryption schemes ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Universal proxy re-encryption ⋮ Cryptanalysis of GGH15 Multilinear Maps ⋮ Simultaneous diagonalization of incomplete matrices and applications ⋮ Homomorphic Encryption ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
This page was built for publication: Graph-Induced Multilinear Maps from Lattices
