Simple and more efficient PRFs with tight security from LWE and matrix-DDH
From MaRDI portal
Publication:1710687
DOI10.1007/978-3-030-03332-3_18zbMath1447.94045OpenAlexW2810831417MaRDI QIDQ1710687
Rafael Kurek, Tibor Jager, Jia-xin Pan
Publication date: 23 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_18
Related Items (6)
Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ Verifiable random functions with optimal tightness ⋮ Short identity-based signatures with tight security from lattices ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic framework for Diffie-Hellman assumptions
- One way functions and pseudorandom generators
- Universal classes of hash functions
- Tightly CCA-Secure Encryption Without Pairings
- Key Homomorphic PRFs and Their Applications
- An Algebraic Framework for Diffie-Hellman Assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- New and Improved Key-Homomorphic Pseudorandom Functions
- From Non-adaptive to Adaptive Pseudorandom Functions
- Hardness Preserving Constructions of Pseudorandom Functions
- Optimal Security Proofs for Full Domain Hash, Revisited
- Pseudorandom Functions and Lattices
- Waters Signatures with Optimal Security Reduction
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation
- Cryptographic Extraction and Key Derivation: The HKDF Scheme
- Foundations of Cryptography
- A Reliable Randomized Algorithm for the Closest-Pair Problem
- Hardness Preserving Reductions via Cuckoo Hashing
- Why Proving HIBE Systems Secure Is Difficult
- On the Impossibility of Tight Cryptographic Reductions
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Simple and more efficient PRFs with tight security from LWE and matrix-DDH