Efficient Pseudorandom Functions via On-the-Fly Adaptation

DOI10.1007/978-3-662-47989-6_16zbMath1375.94092OpenAlexW1164719383MaRDI QIDQ3457117

Nico Döttling, Dominique Schröder

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_16

zbMATH Keywords

pseudorandom functionsLWEDDHefficient reductionsK-LIN

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (12)

Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ New approaches to traitor tracing with embedded identities ⋮ Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ A combinatorial approach to quantum random functions ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

Cites Work

• One way functions and pseudorandom generators
• An Algebraic Framework for Diffie-Hellman Assumptions
• From Non-adaptive to Adaptive Pseudorandom Functions
• Hardness Preserving Constructions of Pseudorandom Functions
• Pseudorandom Functions and Lattices
• Secure Hybrid Encryption from Weakened Key Encapsulation
• A theory of the learnable
• Hardness Preserving Reductions via Cuckoo Hashing
• Verifiable Delegation of Computation over Large Datasets
• Déjà Q: Using Dual Systems to Revisit q-Type Assumptions

This page was built for publication: Efficient Pseudorandom Functions via On-the-Fly Adaptation