89 search results - page 7 / 18 » Minimizing the use of random oracles in authenticated encryp... |
PROVSEC
2009
Springer
14 years 1 months ago
2009
Springer
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
ACNS
2005
Springer
14 years 8 days ago
2005
Springer
This paper presents a first example of secure identity based encryption scheme (IBE) without redundancy in the sense of Phan and Pointcheval. This modification of the Boneh-Frank...
ASIACRYPT
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
IJNSEC
2006
13 years 6 months ago
2006
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
AINA
2006
IEEE
13 years 10 months ago
2006
IEEE
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...