66 search results - page 5 / 14 » crypto 2009 |
IFIP
2009
Springer
14 years 7 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
AFRICACRYPT
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. This article investigates the relevance of the theoretical framework on profiled side-channel attacks presented by F.-X. Standaert et al. at Eurocrypt 2009. The analyses ...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
83
Voted
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
CRYPTO
2009
Springer
15 years 1 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...