Sciweavers

21 search results - page 3 / 5
» Adaptive Trapdoor Functions and Chosen-Ciphertext Security
Sort
View
EUROCRYPT
2003
Springer
13 years 11 months ago
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions
Abstract. In this paper we present a simpler construction of a publickey encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapd...
Yehuda Lindell
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 2 months ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis
ASIACRYPT
2000
Springer
13 years 10 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
13 years 10 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
ACNS
2004
Springer
106views Cryptology» more  ACNS 2004»
13 years 11 months ago
On the Security of Cryptosystems with All-or-Nothing Transform
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai