ReSet: a protocol for private matching
Article No.: 6, Pages 1 - 6
Abstract
Private matching (PM) has a vast domain of applications to get its benefit including social media, e-health and commerce. The core concept of PM comprises on revealing only common values between two parties and ensuring the privacy of the remaining ones. In this paper we have proposed a protocol ReSet, for PM that works with random values rather than original datasets. Utilizing random values further ensures the privacy by introducing an additional layer in between original values and encryption or hashing technique. ReSet takes only two communications between the communicating parties and can work with or without involving services of any third party. The unique feature of randomness minimizes the additional disclosure of information that is exposure of similarity magnitude for values being matched. Our experimental evaluation reveals that if protocol is executed more than once for similar set of values, the output results will resist against pattern identification if intercepted by a malicious user.
References
[1]
R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 86--97. ACM, 2003.
[2]
M. Ahmad, Z. Pervez, Y. Yoon, B. H. Kang, and S. Lee. Reflection: A lightweight protocol for private matching. In Signal-Image Technology & Internet-Based Systems (SITIS), 2013 International Conference on, pages 673--678. IEEE, 2013.
[3]
Q. Dai and R. J. Kauffman. Business models for internet-based e-procurement systems and b2b electronic markets: an exploratory assessment. In System Sciences, 2001. Proceedings of the 34th Annual Hawaii International Conference on, pages 10--pp. IEEE, 2001.
[4]
E. De Cristofaro, P. Gasti, and G. Tsudik. Fast and private computation of cardinality of set intersection and union. In Cryptology and Network Security, pages 218--231. Springer, 2012.
[5]
C. Dwork. Differential privacy. In Automata, languages and programming, pages 1--12. Springer, 2006.
[6]
C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography, pages 265--284. Springer, 2006.
[7]
M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Advances in Cryptology-EUROCRYPT 2004, pages 1--19. Springer, 2004.
[8]
K. Frikken. Privacy-preserving set union. In Applied Cryptography and Network Security, pages 237--252. Springer, 2007.
[9]
O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications, volume 2. Cambridge university press, 2009.
[10]
C. Hazay and Y. Lindell. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In Theory of Cryptography, pages 155--175. Springer, 2008.
[11]
C. Hazay and K. Nissim. Efficient set operations in the presence of malicious adversaries. Journal of cryptology, 25(3): 383--433, 2012.
[12]
J. Hong, J. W. Kim, J. Kim, K. Park, and J. H. Cheon. Constant-round privacy preserving multiset union. IACR Cryptology ePrint Archive, 2011: 138, 2011.
[13]
S. Jarecki and X. Liu. Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. In Theory of Cryptography, pages 577--594. Springer, 2009.
[14]
L. Kissner and D. Song. Privacy-preserving set operations. In Advances in Cryptology--CRYPTO 2005, pages 241--257. Springer, 2005.
[15]
M. Li, N. Cao, S. Yu, and W. Lou. Findu: Privacy-preserving personal profile matching in mobile social networks. In INFOCOM, 2011 Proceedings IEEE, pages 2435--2443. IEEE, 2011.
[16]
Y. Li, J. Tygar, and J. M. Hellerstein. Private matching. In Computer Security in the 21st Century, pages 25--50. Springer, 2005.
[17]
P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in cryptology---EUROCRYPT'99, pages 223--238. Springer, 1999.
[18]
L. Sweeney. k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(05): 557--570, 2002.
[19]
J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. Journal of Computer Security, 13(4): 593--622, 2005.
[20]
R. Zhang, Y. Zhang, J. Sun, and G. Yan. Fine-grained private matching for proximity-based mobile social networking. In INFOCOM, 2012 Proceedings IEEE, pages 1969--1977. IEEE, 2012.
Index Terms
- ReSet: a protocol for private matching
Recommendations
Preventing sensitive relationships disclosure for better social media preservation
A fundamental aspect of all social networks is information sharing. It is one of the most common forms of online interaction that is tightly associated with social media preservation and information disclosure. As such, information sharing is commonly ...
Unconditionally secure disjointness tests for private datasets
We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals ...
Efficient Disjointness Tests for Private Datasets
ACISP '08: Proceedings of the 13th Australasian conference on Information Security and PrivacyWe present efficient protocols for private set disjointness tests. We start from an intuition of our protocols that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals information about the cardinality of the ...
Comments
Information & Contributors
Information
Published In
January 2015
674 pages
ISBN:9781450333771
DOI:10.1145/2701126
- Conference Chairs:
- Dongsoo S. Kim,
- Sang-wook Kim,
- General Chairs:
- Suk-Han Lee,
- Lajos Hanzo,
- Roslan Ismail
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 January 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Indus- trial Core Technology Development Program (MOTIE, Korea)
- MSIP (Ministry of Sci- ence, ICT & Future Planning), Korea
Conference
IMCOM '15
Sponsor:
IMCOM '15: The 9th International Conference on Ubiquitous Information Management and Communication
January 8 - 10, 2015
Bali, Indonesia
Acceptance Rates
Overall Acceptance Rate 213 of 621 submissions, 34%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 92Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in