Sciweavers

71 search results - page 11 / 15
» Securing Threshold Cryptosystems against Chosen Ciphertext A...
Sort
View
CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
14 years 2 months ago
On the Impossibility of Strong Encryption Over
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
Raphael C.-W. Phan, Serge Vaudenay
JOC
2008
97views more  JOC 2008»
13 years 7 months ago
Tag-KEM/DEM: A New Framework for Hybrid Encryption
This paper presents a novel framework for the generic construction of hybrid encryption schemes which produces more efficient schemes than the ones known before. A previous framew...
Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa
EUROCRYPT
2004
Springer
14 years 1 months ago
Immunizing Encryption Schemes from Decryption Errors
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...
Cynthia Dwork, Moni Naor, Omer Reingold
AAECC
2006
Springer
135views Algorithms» more  AAECC 2006»
14 years 1 months ago
Applying Fujisaki-Okamoto to Identity-Based Encryption
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...
Peng Yang 0002, Takashi Kitagawa, Goichiro Hanaoka...
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 8 days ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...