Sciweavers

213 search results - page 8 / 43
» Can Homomorphic Encryption be Practical
Sort
View
TCC
2005
Springer
132views Cryptology» more  TCC 2005»
14 years 25 days ago
Evaluating 2-DNF Formulas on Ciphertexts
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
Dan Boneh, Eu-Jin Goh, Kobbi Nissim
CISC
2006
Springer
104views Cryptology» more  CISC 2006»
13 years 11 months ago
Batch Decryption of Encrypted Short Messages and Its Application on Concurrent SSL Handshakes
Abstract. A public-key cryptosystem is usually used for key management, in particular to session key management. The paper presents a method for handling a batch of concurrent keys...
Yongdong Wu, Feng Bao
FC
2009
Springer
118views Cryptology» more  FC 2009»
14 years 1 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 9 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
CACM
2010
117views more  CACM 2010»
13 years 7 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry