Two-Client and Multi-client Functional Encryption for Set Intersection

Tim Robert van de Kamp; David Stritzl; Willem  Jonker; Andreas  Peter

doi:10.1007/978-3-030-21548-4_6

Two-Client and Multi-client Functional Encryption for Set Intersection

Tim Robert van de Kamp^*, David Stritzl, Willem Jonker, Andreas Peter

^*Corresponding author for this work

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

2 Citations (Scopus)

1 Downloads (Pure)

Abstract

We propose several functional encryption schemes for set intersection and variants on two or multiple sets. In these schemes, a party may learn the set intersection from the sets of two or more clients, without having to learn the plaintext set of each individual client. For the case of two clients, we construct efficient schemes for determining the set intersection and the cardinality of the intersection. To evaluate the cardinality of the intersection, no overhead is incurred when compared to operating on plaintext data. We also present other functionalities with a scheme for set intersection with data transfer and a threshold scheme that only discloses the intersection if both clients have at least t elements in common. Finally, we consider set intersection and set intersection cardinality schemes for the case of three or more clients from a theoretical perspective. Our proof-of-concept implementations show that the two-client constructions are efficient and scale linearly in the set sizes.

Original language	English
Title of host publication	Information security and privacy
Subtitle of host publication	24th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3–5, 2019, Proceedings
Editors	Julian Jang-Jaccard, Fuchun Guo
Place of Publication	Charm
Publisher	Springer
Pages	97-115
Number of pages	19
ISBN (Electronic)	978-3-030-21548-4
ISBN (Print)	978-3-030-21547-7
DOIs	https://doi.org/10.1007/978-3-030-21548-4_6
Publication status	Published - 30 May 2019
Event	24th Australasian Conference on Information Security and Privacy 2019 - University of Canterbury, Christchurch, New Zealand Duration: 3 Jul 2019 → 5 Jul 2019 Conference number: 24 https://acisp19.canterbury.ac.nz/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer International Publishing
Volume	11547

Conference

Conference	24th Australasian Conference on Information Security and Privacy 2019
Abbreviated title	ACISP 2019
Country/Territory	New Zealand
City	Christchurch
Period	3/07/19 → 5/07/19
Internet address	https://acisp19.canterbury.ac.nz/

Keywords

Multi-client functional encryption
Non-interactive
Set intersection

Access to Document

10.1007/978-3-030-21548-4_6

Cite this

van de Kamp, T. R., Stritzl, D., Jonker, W., & Peter, A. (2019). Two-Client and Multi-client Functional Encryption for Set Intersection. In J. Jang-Jaccard, & F. Guo (Eds.), Information security and privacy: 24th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3–5, 2019, Proceedings (pp. 97-115). (Lecture Notes in Computer Science; Vol. 11547). Springer. https://doi.org/10.1007/978-3-030-21548-4_6

van de Kamp, Tim Robert ; Stritzl, David ; Jonker, Willem ; Peter, Andreas . / Two-Client and Multi-client Functional Encryption for Set Intersection. Information security and privacy: 24th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3–5, 2019, Proceedings. editor / Julian Jang-Jaccard ; Fuchun Guo. Charm : Springer, 2019. pp. 97-115 (Lecture Notes in Computer Science).

@inproceedings{ee36ea8731b742399225f5632bbdcadf,

title = "Two-Client and Multi-client Functional Encryption for Set Intersection",

abstract = "We propose several functional encryption schemes for set intersection and variants on two or multiple sets. In these schemes, a party may learn the set intersection from the sets of two or more clients, without having to learn the plaintext set of each individual client. For the case of two clients, we construct efficient schemes for determining the set intersection and the cardinality of the intersection. To evaluate the cardinality of the intersection, no overhead is incurred when compared to operating on plaintext data. We also present other functionalities with a scheme for set intersection with data transfer and a threshold scheme that only discloses the intersection if both clients have at least t elements in common. Finally, we consider set intersection and set intersection cardinality schemes for the case of three or more clients from a theoretical perspective. Our proof-of-concept implementations show that the two-client constructions are efficient and scale linearly in the set sizes.",

keywords = "Multi-client functional encryption, Non-interactive, Set intersection",

author = "{van de Kamp}, {Tim Robert} and David Stritzl and Willem Jonker and Andreas Peter",

note = "Funding Information: Acknowledgments. This work was supported by the Netherlands Organisation for Scientific Research (Nederlandse Organisatie voor Wetenschappelijk Onderzoek, NWO) in the context of the CRIPTIM project. Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 24th Australasian Conference on Information Security and Privacy 2019, ACISP 2019 ; Conference date: 03-07-2019 Through 05-07-2019",

year = "2019",

month = may,

day = "30",

doi = "10.1007/978-3-030-21548-4_6",

language = "English",

isbn = "978-3-030-21547-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "97--115",

editor = "Julian Jang-Jaccard and Fuchun Guo",

booktitle = "Information security and privacy",

address = "Netherlands",

url = "https://acisp19.canterbury.ac.nz/",

}

