scispace - formally typeset
Open AccessJournal Article

A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications

Mihir Bellare, +1 more
- 01 Jan 2003 - 
- pp 491-506
TLDR
In this article, the concept of related-key deriving (RKD) functions is introduced, and a theoretical investigation of the block-cipher design-goal of security against RKAs is initiated.
Abstract: 
We initiate a theoretical investigation of the popular block-cipher design-goal of security against related-key attacks (RKAs). We begin by introducing definitions for the concepts of PRPs and PRFs secure against classes of RKAs, each such class being specified by an associated set of related-key deriving (RKD) functions. Then for some such classes of attacks, we prove impossibility results, showing that no block-cipher can resist these attacks while, for other, related classes of attacks that include popular targets in the block cipher community, we prove possibility results that provide theoretical support for the view that security against them is achievable. Finally we prove security of various block-cipher based constructs that use related keys, including a tweakable block cipher given in [14].

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

BiTR: built-in tamper resilience

Seung Geol Choi, +2 more
TL;DR: The notion of Built-in Tamper Resilience (BiTR) was introduced in this paper for cryptographic protocols, capturing the idea that the protocol that is encapsulated in a hardware token is designed in such a way so that tampering gives no advantage to an adversary.
Book ChapterDOI

Related-Key Cryptanalysis of the Full AES-192 and AES-256

Alex Biryukov, +1 more
TL;DR: This paper shows the first key recovery attack that works for all the keys and has 299.5 time and data complexity, while the recent attack by Biryukov-Khovratovich-Nikolic works for a weak key class and has much higher complexity.
Book ChapterDOI

Simple password-based encrypted key exchange protocols

Michel Abdalla, +1 more
TL;DR: This paper presents two simple password-based encrypted key exchange protocols based on that of Bellovin and Merritt, and one of them is more suitable to scenarios in which the password is shared across several servers, while the other enjoys better security properties.
Journal ArticleDOI

Tweakable Block Ciphers

Moses Liskov, +2 more
- 01 Jul 2011 - 
TL;DR: This work formalizes a cryptographic primitive, the “tweakable block cipher,” and suggests that tweakable block ciphers are easy to design, the extra cost of making a block cipher “Tweakable” is small, and it is easier to design and prove the security of applications of blockciphers that need this variability using tweakable blocks.
Book ChapterDOI

Key Homomorphic PRFs and Their Applications

Dan Boneh, +3 more
TL;DR: The first provably secure key homomorphic PRFs in the standard model were constructed in this article, based on the learning with errors (LWE) problem and decision linear assumption.
References
More filters
BookDOI

The Design of Rijndael

Joan Daemen, +1 more
TL;DR: This volume is the authoritative guide to the Rijndael algorithm and AES and professionals, researchers, and students active or interested in data encryption will find it a valuable source of information and reference.
Book ChapterDOI

How to construct random functions

Oded Goldreich, +2 more
TL;DR: A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented that has applications in cryptography, random constructions, and complexity theory.
Journal ArticleDOI

How to construct pseudorandom permutations from pseudorandom functions

Michael Luby, +1 more
- 01 Apr 1988 - 
TL;DR: Any pseudorandom bit generator can be used to construct a block private key cryptos system which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.
Book ChapterDOI

Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

Nicolas T. Courtois, +1 more
TL;DR: In this article, the security of S-boxes in block ciphers was studied under an additional hypothesis that the S-box can be described by an overdefined system of algebraic equations.
BookDOI

Advances in Cryptology — CRYPTO ’96

Neal Koblitz
TL;DR: This work presents new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function, and proves that NMAC and HMAC are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.