164
Voted
CRYPTO
15 years 6 months ago
2001 Springer 
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
124
click to vote
CRYPTO
15 years 6 months ago
2001 Springer 
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. I...
106
Voted
CRYPTO
15 years 6 months ago
2001 Springer
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
122
Voted
CRYPTO
15 years 6 months ago
2001 Springer 
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
124
Voted
CRYPTO
15 years 6 months ago
2001 Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
|
Cryptology