Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
From MaRDI portal
Publication:3582783
DOI10.1007/978-3-642-14623-7_36zbMath1283.94050OpenAlexW2156439207MaRDI QIDQ3582783
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_36
Related Items (28)
Non-malleable functions and their applications ⋮ Related-key analysis of generalized Feistel networks with expanding round functions ⋮ Garbling XOR gates ``for free in the standard model ⋮ An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security ⋮ Security Against Related Randomness Attacks via Reconstructive Extractors ⋮ Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system ⋮ Public key encryption resilient to leakage and tampering attacks ⋮ Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions ⋮ Secure Message Authentication Against Related-Key Attack ⋮ The Chaining Lemma and Its Application ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ On the related-key attack security of authenticated encryption schemes ⋮ Continuously non-malleable codes against bounded-depth tampering ⋮ How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Related-key security for pseudorandom functions beyond the linear barrier ⋮ 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? ⋮ Clever Arbiters Versus Malicious Adversaries ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman ⋮ Provable related-key security of contracting Feistel networks ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties
This page was built for publication: Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
