Sciweavers

11 search results - page 1 / 3
» How to Construct Multicast Cryptosystems Provably Secure Aga...
Sort
View
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
13 years 8 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
CRYPTO
1998
Springer
119views Cryptology» more  CRYPTO 1998»
13 years 8 months ago
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractabili...
Ronald Cramer, Victor Shoup
TCC
2004
Springer
131views Cryptology» more  TCC 2004»
13 years 9 months ago
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
Recently Canetti, Krawczyk and Nielsen defined the notion of replayable adaptive chosen ciphertext attack (RCCA) secure encryption. Essentially a cryptosystem that is RCCA secure ...
Jens Groth
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
13 years 8 months ago
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
Anand Desai
PROVSEC
2009
Springer
13 years 11 months ago
Chosen-Ciphertext Secure RSA-Type Cryptosystems
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...
Benoît Chevallier-Mames, Marc Joye