Sciweavers

50 search results - page 9 / 10
» Manger's Attack Revisited
Sort
View
PROVSEC
2010
Springer
13 years 8 months ago
Distinguishing Distributions Using Chernoff Information
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
Thomas Baignères, Pouyan Sepehrdad, Serge V...
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
14 years 5 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
SCN
2010
Springer
143views Communications» more  SCN 2010»
13 years 9 months ago
History-Free Aggregate Message Authentication Codes
Aggregate message authentication codes, as introduced by Katz and Lindell (CT-RSA 2008), combine several MACs into a single value, which has roughly the same size as an ordinary MA...
Oliver Eikemeier, Marc Fischlin, Jens-Fabian G&oum...
CCS
2007
ACM
14 years 5 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
IEEEIAS
2009
IEEE
13 years 8 months ago
On Security Notions for Verifiably Encrypted Signature
First we revisit three - BGLS, MBGLS and GZZ verifiably encrypted signature schemes [2, 3, 6]. We find that they are all not strong unforgeable.We remark that the notion of existen...
Xu An Wang, Xiaoyuan Yang, Qingquan Peng