Sciweavers

175 search results - page 13 / 35
» Chosen-Ciphertext Security of Multiple Encryption
Sort
View
115
Voted
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 5 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
132
Voted
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 1 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
15 years 5 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...
103
Voted
CRYPTO
2010
Springer
186views Cryptology» more  CRYPTO 2010»
15 years 1 months ago
Additively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
Carlos Aguilar Melchor, Philippe Gaborit, Javier H...
114
Voted
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...