52 search results - page 5 / 11 » How Risky Is the Random-Oracle Model |
125
click to vote
ASIACRYPT
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
117
click to vote
PKC
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
164
Voted
CTRSA
2012
Springer
13 years 10 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
123
Voted
ACISP
2008
Springer
15 years 4 months ago
2008
Springer
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
107
click to vote
PROVSEC
2009
Springer
15 years 9 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...