Sciweavers

73 search results - page 3 / 15
» Practical Chosen Ciphertext Secure Encryption from Factoring
Sort
View
TIT
2011
125views more  TIT 2011»
14 years 4 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
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...
Benoît Libert, Damien Vergnaud
80
Voted
CCS
2005
ACM
15 years 3 months ago
Direct chosen ciphertext security from identity-based techniques
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
Xavier Boyen, Qixiang Mei, Brent Waters
CANS
2008
Springer
86views Cryptology» more  CANS 2008»
14 years 11 months ago
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into an encryption of the sa...
Robert H. Deng, Jian Weng, Shengli Liu, Kefei Chen
PKC
2010
Springer
217views Cryptology» more  PKC 2010»
15 years 1 months ago
Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
Lossy Trapdoor Functions (LTDFs), introduced by Peikert and Waters (STOC 2008) have been useful for building many cryptographic primitives. In particular, by using an LTDF that los...
Petros Mol, Scott Yilek
EUROCRYPT
2010
Springer
15 years 2 months ago
Adaptive Trapdoor Functions and Chosen-Ciphertext Security
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...
Eike Kiltz, Payman Mohassel, Adam O'Neill