SCN
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying publ...
IEICET
2006
13 years 10 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
CRYPTO
2008
Springer
14 years 15 days ago
2008
Springer
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
PKC
1999
Springer
14 years 3 months ago
1999
Springer
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
EUROCRYPT
2010
Springer
14 years 3 months ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
EUROCRYPT
2010
Springer
14 years 3 months ago
2010
Springer
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). S...
EUROCRYPT
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
ESORICS
2004
Springer
14 years 4 months ago
2004
Springer
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts ...
TCC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
TCC
2010
Springer
14 years 7 months ago
2010
Springer
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...