Improved constructions of PRFs secure against related-key attacks

DOI10.1007/978-3-319-07536-5_4MaRDI QIDQ5168534zbMATH OpenOpenAlexFDO

Authors Kevin Lewi, Hart Montgomery, Ananth Raghunathan

Publication date 7 July 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07536-5_4

zbMATH Keywords

learning with errorspseudorandom functionsrelated-key attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Related-key security for pseudorandom functions beyond the linear barrier
• Related-key security for pseudorandom functions beyond the linear barrier
• Pseudorandom functions and permutations provably secure against related-key attacks
• Cryptography secure against related-key attacks and tampering
• Pseudorandom functions from LWE: RKA security and application

Cited in

(22)

• Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Related-key security for pseudorandom functions beyond the linear barrier
• Algebraic XOR-RKA-secure pseudorandom functions from post-zeroizing multilinear maps
• High-resolution EM attacks against leakage-resilient PRFs explained and an improved construction
• Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
• Cryptanalysis of the CLT13 multilinear map
• Related-key security for pseudorandom functions beyond the linear barrier
• Continuous non-malleable key derivation and its application to related-key security
• Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
• Efficient public-key cryptography with bounded leakage and tamper resilience
• Cryptography secure against related-key attacks and tampering
• Pseudorandom functions and permutations provably secure against related-key attacks
• RKA security beyond the linear barrier: IBE, encryption and signatures
• Related key secure PKE from hash proof systems
• Notions and relations for RKA-secure permutation and function families
• Fast Software Encryption
• Functional encryption: deterministic to randomized functions from simple assumptions
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Constrained pseudorandom functions for inner-product predicates from weaker assumptions
• SILBE: an updatable public key encryption scheme from lollipop attacks

This page was built for publication: Improved constructions of PRFs secure against related-key attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168534)