Sciweavers

120 search results - page 4 / 24
» Construction of a Non-malleable Encryption Scheme from Any S...
Sort
View
ICDCS
2010
IEEE
13 years 3 months ago
Secure Ranked Keyword Search over Encrypted Cloud Data
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypte...
Cong Wang, Ning Cao, Jin Li, Kui Ren, Wenjing Lou
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 7 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
ACNS
2008
Springer
252views Cryptology» more  ACNS 2008»
14 years 12 days ago
Generic Constructions of Stateful Public Key Encryption and Their Applications
We present generic constructions of stateful public key encryption (StPE). We build several new StPE schemes and explain existing ones using our generic constructions. Of the new ...
Joonsang Baek, Jianying Zhou, Feng Bao
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
12 years 5 months 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
EUROCRYPT
2010
Springer
13 years 11 months ago
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
Rafael Pass, Hoeteck Wee