On Privacy Homomorphisms (Extended Abstract)

Brickell, Ernest F.; Yacobi, Yacov

doi:10.1007/3-540-39118-5_12

Cited by 38 publications

(37 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this encryption suffers from known-plaintext attacks [4], which means p and q could be found if a pair of cleartext and ciphertext is known to an adversary.…”

Section: A Adversary Modelmentioning

confidence: 99%

Processing private queries over untrusted data cloud through privacy homomorphism

Ren

et al. 2011

2011 IEEE 27th International Conference on Data Engineering

175

119

View full text Add to dashboard Cite

Abstract-Query processing that preserves both the data privacy of the owner and the query privacy of the client is a new research problem. It shows increasing importance as cloud computing drives more businesses to outsource their data and querying services. However, most existing studies, including those on data outsourcing, address the data privacy and query privacy separately and cannot be applied to this problem. In this paper, we propose a holistic and efficient solution that comprises a secure traversal framework and an encryption scheme based on privacy homomorphism. The framework is scalable to large datasets by leveraging an index-based approach. Based on this framework, we devise secure protocols for processing typical queries such as k-nearest-neighbor queries (kNN) on R-tree index. Moreover, several optimization techniques are presented to improve the efficiency of the query processing protocols. Our solution is verified by both theoretical analysis and performance study.

show abstract

“…However, this encryption suffers from known-plaintext attacks [4], which means p and q could be found if a pair of cleartext and ciphertext is known to an adversary.…”

Section: A Adversary Modelmentioning

confidence: 99%

Processing private queries over untrusted data cloud through privacy homomorphism

Ren

et al. 2011

2011 IEEE 27th International Conference on Data Engineering

175

119

View full text Add to dashboard Cite

show abstract

“…A privacy homomorphism [6] is an encryption function which allows the encrypted data to be operated on without the knowledge of the decryption function.…”

Section: B Homomorphic Encryptionmentioning

confidence: 99%

Secure and Efficient Data Storage in Unattended Wireless Sensor Networks

Ren

Oleshchuk

2009

2009 3rd International Conference on New Technologies, Mobility and Security

View full text Add to dashboard Cite

Abstract-Providing forward and backward secrecy is still a big challenge in Unattended Wireless Sensor Networks (UWSNs), though some storage schemes have been proposed. Additionally, high storage requirement needs efficient storage techniques. In this paper, we propose a novel homomorphic encryption and key-evolution based scheme for efficient and secure data storage, which supports both forward and backward secrecy in UWSNs. We show that the stored data based on our scheme can be used to efficiently compute statistic values, e.g., expected value and variance of the sensed data, and at the same time the storage cost is significantly reduced using our scheme. Detailed analysis has been conducted to evaluate the scheme in terms of efficiency and security.

show abstract

“…It was firstly considered by Rivest et al who suggested some homomorphic encryption schemes [1]. However, these schemes are insecure [4]. Later, the fully homomorphic encryption (FHE) schemes [5,6,7] are proposed.…”

Section: Introductionmentioning

confidence: 99%

Quantum fully homomorphic encryption scheme based on universal quantum circuit

Liang¹

2015

Quantum Inf Process

View full text Add to dashboard Cite

Abstract. Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on an encrypted data. The QFHE scheme is proved to be perfectly secure. In the scheme, the decryption key is different from the encryption key, however, the encryption key cannot be public. Moreover, the evaluate algorithm of the scheme is independent of the encryption key, so it is very applicable in delegated quantum computing between two parties.

show abstract

On Privacy Homomorphisms (Extended Abstract)

Cited by 38 publications

References 8 publications

Processing private queries over untrusted data cloud through privacy homomorphism

Processing private queries over untrusted data cloud through privacy homomorphism

Secure and Efficient Data Storage in Unattended Wireless Sensor Networks

Quantum fully homomorphic encryption scheme based on universal quantum circuit

Contact Info

Product

Resources

About