Presentation 2012-11-07
Privacy Breach and Differential Privacy of Similarity Search
Hiromi ARAI, Jun SAKUMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We examine the database privacy of similarity based ranking for a database of private records where each record and queries for similarity search are both represented by a fixed size bit vector. In our setting, the database answer record indexes are arranged in descending order according to similarity to the query. This setting can be widely applied, including for retrieval from private records, because ranking is often used for information retrieval and many types of data can be expressed as bit vectors. In this paper, we examine privacy breaches caused by ranked indexes and differentially private ranked indexes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) privacy preservation / similarity search / ranking
Paper # IBISML2012-60
Date of Issue

Conference Information
Committee IBISML
Conference Date 2012/10/31(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-Based Induction Sciences and Machine Learning (IBISML)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Privacy Breach and Differential Privacy of Similarity Search
Sub Title (in English)
Keyword(1) privacy preservation
Keyword(2) similarity search
Keyword(3) ranking
1st Author's Name Hiromi ARAI
1st Author's Affiliation RIKEN Yokohama Institute()
2nd Author's Name Jun SAKUMA
2nd Author's Affiliation Department of Computer Science, University of Tsukuba:Japan Science and Technology Agency
Date 2012-11-07
Paper # IBISML2012-60
Volume (vol) vol.112
Number (no) 279
Page pp.pp.-
#Pages 8
Date of Issue