Sciweavers

352 search results - page 13 / 71
» Cryptography in the Multi-string Model
Sort
View
TYPES
2004
Springer
14 years 3 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
IPL
2007
105views more  IPL 2007»
13 years 9 months ago
Improving the arithmetic of elliptic curves in the Jacobi model
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
Sylvain Duquesne
IPL
2006
118views more  IPL 2006»
13 years 9 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
ESORICS
2005
Springer
14 years 3 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
CHES
2004
Springer
230views Cryptology» more  CHES 2004»
14 years 3 months ago
Correlation Power Analysis with a Leakage Model
Abstract. A classical model is used for the power consumption of cryptographic devices. It is based on the Hamming distance of the data handled with regard to an unknown but consta...
Eric Brier, Christophe Clavier, Francis Olivier