Graph-induced multilinear maps from lattices
From MaRDI portal
Recommendations
Cited in
(79)- 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
- Proofs of Work from worst-case assumptions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Graded encoding schemes from obfuscation
- 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
- 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
- Constructions for quantum indistinguishability obfuscation
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- New approaches to traitor tracing with embedded identities
- Multilinear maps from obfuscation
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Constrained pseudorandom functions from functional encryption
- Cryptanalysis of multilinear maps from ideal lattices: revisited
- Algebraic generalization of Diffie-Hellman key exchange
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- A NOTE ON RECONSTRUCTION OF SPACES AND MAPS FROM LATTICE DATA
- Implementing candidate graded encoding schemes from ideal lattices
- Indistinguishability obfuscation: from approximate to exact
- Multilinear maps from obfuscation
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Cryptanalysis of GGH15 multilinear maps
- Delegating RAM computations with adaptive soundness and privacy
- Secure Obfuscation in a Weak Multilinear Map Model
- Compactness vs collusion resistance in functional encryption
- Practical order-revealing encryption with limited leakage
- Candidate Multilinear Maps from Ideal Lattices
- Homomorphic encryption
- Collusion resistant traitor tracing from learning with errors
- 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
- 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
- Simultaneous diagonalization of incomplete matrices and applications
- Tensors in computations
- Watermarking cryptographic functionalities from standard lattice assumptions
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Candidate iO from homomorphic encryption schemes
- 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
- How to construct quantum FHE, generically
- Adaptively sound zero-knowledge SNARKs for UP
- Learning with errors over group rings constructed by semi-direct product
- Simple and general counterexamples for private-coin evasive LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- On quantum money and evasive obfuscation
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Quantum money from abelian group actions
- Quantum money from abelian group actions
- Non-interactive key exchange: new notions, new constructions, and forward security
- Towards general-purpose program obfuscation via local mixing
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Quantum money from class group actions on elliptic curves
- Indistinguishability obfuscation from well-founded assumptions
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Obfuscating finite automata
This page was built for publication: Graph-induced multilinear maps from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261689)
