Practical multilinear maps over the integers

DOI10.1007/978-3-642-40041-4_26zbMATH Open1309.94139OpenAlexW7540341MaRDI QIDQ2845689FDOQ2845689

Authors: Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi 

Publication date: 2 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_26

Recommendations

• New Multilinear Maps Over the Integers
• Candidate Multilinear Maps from Ideal Lattices
• On Kilian's randomization of multilinear map encodings
• Cryptanalysis of multilinear maps from ideal lattices: revisited
• Multilinear maps from obfuscation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (98)

• Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
• Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
• Generalized hardness assumption for self-bilinear map with auxiliary information
• Matrix PRFs: constructions, attacks, and applications to obfuscation
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
• Cryptanalysis of the CLT13 multilinear map
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Efficient obfuscation for CNF circuits and applications in cloud computing
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• Fully secure functional encryption for inner products, from standard assumptions
• Impossibility of order-revealing encryption in idealized models
• Return of GGH15: provable security against zeroizing attacks
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
• How to build time-lock encryption
• Multilinear maps from obfuscation
• Indistinguishability obfuscation from compact functional encryption
• Functional encryption without obfuscation
• Cryptanalysis of GGH15 multilinear maps
• Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
• How to avoid obfuscation using witness PRFs
• Delegating RAM computations with adaptive soundness and privacy
• Compactness vs collusion resistance in functional encryption
• Constraining pseudorandom functions privately
• Breaking the sub-exponential barrier in obfustopia
• Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
• Lattice-based SNARGs and their application to more efficient obfuscation
• Practical order-revealing encryption with limited leakage
• Algorithms for CRT-variant of approximate greatest common divisor problem
• Cryptanalysis of the co-ACD assumption
• Algebraic generalization of Diffie-Hellman key exchange
• Implementing candidate graded encoding schemes from ideal lattices
• GGHLite: more efficient multilinear maps from ideal lattices
• Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable
• On the correlation intractability of obfuscated pseudorandom functions
• Multilinear maps from obfuscation
• Title not available (Why is that?)
• On the complexity of compressing obfuscation
• Obfuscating circuits via composite-order graded encoding
• Predicate encryption for circuits from LWE
• The random oracle model: a twenty-year retrospective
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• New Multilinear Maps Over the Integers
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• Functional encryption: deterministic to randomized functions from simple assumptions
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• Candidate iO from homomorphic encryption schemes
• Homomorphic encryption
• Secure Obfuscation in a Weak Multilinear Map Model
• Proofs of Work from worst-case assumptions
• Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
• Constructions for quantum indistinguishability obfuscation
• Candidate Multilinear Maps from Ideal Lattices
• Attribute-based fuzzy identity access control in multicloud computing environments
• Universal proxy re-encryption
• Bad directions in cryptographic hash functions
• (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
• On Kilian's randomization of multilinear map encodings
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• On virtual grey box obfuscation for general circuits
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
• Towards faster polynomial-time lattice reduction
• One-Way Functions and (Im)perfect Obfuscation
• Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing
• Indistinguishability obfuscation: from approximate to exact
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• Obfuscating conjunctions
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Cryptanalyses of Candidate Branching Program Obfuscators
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• A polynomial-time algorithm for solving the hidden subset sum problem
• New approaches to traitor tracing with embedded identities
• Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation
• Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
• Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
• Candidate iO from homomorphic encryption schemes
• Lattice-based succinct arguments for NP with polylogarithmic-time verification
• Fast practical lattice reduction through iterated compression
• Simultaneous diagonalization of incomplete matrices and applications
• Key-policy attribute-based encryption for Boolean circuits from bilinear maps
• CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
• Curves with Fast Computations in the First Pairing Group
• A survey on functional encryption
• Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
• Cryptographic multilinear maps using pro-\(p\) groups
• Constrained (Verifiable) Pseudorandom Function from Functional Encryption
• Lattice-based programmable hash functions and applications
• Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
• Indistinguishability obfuscation
• Cryptanalysis of candidate obfuscators for affine determinant programs
• Shorter circuit obfuscation in challenging security models
• Fine-grained non-interactive key exchange, revisited
• Cryptanalysis of multilinear maps from ideal lattices: revisited
• Constrained pseudorandom functions from functional encryption
• Broadcast, trace and revoke with optimal parameters from polynomial hardness
• Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation

This page was built for publication: Practical multilinear maps over the integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845689)