145
click to vote
IACR
2011
14 years 4 months ago
2011
: The paper presents several improved side channel cube attacks on PRESENT based on single bit leakage model. Compared with the previous study of Yang et al in CANS 2009 [30], base...
171
click to vote
IACR
2011
14 years 4 months ago
2011
—Cloud computing is a style of computing in which dynamically scalable and commonly virtualized resources are provided as a service over the Internet. This paper, first presents ...
165
click to vote
IACR
2011
14 years 4 months ago
2011
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...
154
click to vote
IACR
2011
14 years 4 months ago
2011
Abstract. We describe and analyze the password-based key establishment protocol PACE v2 Integrated Mapping (IM), an evolution of PACE v1 jointly proposed by Gemalto and Sagem S´ec...
143
click to vote
IACR
2011
14 years 4 months ago
2011
Software drive encryption systems are vulnerable to memory attacks, in which an attacker gains physical accesses to the unattended computer, obtains the decryption keys from memor...
IACR
2011
14 years 4 months ago
2011
156
click to vote
IACR
2011
14 years 4 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
153
click to vote
IACR
2011
14 years 4 months ago
2011
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
162
click to vote
IACR
2011
14 years 4 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
139
click to vote
IACR
2011
14 years 4 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...