Almost tight security in lattices with polynomial moduli—PRF, IBE, all-but-many LTF, and more

No abstract is available for this paper.

• Publication year

  2020

• Venue

  Designs, Codes and Cryptography

• Publication date

  2020-05-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10623-024-01523-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Towards tightly secure short linearly homomorphic signatures

  2024cited by this paper
• Lattice-based Authenticated Key Exchange with Tight Security

  2023cited by this paper
• Direct computation of branching programs and its applications to more efficient lattice-based cryptography

  2022cited by this paper
• Lattice-based Signatures with Tight Adaptive Corruptions and More

  2022cited by this paper
• Pseudorandom functions in NC class from the standard LWE assumption

  2021cited by this paper
• Key-Homomorphic Pseudorandom Functions from LWE with Small Modulus

  2020cited by this paper
• Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH

  2018cited by this paper
• All-But-Many Lossy Trapdoor Functions from Lattices and Applications

  2017influential reference
• All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE

  2017influential reference
• Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques

  2017cited by this paper
• Pseudorandom Functions: Three Decades Later

  2017influential reference
• Advances in Cryptology – CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part III

  2017cited by this paper
• Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II

  2016cited by this paper
• Extended Nested Dual System Groups, Revisited

  2016cited by this paper
• On the Hardness of Learning with Rounding over Small Modulus

  2016cited by this paper
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

  2016influential reference
• Tightly CCA-Secure Encryption Without Pairings

  2016cited by this paper
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

  2016influential reference
• Efficient Pseudorandom Functions via On-the-Fly Adaptation

  2015cited by this paper
• A Framework for Identity-Based Encryption with Almost Tight Security

  2015cited by this paper
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance

  2015influential reference
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

  2014cited by this paper
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication

  2014cited by this paper
• Introduction to Modern Cryptography, Second Edition

  2014cited by this paper
• New and Improved Key-Homomorphic Pseudorandom Functions

  2014cited by this paper
• Lattice-based FHE as secure as PKE

  2014influential reference
• Faster Bootstrapping with Polynomial Error

  2014influential reference
• Advances in Cryptology – CRYPTO 2014

  2014cited by this paper
• Learning with Rounding, Revisited: New Reduction, Properties and Applications

  2013cited by this paper
• Key Homomorphic PRFs and Their Applications

  2013cited by this paper
• Classical hardness of learning with errors

  2013cited by this paper
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

  2013influential reference
• Fully, (Almost) Tightly Secure IBE and Dual System Groups

  2013cited by this paper
• Advances in Cryptology – CRYPTO 2013

  2013cited by this paper
• Efficient Cryptosystems From 2k-th Power Residue Symbols

  2013cited by this paper
• E cient Cryptosystems From 2 k -th Power Residue Symbols ?

  2013cited by this paper
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

  2012cited by this paper
• Pseudorandomness

  2012cited by this paper
• Tightly secure signatures and public-key encryption

  2012cited by this paper
• Advances in Cryptology – EUROCRYPT 2012

  2012cited by this paper
• E cient Identity-based Signcryption without Random Oracles

  2012cited by this paper
• Pseudorandom Functions and Lattices

  2012influential reference
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

  2012cited by this paper
• Advances in Cryptology – CRYPTO 2012

  2012cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

  2011cited by this paper
• Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back)

  2010cited by this paper
• Efficient Lattice (H)IBE in the Standard Model

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

  2009cited by this paper
• Efficient pseudorandom functions from the decisional linear assumption and weaker variants

  2009cited by this paper
• Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  2009cited by this paper
• Efficient Identity-Based Encryption Without Random Oracles

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

  2005influential reference
• Worst-case to average-case reductions based on Gaussian measures

  2004influential reference
• Efficiency improvements for signature schemes with tight security reductions

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

  2001cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• Number-theoretic constructions of efficient pseudo-random functions

  1997cited by this paper
• The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin

  1996cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Identity-Based Cryptosystems and Signature Schemes

  1984cited by this paper
• How to Construct Random Functions (Extended Abstract)

  1984influential reference

• Fully selective opening secure IBE from LWE

  2025influential citation
• Revisiting Adaptively Secure IBE from Lattices with Smaller Modulus: A Conceptually Simple Framework with Low Overhead

  2025influential citation
• Adaptively Secure IBE from Lattices with Asymptotically Better Efficiency

  2025cites this paper
• Identity-based Matchmaking Encryption with Stronger Security and Instantiation on Lattices

  2024cites this paper
• Towards tightly secure short linearly homomorphic signatures

  2024cites this paper
• Discrete Gaussians Modulo Sub-Lattices: New Leftover Hash Lemmas for Discrete Gaussians

  2024cites this paper
• Compact and Tightly Secure (Anonymous) IBE from Module LWE in the QROM

  2024cites this paper
• Tagged Chameleon Hash from Lattice and Application to Redactable Blockchain

  2023cites this paper
• Direct computation of branching programs and its applications to more efficient lattice-based cryptography

  2022cites this paper
• Lattice-Based Linkable Ring Signature in the Standard Model

  2022cites this paper
• An Improved Lattice-Based Ring Signature with Unclaimable Anonymity in the Standard Model

  2022cites this paper
• New Lattice Two-Stage Sampling Technique and Its Applications to Functional Encryption - Stronger Security and Smaller Ciphertexts

  2021cites this paper
• The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its Application

  2021cites this paper
• Ring-Based Identity Based Encryption - Asymptotically Shorter MPK and Tighter Security

  2021cites this paper
• On the Hardness of Ring/Module/Polynomial LWR Problems

  2021cites this paper
• Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security

  2020cites this paper