Sciweavers

4 search results - page 1 / 1
» Public-Key Cryptosystems Based on Composite Degree Residuosi...
Sort
View
160
Voted
EUROCRYPT
1999
Springer
15 years 5 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
15 years 7 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
114
Voted
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
14 years 24 days ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev
98
Voted
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 4 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski