Presentation 2013-03-07
Implementation and Evaluation of Fast Secure Set Intersection for Protection and Utilization of Personal Data
Jun ISHII, Hiroyuki MAEOMICHI, Ikuo YODA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we focus on intersection, which is one of the most important operations in recommendation or collaborative filtering with personal data. Secure set intersection protocol is safer than intersection operation protocol by hashing, which is used in present applications or services. Then we try to improve duration time of operation. We extend a previous work which use Bloom filter and we suggest fast secure set intersection algorithm by optimization of combination matching using a similarity of Bloom filter. Finally, we execute experiment with reading logs and we confirm our algorithm can reduce duration time of operation.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Personal data / Secure set intersection / Bloom filter / Group optimization
Paper # IN2012-174
Date of Issue

Conference Information
Committee IN
Conference Date 2013/2/28(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Implementation and Evaluation of Fast Secure Set Intersection for Protection and Utilization of Personal Data
Sub Title (in English)
Keyword(1) Personal data
Keyword(2) Secure set intersection
Keyword(3) Bloom filter
Keyword(4) Group optimization
1st Author's Name Jun ISHII
1st Author's Affiliation NTT Network Innovation Laboratories()
2nd Author's Name Hiroyuki MAEOMICHI
2nd Author's Affiliation NTT Network Innovation Laboratories
3rd Author's Name Ikuo YODA
3rd Author's Affiliation NTT Network Innovation Laboratories
Date 2013-03-07
Paper # IN2012-174
Volume (vol) vol.112
Number (no) 464
Page pp.pp.-
#Pages 5
Date of Issue