Sciweavers

14 search results - page 3 / 3
» Rerandomizable and Replayable Adaptive Chosen Ciphertext Att...
Sort
View
CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
14 years 3 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
INFOCOM
2007
IEEE
14 years 2 months ago
Scalable Secure Bidirectional Group Communication
— Many network applications are based on a group communications model where one party sends messages to a large number of authorized recipients and/or receives messages from mult...
Yitao Duan, John F. Canny
ASIACRYPT
2005
Springer
14 years 2 months ago
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
In this paper, we discuss non-interactive updating of decryption keys in identity-based encryption (IBE). IBE is a public key cryptosystem where a public key is an arbitrary strin...
Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, H...
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 1 months 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...