278 search results - page 33 / 56 » On the Security of RSA Padding |
CSFW
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
NDSS
1997
IEEE
14 years 26 days ago
1997
IEEE
This paper presents a model of hierarchical organization of Certification Authorities which can be applied to any open system network. In order to study the feasibility of the pro...
CSREASAM
2006
13 years 10 months ago
2006
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
EUROCRYPT
2010
Springer
14 years 1 months ago
2010
Springer
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...