8 Result(s)
within
Stefan Lucks
Computer Science
Algorithm Analysis and Problem Complexity
Computer Communication Networks
Discrete Mathematics in Computer Science
-
Chapter and Conference Paper
McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes
On-Line Authenticated Encryption (OAE) combines privacy with data integrity and is on-line computable. Most block cipher-based schemes for Authenticated Encryption can be run on-line and are provably secure ag...
-
Chapter and Conference Paper
Mars Attacks! Revisited:
The block cipher MARS has been designed by a team from IBM and became one of the five finalists for the AES. A unique feature is the usage of two entirely different round function types. The ”wrapper rounds” a...
-
Chapter and Conference Paper
New Boomerang Attacks on ARIA
ARIA [5] is a block cipher proposed at ICISC’03. Its design is very similar to the Advanced Encryption Standard (AES). The authors propose that on 32-bit processors, the encryption speed is at least 70% of tha...
-
Chapter and Conference Paper
Some Observations on Indifferentiability
At Crypto 2005, Coron et al. introduced a formalism to study the presence or absence of structural flaws in iterated hash functions. If one cannot differentiate a hash function using ideal primitives from a ra...
-
Chapter and Conference Paper
Attacks on the DECT Authentication Mechanisms
Digital Enhanced Cordless Telecommunications (DECT) is a standard for connecting cordless telephones to a fixed telecommunications network over a short range. The cryptographic algorithms used in DECT are not ...
-
Chapter and Conference Paper
New Related-Key Boomerang Attacks on AES
In this paper we present two new attacks on round reduced versions of the AES. We present the first application of the related-key boomerang attack on 7 and 9 rounds of AES-192. The 7-round attack requires only 2
-
Chapter and Conference Paper
Concrete Security for Entity Recognition: The Jane Doe Protocol
Entity recognition does not ask whether the message is from some entity X, just whether a message is from the same entity as a previous message. This turns turns out to be very useful for low-end devices. The cur...
-
Chapter and Conference Paper
A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
The Cramer-Shoup cryptosystem for groups of prime order is a practical public-key cryptosystem, provably secure in the standard model under standard assumptions. This paper extends the cryptosystem for groups ...
