An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
From MaRDI portal
Publication:3457120
DOI10.1007/978-3-662-47989-6_19zbMath1375.94094OpenAlexW1415244803MaRDI QIDQ3457120
Alain Passelègue, Michel Abdalla, Fabrice Benhamouda
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.736.4868
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
Public key encryption resilient to leakage and tampering attacks, Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Key-homomorphic pseudorandom functions from LWE with small modulus
Cites Work
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Key Homomorphic PRFs and Their Applications
- An Algebraic Framework for Diffie-Hellman Assumptions
- Pseudorandom Functions and Lattices
- Correlated-Input Secure Hash Functions
- Distinguisher and Related-Key Attack on the Full AES-256
- Related-Key Rectangle Attacks on Reduced AES-192 and AES-256
- Constructing Verifiable Random Functions with Large Input Spaces
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Related-Key Boomerang and Rectangle Attacks
- Minimal Identities for Algebras
