Sciweavers

Share
INFOCOM
2012
IEEE
7 years 5 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
JUCS
2006
137views more  JUCS 2006»
8 years 7 months ago
Progress in Quantum Computational Cryptography
: Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. ...
Akinori Kawachi, Takeshi Koshiba

Publication
152views
8 years 10 months ago
Expected loss analysis of thresholded authentication protocols in noisy conditions
A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting $n$ rounds, with no error corr...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
9 years 9 days ago
Delayed-Key Message Authentication for Streams
We consider message authentication codes for streams where the key becomes known only at the end of the stream. This usually happens in key-exchange protocols like SSL and TLS wher...
Marc Fischlin, Anja Lehmann
FSE
2003
Springer
228views Cryptology» more  FSE 2003»
9 years 12 days ago
Further Observations on the Structure of the AES Algorithm
We present our further observations on the structure of the AES algorithm relating to the cyclic properties of the functions used in this cipher. We note that the maximal period of...
Beomsik Song, Jennifer Seberry
FSE
2003
Springer
134views Cryptology» more  FSE 2003»
9 years 12 days ago
A New Class of Collision Attacks and Its Application to DES
Until now in cryptography the term collision was mainly associated with the surjective mapping of different inputs to an equal output of a hash function. Previous collision attack...
Kai Schramm, Thomas J. Wollinger, Christof Paar
FSE
2003
Springer
137views Cryptology» more  FSE 2003»
9 years 12 days ago
Turing: A Fast Stream Cipher
Abstract. This paper proposes the Turing stream cipher. Turing offers up to 256-bit key strength, and is designed for extremely efficient software implementation.It combines an LFS...
Gregory G. Rose, Philip Hawkes
FSE
2003
Springer
207views Cryptology» more  FSE 2003»
9 years 12 days ago
Analysis of RMAC
In this paper the newly proposed RMAC system is analysed and a generic attack is presented. The attack can be used to find one of the two keys in the system faster than by an exh...
Lars R. Knudsen, Tadayoshi Kohno
FSE
2003
Springer
243views Cryptology» more  FSE 2003»
9 years 12 days ago
Optimal Key Ranking Procedures in a Statistical Cryptanalysis
Hypothesis tests have been used in the past as a tool in a cryptanalytic context. In this paper, we propose to use this paradigm and define a precise and sound statistical framewo...
Pascal Junod, Serge Vaudenay
FSE
2003
Springer
135views Cryptology» more  FSE 2003»
9 years 12 days ago
New Attacks against Standardized MACs
In this paper, we revisit the security of several message authentication code (MAC) algorithms based on block ciphers, when instantiated with 64-bit block ciphers such as DES. We e...
Antoine Joux, Guillaume Poupard, Jacques Stern
books