Simple and more efficient PRFs with tight security from LWE and matrix-DDH
type: Item
instance of: scholarly article
title: Simple and more efficient PRFs with tight security from LWE and matrix-DDH
zbMATH Open document ID: 1447.94045
DOI: 10.1007/978-3-030-03332-3_18
author: Tibor Jager
author: Rafael Kurek
author: Jia-xin Pan
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005649
zbMATH Keywords: pseudorandom functions
zbMATH Keywords: LWE
zbMATH Keywords: MDDH
zbMATH Keywords: augmented cascade
zbMATH Keywords: tight security
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 18
OpenAlex ID: W2810831417
cites work: New Proofs for NMAC and HMAC: Security Without Collision-Resistance
cites work: Q3210163
cites work: From Non-adaptive to Adaptive Pseudorandom Functions
cites work: Hardness Preserving Reductions via Cuckoo Hashing
cites work: On the Impossibility of Tight Cryptographic Reductions
cites work: Key Homomorphic PRFs and Their Applications
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
cites work: Q4737250
cites work: Universal classes of hash functions
cites work: Fully, (Almost) Tightly Secure IBE and Dual System Groups
cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem
cites work: Efficient Pseudorandom Functions via On-the-Fly Adaptation
cites work: An Algebraic Framework for Diffie-Hellman Assumptions
cites work: An algebraic framework for Diffie-Hellman assumptions
cites work: On the Cryptographic Applications of Random Functions (Extended Abstract)
cites work: Q3729902
cites work: Tightly CCA-Secure Encryption Without Pairings
cites work: Foundations of Cryptography
cites work: Waters Signatures with Optimal Security Reduction
cites work: Q3549728
cites work: Hardness Preserving Constructions of Pseudorandom Functions
cites work: Optimal Security Proofs for Full Domain Hash, Revisited
cites work: Cryptographic Extraction and Key Derivation: The HKDF Scheme
cites work: One way functions and pseudorandom generators
cites work: Why Proving HIBE Systems Secure Is Difficult
cites work: On lattices, learning with errors, random linear codes, and cryptography
Recommended article: Private constrained PRFs (and more) from LWE
Recommended article: Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
Recommended article: Privately constraining and programming PRFs, the LWE way
Recommended article: Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
Recommended article: Adaptively secure distributed PRFs from LWE
Recommended article: Improved Constructions of PRFs Secure Against Related-Key Attacks
Recommended article: More efficient lattice PRFs from keyed pseudorandom synthesizers
Recommended article: Matrix PRFs: constructions, attacks, and applications to obfuscation
Recommended article: On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
Recommended article: Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
description: scientific article; zbMATH DE number 7005649