Candidate Multilinear Maps from Ideal Lattices

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2013-05-26

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-38348-9_1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Reusable garbled circuits and succinct functional encryption

  2013cited by this paper
• Attribute-based encryption for circuits

  2013cited by this paper
• Witness encryption and its applications

  2013cited by this paper
• On the Circular Security of Bit-Encryption

  2013cited by this paper
• Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures

  2012cited by this paper
• Sampling Discrete Gaussians Efficiently and Obliviously

  2012cited by this paper
• Candidate Multilinear Maps from Ideal Lattices and Applications

  2012cited by this paper
• Functional Encryption with Bounded Collusions via Multi-party Computation

  2012cited by this paper
• Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond

  2012cited by this paper
• Attribute-Based Encryption for Circuits from Multilinear Maps

  2012cited by this paper
• Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic

  2012cited by this paper
• Number Field Sieve

  2011cited by this paper
• Advances in cryptology : Eurocrypt 2011 : 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15-19, 2011 : proceedings

  2011cited by this paper
• BiTR: Built-in Tamper Resilience

  2011cited by this paper
• Implementing Gentry's Fully-Homomorphic Encryption Scheme

  2011cited by this paper
• Pairing-Based Cryptography - Pairing 2010

  2011cited by this paper
• Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography

  2011cited by this paper
• Homomorphic Signatures for Polynomial Functions

  2011cited by this paper
• An Efficient and Parallel Gaussian Sampler for Lattices

  2010cited by this paper
• On Ideal Lattices and Learning with Errors over Rings

  2010cited by this paper
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

  2010cited by this paper
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding

  2010cited by this paper
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness

  2010cited by this paper
• Optimal Authenticated Data Structures with Multilinear Forms

  2010cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• Aggregate and Verifiably Encrypted Signatures from Multilinear Maps Without Random Oracles

  2009cited by this paper
• Advances in Information Security and Assurance

  2009cited by this paper
• The number field sieve

  2008cited by this paper
• THE ARITHMETIC OF NUMBER RINGS

  2008cited by this paper
• Trapdoors for hard lattices and new cryptographic constructions

  2008cited by this paper
• Lattices that admit logarithmic worst-case to average-case connection factors

  2007cited by this paper
• Advances in Cryptology - EUROCRYPT 2006

  2006cited by this paper
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

  2006cited by this paper
• Polynomial time quantum algorithm for the computation of the unit group of a number field

  2005cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005cited by this paper
• Fast quantum algorithms for computing the unit group and class group of a number field

  2005cited by this paper
• Worst-case to average-case reductions based on Gaussian measures

  2004cited by this paper
• A method to solve cyclotomic norm equations f * f

  2004cited by this paper
• A Method to Solve Cyclotomic Norm Equations

  2004cited by this paper
• NTRUSIGN: Digital Signatures Using the NTRU Lattice

  2003cited by this paper
• Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures

  2003cited by this paper
• Topics in Cryptology — CT-RSA 2003

  2003cited by this paper
• Traitor Tracing with Constant Transmission Rate

  2002cited by this paper
• Applications of Multilinear Forms to Cryptography

  2002cited by this paper
• Cryptanalysis of the Revised NTRU Signature Scheme

  2002cited by this paper
• Identity-Based Encryption from the Weil Pairing

  2001cited by this paper
• Improving Lattice Based Cryptosystems Using the Hermite Normal Form

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT 2001

  2001cited by this paper
• Advances in Cryptology — CRYPTO ’96

  2001cited by this paper
• Key Recovery and Message Attacks on NTRU-Composite

  2001cited by this paper
• Self Protecting Pirates and Black-Box Traitor Tracing

  2001cited by this paper
• NSS: An NTRU Lattice-Based Signature Scheme

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT ’97

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT ’96

  2001cited by this paper
• Advances in Cryptology

  2000cited by this paper
• A One Round Protocol for Tripartite Diffie–Hellman

  2000cited by this paper
• Factoring N = prq for Large r

  1999cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• Advances in cryptology, EUROCRYPT '97 : International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997 : proceedings

  1997cited by this paper
• Lattice Attacks on NTRU

  1997cited by this paper
• Advances in Cryptology — CRYPTO '97

  1997cited by this paper
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

  1996cited by this paper
• Algorithmic number theory

  1996cited by this paper
• Finding a Small Root of a Univariate Modular Equation

  1996cited by this paper
• Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)

  1996cited by this paper
• Public-Key Cryptosystems from Lattice Reduction Problems

  1996cited by this paper
