52 search results - page 1 / 11 » On the Analysis of Cryptographic Assumptions in the Generic ... |
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
TYPES
2004
Springer
13 years 10 months ago
2004
Springer
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...
ESORICS
2005
Springer
13 years 10 months ago
2005
Springer
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....
CN
2006
2006
A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms
13 years 4 months ago
This paper presents an assessment of the communication overheads of IPsec and evaluates the feasibility of deploying it on handheld devices for the UMTS architecture. A wide range...
EUROCRYPT
2004
Springer
13 years 8 months ago
2004
Springer
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...