118 search results - page 4 / 24 » Chosen Ciphertext Security with Optimal Ciphertext Overhead |
PROVSEC
2009
Springer
15 years 4 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...
123
click to vote
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
81
Voted
CTRSA
2006
Springer
15 years 1 months ago
2006
Springer
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 ...
TIT
2011
14 years 4 months ago
2011
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
128
Voted
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...