2026-06-10T08:31:57Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/3284 2021-12-13T00:47:24Z 1582963302567:1597824273898 user-ucsy

Data Management over Garbled Bloom Filter for Private Set Intersection Baral, Amit Raj Koshiba, Takeshi Increasing dependency of data availability and thefear of losing the private information during com-munication motivate the need of privacy protection.One of the common problems occurs when two par-ties need to privately compute the intersection oftheir respective sets of data. One or both partiesmust obtain the intersection (if one exists), whileneither should learn anything about the other partyset. Till date, one of the e cient approach has beenpresented with consideration of Big Data by Dong,Chen and Wen (CCS 2013). They have introduceda new data structure named as Garbled Bloom Filter(GBF), an improved Bloom lter, for the computa-tion of the Private Set Intersection (PSI). Whilethe PSI protocol (DCW13 protocol) by Dong, Chenand Wen is pretty e cient, it does not support formanaging dynamic data. In this paper, we presentdata management techniques on the server side ofthe DCW13 protocol, which compliment the DCW13protocol. 2015-02-05 http://hdl.handle.net/20.500.12678/0000003284 https://meral.edu.mm/records/3284