Privacy-preserving distributed set intersection

Qingsong Ye; Huaxiong Wang; Christophe Tartary

doi:10.1109/ARES.2008.134

Privacy-preserving distributed set intersection

Qingsong Ye^*, Huaxiong Wang, Christophe Tartary

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

6 Citations (Scopus)

Abstract

With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-preserving set intersection based on a combination of secret sharing scheme and homomorphic encryption. We then show that, with an extra permutation performed by each contacted server, the cardinality of set intersection can be computed efficiently. All protocols constructed in this paper are provably secure against an honest-but-curious adversary under the Decisional Diffie-Hellman assumption.

Original language	English
Title of host publication	3rd International Conference on Availability, Security, and Reliability, ARES 2008
Subtitle of host publication	Proceedings
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1332-1339
Number of pages	8
ISBN (Print)	9780769531021
DOIs	https://doi.org/10.1109/ARES.2008.134
Publication status	Published - 2008
Event	3rd International Conference on Availability, Security, and Reliability, ARES 2008 - Barcelona, Spain Duration: 4 Mar 2008 → 7 Mar 2008

Other

Other	3rd International Conference on Availability, Security, and Reliability, ARES 2008
Country/Territory	Spain
City	Barcelona
Period	4/03/08 → 7/03/08

Access to Document

10.1109/ARES.2008.134

Cite this

@inproceedings{746e1ccbd84c43878c3b83f2a8d85ffe,

title = "Privacy-preserving distributed set intersection",

abstract = "With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-preserving set intersection based on a combination of secret sharing scheme and homomorphic encryption. We then show that, with an extra permutation performed by each contacted server, the cardinality of set intersection can be computed efficiently. All protocols constructed in this paper are provably secure against an honest-but-curious adversary under the Decisional Diffie-Hellman assumption.",

author = "Qingsong Ye and Huaxiong Wang and Christophe Tartary",

year = "2008",

doi = "10.1109/ARES.2008.134",

language = "English",

isbn = "9780769531021",

pages = "1332--1339",

booktitle = "3rd International Conference on Availability, Security, and Reliability, ARES 2008",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "3rd International Conference on Availability, Security, and Reliability, ARES 2008 ; Conference date: 04-03-2008 Through 07-03-2008",

}

Ye, Q, Wang, H & Tartary, C 2008, Privacy-preserving distributed set intersection. in 3rd International Conference on Availability, Security, and Reliability, ARES 2008: Proceedings., 4529499, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1332-1339, 3rd International Conference on Availability, Security, and Reliability, ARES 2008, Barcelona, Spain, 4/03/08. https://doi.org/10.1109/ARES.2008.134

Privacy-preserving distributed set intersection. / Ye, Qingsong; Wang, Huaxiong; Tartary, Christophe.
3rd International Conference on Availability, Security, and Reliability, ARES 2008: Proceedings. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2008. p. 1332-1339 4529499.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Privacy-preserving distributed set intersection

AU - Ye, Qingsong

AU - Wang, Huaxiong

AU - Tartary, Christophe

PY - 2008

Y1 - 2008

N2 - With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-preserving set intersection based on a combination of secret sharing scheme and homomorphic encryption. We then show that, with an extra permutation performed by each contacted server, the cardinality of set intersection can be computed efficiently. All protocols constructed in this paper are provably secure against an honest-but-curious adversary under the Decisional Diffie-Hellman assumption.

AB - With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-preserving set intersection based on a combination of secret sharing scheme and homomorphic encryption. We then show that, with an extra permutation performed by each contacted server, the cardinality of set intersection can be computed efficiently. All protocols constructed in this paper are provably secure against an honest-but-curious adversary under the Decisional Diffie-Hellman assumption.

UR - http://www.scopus.com/inward/record.url?scp=49049102977&partnerID=8YFLogxK

U2 - 10.1109/ARES.2008.134

DO - 10.1109/ARES.2008.134

M3 - Conference proceeding contribution

AN - SCOPUS:49049102977

SN - 9780769531021

SP - 1332

EP - 1339

BT - 3rd International Conference on Availability, Security, and Reliability, ARES 2008

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 3rd International Conference on Availability, Security, and Reliability, ARES 2008

Y2 - 4 March 2008 through 7 March 2008

ER -

Privacy-preserving distributed set intersection

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this