Sciweavers

598 search results - page 37 / 120
» On the Security of ElGamal Based Encryption
Sort
View
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
14 years 4 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
JOC
2010
124views more  JOC 2010»
13 years 6 months ago
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
We present a new encryption scheme which is secure against adaptive chosenciphertext attack (or CCA2-secure) in the standard model (i.e. without the use of random oracle). Our sch...
Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Vict...
IJNSEC
2010
128views more  IJNSEC 2010»
13 years 2 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
EUROCRYPT
2001
Springer
14 years 6 days ago
The Bit Security of Paillier's Encryption Scheme and Its Applications
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
Dario Catalano, Rosario Gennaro, Nick Howgrave-Gra...