CTRSA
2012
Springer
12 years 4 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
CTRSA
2012
Springer
12 years 4 months ago
2012
Springer
We analyse and exploit implementation features in OpenSSL version 0.9.8g which permit an attack against ECDH-based functionality. The attack, although more general, can recover the...
CTRSA
2012
Springer
12 years 4 months ago
2012
Springer
We provide an analysis of current and future algorithms for signature and encryption in the EMV standards in the case where a single key-pair is used for both signature and encrypt...
FDTC
2011
Springer
12 years 8 months ago
2011
Springer
Abstract—The literature about fault analysis typically describes fault injection mechanisms, e.g. glitches and lasers, and cryptanalytic techniques to exploit faults based on som...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
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...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate ...