73 search results - page 5 / 15 » Security of erasable memories against adaptive adversaries |
152
click to vote
TCC
2007
Springer
16 years 5 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
174
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
154
click to vote
ACNS
2010
Springer
15 years 11 months ago
2010
Springer
Most side-channel attacks that have been published in the open literature assume known- or chosen-message adversarial scenarios. In this paper, we analyze the increase of the attac...
166
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
142
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Threshold cryptosystems and signature schemes give ways to distribute trust throughout a group and increase the availability of cryptographic systems. A standard approach in design...