van de Kamp, TR, Stritzl, D, Jonker, W & Peter, A 2019, Two-Client and Multi-client Functional Encryption for Set Intersection. in J Jang-Jaccard & F Guo (eds), Information security and privacy: 24th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3–5, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11547, Springer, Charm, pp. 97-115, 24th Australasian Conference on Information Security and Privacy 2019, Christchurch, New Zealand, 3/07/19. https://doi.org/10.1007/978-3-030-21548-4_6

Two-Client and Multi-client Functional Encryption for Set Intersection. / van de Kamp, Tim Robert; Stritzl, David; Jonker, Willem ; Peter, Andreas .

Information security and privacy: 24th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3–5, 2019, Proceedings. ed. / Julian Jang-Jaccard; Fuchun Guo. Charm : Springer, 2019. p. 97-115 (Lecture Notes in Computer Science; Vol. 11547).

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

TY - GEN

T1 - Two-Client and Multi-client Functional Encryption for Set Intersection

AU - van de Kamp, Tim Robert

AU - Stritzl, David

AU - Jonker, Willem

AU - Peter, Andreas

N1 - Conference code: 24

PY - 2019/5/30

Y1 - 2019/5/30

N2 - We propose several functional encryption schemes for set intersection and variants on two or multiple sets. In these schemes, a party may learn the set intersection from the sets of two or more clients, without having to learn the plaintext set of each individual client. For the case of two clients, we construct efficient schemes for determining the set intersection and the cardinality of the intersection. To evaluate the cardinality of the intersection, no overhead is incurred when compared to operating on plaintext data. We also present other functionalities with a scheme for set intersection with data transfer and a threshold scheme that only discloses the intersection if both clients have at least t elements in common. Finally, we consider set intersection and set intersection cardinality schemes for the case of three or more clients from a theoretical perspective. Our proof-of-concept implementations show that the two-client constructions are efficient and scale linearly in the set sizes.

AB - We propose several functional encryption schemes for set intersection and variants on two or multiple sets. In these schemes, a party may learn the set intersection from the sets of two or more clients, without having to learn the plaintext set of each individual client. For the case of two clients, we construct efficient schemes for determining the set intersection and the cardinality of the intersection. To evaluate the cardinality of the intersection, no overhead is incurred when compared to operating on plaintext data. We also present other functionalities with a scheme for set intersection with data transfer and a threshold scheme that only discloses the intersection if both clients have at least t elements in common. Finally, we consider set intersection and set intersection cardinality schemes for the case of three or more clients from a theoretical perspective. Our proof-of-concept implementations show that the two-client constructions are efficient and scale linearly in the set sizes.

KW - Multi-client functional encryption

KW - Non-interactive

KW - Set intersection

U2 - 10.1007/978-3-030-21548-4_6

DO - 10.1007/978-3-030-21548-4_6

M3 - Conference contribution

SN - 978-3-030-21547-7

T3 - Lecture Notes in Computer Science

SP - 97

EP - 115

BT - Information security and privacy

A2 - Jang-Jaccard, Julian

A2 - Guo, Fuchun

PB - Springer

CY - Charm

T2 - 24th Australasian Conference on Information Security and Privacy 2019

Y2 - 3 July 2019 through 5 July 2019

ER -

van de Kamp TR, Stritzl D, Jonker W , Peter A. Two-Client and Multi-client Functional Encryption for Set Intersection. In Jang-Jaccard J, Guo F, editors, Information security and privacy: 24th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3–5, 2019, Proceedings. Charm: Springer. 2019. p. 97-115. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-21548-4_6

Two-Client and Multi-client Functional Encryption for Set Intersection

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this