Practical Multilinear Maps over the Integers
From MaRDI portal
Publication:2845689
DOI10.1007/978-3-642-40041-4_26zbMath1309.94139OpenAlexW7540341MaRDI QIDQ2845689
Tancrède Lepoint, Mehdi Tibouchi, Jean-Sébastien Coron
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
Related Items (91)
One-Way Functions and (Im)perfect Obfuscation ⋮ Towards faster polynomial-time lattice reduction ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ Impossibility of order-revealing encryption in idealized models ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable ⋮ Predicate Encryption for Circuits from LWE ⋮ Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations ⋮ New Multilinear Maps Over the Integers ⋮ Indistinguishability Obfuscation from Compact Functional Encryption ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ 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 ⋮ Bad Directions in Cryptographic Hash Functions ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ 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 ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ New approaches to traitor tracing with embedded identities ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps ⋮ The random oracle model: a twenty-year retrospective ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Multilinear maps from obfuscation ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ 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 ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Fast practical lattice reduction through iterated compression ⋮ Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ Cryptographic multilinear maps using pro-\(p\) groups ⋮ A survey on functional encryption ⋮ Lattice-based programmable hash functions and applications ⋮ Indistinguishability obfuscation ⋮ Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing ⋮ An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Obfuscating conjunctions ⋮ Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ On the complexity of compressing obfuscation ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Constraining Pseudorandom Functions Privately ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Candidate iO from homomorphic encryption schemes ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ Multilinear Maps from Obfuscation ⋮ Perfect Structure on the Edge of Chaos ⋮ How to build time-lock encryption ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Functional Encryption Without Obfuscation ⋮ Obfuscating circuits via composite-order graded encoding ⋮ Constrained pseudorandom functions from functional encryption ⋮ Attribute-based fuzzy identity access control in multicloud computing environments ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Candidate iO from homomorphic encryption schemes ⋮ Universal proxy re-encryption ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ 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 ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Simultaneous diagonalization of incomplete matrices and applications ⋮ A polynomial-time algorithm for solving the hidden subset sum problem ⋮ Homomorphic Encryption ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
This page was built for publication: Practical Multilinear Maps over the Integers
