![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Privacy-Preserving Distributed Economic Dispatch Protocol for Smart Grid
The economic dispatch (ED) problem is a large-scale optimization problem in electricity power grids. Its goal is to find a power output combination of all generator nodes that meet the demand of the customers ...
-
Article
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis
In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value
-
Chapter and Conference Paper
Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations
At CHES 2010, the new block cipher PRINTcipher was presented. In addition to using an xor round key as is common practice for round-based block ciphers, PRINTcipher also uses key-dependent permutations. While thi...
-
Chapter and Conference Paper
A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
At CHES 2010, the new block cipher PRINTcipher was presented as a light-weight encryption solution for printable circuits [15]. The best attack to date is a differential attack [1] that breaks less than half of t...
-
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
Badger – A Fast and Provably Secure MAC
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is used and its security is proven....
-
Chapter and Conference Paper
On the Efficiency of the Clock Control Guessing Attack
Many bitstream generators are based on linear feedback shift registers. A widespread technique for the cryptanalysis of those generators is the linear consistency test (LCT). In this paper, we consider an appl...
-
Chapter and Conference Paper
Improved Cryptanalysis of the Self-Shrinking Generator
We propose a new attack on the self-shrinking generator [8]. The attack is based on a backtracking algorithm and will reconstruct the key from a short sequence of known keystream bits. We give both mathematical a...