• Subquadratic-time factoring of polynomials over finite fields

  1995cited by this paper
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  1995cited by this paper
• The Development of the Number Field Sieve

  1994cited by this paper
• A general number field sieve implementation

  1993cited by this paper
• The Development of the Number Field Sieve

  1993cited by this paper
• Number Theoretic Algorithms and Cryptology

  1991cited by this paper
• A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms

  1987cited by this paper
• Factoring polynominals over algebraic number fields

  1983cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper
• On the units of cyclotomic fields

  1966cited by this paper
• Neuer Beweis des Primzahlsatzes und Beweis des Primidealsatzes

  1903cited by this paper

• Adaptive NIKE for Unbounded Parties

  2026cites this paper
• Fuzzy Extractors are Practical: Cryptographic Strength Key Derivation from the Iris

  2025cites this paper
• Solving the Decision Principal Ideal Problem with Pre-processing

  2025cites this paper
• A Parallel Lattice Basis Reduction Algorithm Based on Progressive BKZ

  2025cites this paper
• An efficient quantum algorithm for computing S-units and its applications

  2025cites this paper
• Function-Hiding Multi-Client Inner-Product Functional Encryption Without Pairings for Large Space

  2025cites this paper
• TreeCast: Multi-Party Key Establishment Protocol for IoT Devices

  2025cites this paper
• Multivariate exponential equations with unknown coefficients

  2025cites this paper
• Unbiasable Verifiable Random Functions from Generic Assumptions

  2025cites this paper
• Scalable Private World Computer via Root iO: Application-Agnostic iO and Our Roadmap for Making It Practical

  2025cites this paper
• Tight Adaptive Simulation Security for Identity-based Inner-Product FE in the (Quantum) Random Oracle Model

  2025cites this paper
• Leveled Homomorphic Encryption over Composite Groups

  2025cites this paper
• Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes

  2025influential citation
• ON THE SECURITY OF GENERALIZED MULTILINEAR MAPS BASED ON WEIL PAIRING

  2025cites this paper
• Revisiting LWR: A Novel Reduction Through Quantum Approximations

  2025cites this paper
• A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms

  2025cites this paper
• HardCODE: Hardware-based Circuit Obfuscation using Data Encryption

  2025cites this paper
• Indistinguishability Obfuscation from Ring Key-Homomorphic Weak PRFs

  2025cites this paper
• Towards Practical Multi-Client Order-Revealing Encryption: Improvement and Application

  2024cites this paper
• Cloud-SMPC: two-round multilinear maps secure multiparty computation based on LWE assumption

  2024cites this paper
• Self-Bilinear Map from One Way Encoding System and i𝒪

  2024cites this paper
• Homomorphic Witness Encryption and Its Applications

  2024cites this paper
• A reduction from Hawk to the principal ideal problem in a quaternion algebra

  2024cites this paper
• Cryptanalysis of rank-2 module-LIP in Totally Real Number Fields

  2024influential citation
• FiveEyes: Cryptographic Biometric Authentication from the Iris

  2024cites this paper
• Provably Secure Non-interactive Key Exchange Protocol for Group-Oriented Applications in Scenarios with Low-Quality Networks

  2024cites this paper
• Heuristic Ideal Obfuscation Scheme based on LWE Problem, its Variants and Quantum Oracle

  2024cites this paper
• Finding Generators of Ideals in Non-Cyclic Number Fields by Using Norm Relations

  2024cites this paper
• Garbled Circuits with 1 Bit per Gate

  2024cites this paper
• Broadcast, Trace and Revoke with Optimal Parameters from Polynomial Hardness

  2023cites this paper
• Multiparty Noninteractive Key Exchange from Ring Key-Homomorphic Weak PRFs

  2023cites this paper
• On the Invalidity of LV16/Lin17 Obfuscation Schemes

  2023influential citation
• A polynomial time algorithm for breaking NTRU encryption with multiple keys

  2023cites this paper
• Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation

  2023cites this paper
• Upgrading Fuzzy Extractors

  2023cites this paper
• Unit Reducible Cyclotomic Fields

  2023cites this paper
• A Concrete Construction Encryption Mechanism Based Spatio Temporal Analysis for Securing BigData Storage in Cloud

  2023cites this paper
• Delegatable Order-Revealing Encryption for Reliable Cross-Database Query

  2023cites this paper
• A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs

  2023influential citation
• Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification

  2023cites this paper
• Learning with errors over group rings constructed by semi-direct product

  2023cites this paper
• On the security of functional encryption in the generic group model

  2023cites this paper
• Spherical Gaussian Leftover Hash Lemma via the Rényi Divergence

  2023cites this paper
