Sciweavers

120 search results - page 3 / 24
» Construction of a Non-malleable Encryption Scheme from Any S...
Sort
View
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
14 years 5 months ago
On the (Im)Possibility of Key Dependent Encryption
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
Iftach Haitner, Thomas Holenstein
PROVSEC
2010
Springer
13 years 3 months ago
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
Laila El Aimani
EUROCRYPT
2009
Springer
14 years 5 months ago
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of "circular encryption," by presenting a public key encrypti...
Jan Camenisch, Nishanth Chandran, Victor Shoup
IACR
2011
125views more  IACR 2011»
12 years 5 months ago
On Constructing Homomorphic Encryption Schemes from Coding Theory
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
Frederik Armknecht, Daniel Augot, Ludovic Perret, ...
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
Public-Key Locally-Decodable Codes
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 ...
Brett Hemenway, Rafail Ostrovsky