8 Result(s)
within
Stefan Lucks
Operating Systems
-
Chapter
Cryptographic Attack Metrics
When evaluating systems containing cryptographic components, the question arises how to measure the security provided by the cryptography included in the system. In this chapter we highlight the difficulties i...
-
Chapter and Conference Paper
Secure Data Management in Trusted Computing
In this paper we identify shortcomings of the TCG specification related to the availability of sealed data during software and hardware life cycles, i.e., software update or/and hardware migration. In our view...
-
Chapter and Conference Paper
A Failure-Friendly Design Principle for Hash Functions
This paper reconsiders the established Merkle-Damgård design principle for iterated hash functions. The internal state size w of an iterated n-bit hash function is treated as a security parameter of its own right...
-
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 ...
-
Chapter and Conference Paper
Analysis of the E 0 Encryption System
The encryption system E 0 , which is the encryption system used in the Bluetooth specification, is examined. In the current paper, a method of deriving t...
-
Chapter and Conference Paper
Security on Your Hand: Secure Filesystems with a “Non-cryptographic” JAVA-Ring
In this paper we present the first implementation of highspeed filesystem encryption with a slow JAVA card. Using new “Remotely Keyed Protocols” designed by Lucks and Weis we can use the highly tamper-resistan...
-
Chapter and Conference Paper
The Sum of PRPs Is a Secure PRF
Given d independent pseudorandom permutations (PRPs) π i, ..., π d over 0, 1n, it appears natural to define a pseudorandom function (PRF) by add...
-
Chapter and Conference Paper
The Performance of Modern Block Ciphers in JAVA
This paper explores the question of how fast modern block ciphers can be realized as machine-independent Java implementations. The ciphers we considered include well-known proven ones such as DES and IDEA and ...