• Dynamic Authenticated Asymmetric Group Key Agreement With Sender Non-Repudiation and Privacy for Group-Oriented Applications

  2023cites this paper
• A Post-Quantum Privacy-Enhancing Blockchain-Based Transaction Framework with Access Control

  2023cites this paper
• Dynamic identity‐based broadcast proxy re‐encryption for data sharing in autonomous vehicles

  2023cites this paper
• Subfield Attack on NTRU by using symmetric function map

  2023cites this paper
• Use of cryptography in malware obfuscation

  2022cites this paper
• SoK: Use of Cryptography in Malware Obfuscation

  2022cites this paper
• Compact and efficient KEMs over NTRU lattices

  2022cites this paper
• Adaptive Multiparty NIKE

  2022cites this paper
• Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪

  2022cites this paper
• Witness Encryption and Null-IO from Evasive LWE

  2022cites this paper
• Fully homomorphic encryption: A case study

  2022influential citation
• Unit Reducible Fields and Perfect Unary Forms

  2022cites this paper
• Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions

  2022cites this paper
• Unbounded Quadratic Functional Encryption and More from Pairings

  2022cites this paper
• A Survey on Post-Quantum Public-Key Signature Schemes for Secure Vehicular Communications

  2022cites this paper
• Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees

  2022cites this paper
• On the Invalidity of Lin16/Lin17 Obfuscation Schemes

  2022cites this paper
• Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

  2022cites this paper
• Star-Specific Key-Homomorphic PRFs From Learning With Linear Regression

  2022cites this paper
• Compact and Efficient NTRU-based KEM with Scalable Ciphertext Compression

  2022cites this paper
• Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness

  2021cites this paper
• Indistinguishability Obfus ation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Se urity Ampli(cid:28) ation ⋆

  2021cites this paper
• Simple and efficient FE for quadratic functions

  2021cites this paper
• Indistinguishability obfuscation from circular security

  2021cites this paper
• Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs

  2021cites this paper
• Hacking supply chain 2.0 with smart machines: Supply chain 2.0 might be at risk, if not train enough against the hacking ML algorithms.

  2021cites this paper
• Building Usable Witness Encryption

  2021influential citation
• NIKE from Affine Determinant Programs

  2021cites this paper
• New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries

  2021cites this paper
• NTRU Fatigue: How Stretched is Overstretched?

  2021cites this paper
• Post-quantum blind signcryption scheme from lattice

  2021cites this paper
• Pairing for Greenhorn: Survey and Future Perspective

  2021cites this paper
• Lattice Attacks on NTRU and LWE: A History of Refinements

  2021cites this paper
• Cryptanalysis of FRS Obfuscation based on the CLT13 Multilinear Map

  2021cites this paper
• Post-quantum Online Voting Scheme

  2021cites this paper
• Lower bounds on lattice sieving and information set decoding

  2021cites this paper
• On the hardness of the NTRU problem

  2021cites this paper
• A survey on Functional Encryption

  2021cites this paper
• Hours of Horus: Keyless Cryptocurrency Wallets

  2021cites this paper
• A detailed analysis of primal attack and its variants

  2021cites this paper
• Non-randomness of S-unit lattices

  2021cites this paper
• (In)security of concrete instantiation of Lin17’s functional encryption scheme from noisy multilinear maps

  2021influential citation
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

  2021cites this paper
• Efficient First-Price Sealed-Bid Auction Scheme

  2021cites this paper
• Cryptographic multilinear maps using pro-p groups

  2021cites this paper
• Blockchain-Based Key Management Scheme in Fog-Enabled IoT Systems

  2021cites this paper
• Tightly CCA-Secure Inner Product Functional Encryption Scheme

  2021cites this paper
• Faster Rotation-Based Gauss Sieve for Solving the SVP on General Ideal Lattices

  2021cites this paper
• Efficient Multilinear Map from Graded Encoding Scheme

  2021cites this paper
• High-Performance Constant-Time Discrete Gaussian Sampling

  2021cites this paper
• Practical Witness-Key-Agreement for Blockchain-Based Dark Pools Financial Trading

  2021cites this paper
• Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices

  2020cites this paper
• Cryptographic Obfuscation: A Survey

  2020cites this paper
• Multi-Input Quadratic Functional Encryption from Pairings

  2020cites this paper
• On the smoothing parameter and last minimum of random orthogonal lattices

  2020cites this paper
• Quadratic Residues and Applications in Cryptography-extended abstract

  2020cites this paper
• Key-Aggregate Proxy Re-Encryption with Dynamic Condition Generation Using Multilinear Map

  2020cites this paper