Candidate Multilinear Maps from Ideal Lattices

DOI10.1007/978-3-642-38348-9_1zbMath1300.94055OpenAlexW1603256047MaRDI QIDQ4924400

Sanjam Garg, Craig Gentry, Shai Halevi

Publication date: 31 May 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_1

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (only showing first 100 items - show all)

Tensors in computations ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) ⋮ Trapdoors for Ideal Lattices with Applications ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ 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 ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Bad Directions in Cryptographic Hash Functions ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the security of functional encryption in the generic group model ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Witness encryption from smooth projective hashing system ⋮ Adaptive multiparty NIKE ⋮ Homomorphic encryption: a mathematical survey ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ On the hardness of the NTRU problem ⋮ 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 ⋮ Generating subgroups of ray class groups with small prime ideals ⋮ Lattice-based programmable hash functions and applications ⋮ Indistinguishability obfuscation ⋮ Ciphertext-policy attribute-based encryption for general circuits from bilinear maps ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ 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 ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Short Generators Without Quantum Computers: The Case of Multiquadratics ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Functional Encryption for Cascade Automata (Extended Abstract) ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ Simultaneous diagonalization of incomplete matrices and applications ⋮ Homomorphic Encryption ⋮ A Brief History of Pairings ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators ⋮ Lower bounds on lattice sieving and information set decoding ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ Efficient subtree-based encryption for fuzzy-entity data sharing ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Impossibility of order-revealing encryption in idealized models ⋮ A ciphertext-size lower bound for order-preserving encryption with limited leakage ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Practical witness-key-agreement for blockchain-based dark pools financial trading ⋮ Comments on ``Circuit ciphertext-policy attribute-based hybrid encryption with verifiable delegation ⋮ 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 ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ From FE combiners to secure MPC and back ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ New approaches to traitor tracing with embedded identities ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ Post-quantum online voting scheme ⋮ Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps ⋮ Lattice Point Enumeration on Block Reduced Bases ⋮ PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials ⋮ Multilinear maps from obfuscation ⋮ On virtual grey box obfuscation for general circuits ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Multiparty non-interactive key exchange and more from isogenies on elliptic curves ⋮ Characterizing overstretched NTRU attacks

This page was built for publication: Candidate Multilinear Maps from Ideal Lattices