SPRING: Fast Pseudorandom Functions from Rounded Ring Products

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Fast Software Encryption Workshop

• Publication date

  2014-03-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-46706-0_3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Batch Fully Homomorphic Encryption over the Integers

  2013cited by this paper
• Solving BDD by Enumeration: An Update

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

  2013cited by this paper
• Estimating Key Sizes for High Dimensional Lattice-Based Systems

  2013cited by this paper
• Homomorphic Evaluation of the AES Circuit

  2012cited by this paper
• Pseudorandom Functions and Lattices

  2012influential reference
• New Algorithms for Learning in Presence of Errors

  2011cited by this paper
• Better Key Sizes (and Attacks) for LWE-Based Encryption

  2011cited by this paper
• BKZ 2.0: Better Lattice Security Estimates

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

  2010cited by this paper
• Faster exponential time algorithms for the shortest vector problem

  2010cited by this paper
• Faster and Timing-Attack Resistant AES-GCM

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

  2009cited by this paper
• SWIFFT: A Modest Proposal for FFT Hashing

  2008influential reference
• Lattice-Based Cryptography

  2006cited by this paper
• Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

  2006cited by this paper
• Generalized Compact Knapsacks Are Collision Resistant

  2006cited by this paper
• Rijndael/AES

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

  2005cited by this paper
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

  2005cited by this paper
• The Design of Rijndael: AES - The Advanced Encryption Standard

  2002cited by this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002cited by this paper
• Pseudorandom Functions and Factoring

  2002cited by this paper
• A Generalized Birthday Problem

  2002cited by this paper
• The Design of Rijndael

  2002cited by this paper
• Noise-tolerant learning, the parity problem, and the statistical query model

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

  1997cited by this paper
• Synthesizers and their application to the parallel construction of pseudo-random functions

  1995cited by this paper
• Small-bias probability spaces: efficient constructions and applications

  1990cited by this paper
• Data encryption standard

  1987cited by this paper
• How to construct random functions

  1986cited by this paper
• A Simple Unpredictable Pseudo-Random Number Generator

  1986cited by this paper
• How to generate cryptographically strong sequences of pseudo random bits

  1982cited by this paper

• Pool: A Practical OT-based OPRF from Learning with Rounding

  2025cites this paper
• LEAP: High-Performance Lattice-Based Pseudorandom Number Generator

  2025cites this paper
• Identity-Based Deterministic Proxy Re-Encryption Scheme on Lattice

  2022influential citation
• Learning with Physical Noise or Errors

  2020cites this paper
• Towards Practical GGM-Based PRF from (Module-)Learning-with-Rounding

  2019cites this paper
• Practical Provably-Secure Authenticated Encryption Schemes Using Lattice-based Pseudorandom Function SPRING

  2018influential citation
• Advances in public-key cryptology and computer exploitation. (Avancées en cryptologie à clé publique et exploitation informatique)

  2017cites this paper
• Pseudorandom Functions: Three Decades Later

  2017cites this paper
• CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM

  2017cites this paper
• Fast Lattice-Based Encryption: Stretching Spring

  2017cites this paper
• Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems

  2016influential citation
• Challenges for Ring-LWE

  2016cites this paper
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity

  2016cites this paper
• Efficient Lattice-based Authenticated Encryption: A Practice-Oriented Provable Security Approach

  2016influential citation
• A Decade of Lattice Cryptography

  2016cites this paper
• New constructions of cryptographic pseudorandom functions

  2015cites this paper
• Chris Peikert – Research Statement

  2014cites this paper
• FPGA Implementations of SPRING - And Their Countermeasures against Side-Channel Attacks

  2014cites this paper
• On the Concrete Hardness of LWR with a Power of Two Modulus

  year unknowncites this paper