Article

Practical private data matching deterrent to spoofing attacks

Authors:

Yanjiang Yang,

Robert H. Deng,

Feng BaoAuthors Info & Claims

CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management

Pages 852 - 853

https://doi.org/10.1145/1183614.1183763

Published: 06 November 2006 Publication History

Get Access

Abstract

Private data matching between the data sets of two potentially distrusted parties has a wide range of applications. However, existing solutions have substantial weaknesses and do not meet the needs of many practical application scenarios. In particular, practical private data matching applications often require discouraging the matching parties from spoofing their private inputs. In this paper, we address this challenge by forcing the matching parties to "escrow" the data they use for matching to an auditorial agent, and in the "after-the-fact" period, they undertake the liability to attest the genuineness of the escrowed data.

References

[1]

R. Agrawal, A. Evfimievski, R. Srikant, Information Sharing Across Private Databases, Proc. ACM International Conference on Management of Data, SIGMOD'03, pp. 86--97, 2003.

Digital Library

Google Scholar

[2]

D. Chaum, Zero-knowledge Undeniable Signatures, Proc. Advances in Cryptology, Eurocrypt'90, LNCS 473, pp. 458--464, 1990.

Digital Library

Google Scholar

[3]

D. Chaum, J. H. Evertse, J. Graaf, R. Peralta, Demonstrating Possession of a Discrete Logarithm Without Revealing it, Proc. Advances in Cryptology, Crypto'86, LNCS 263, pp. 200--212, 1986

Digital Library

Google Scholar

[4]

J. Camenisch, M. Stadler, Efficient Group Signature Scheme for Large Groups, Advances in Cryptology, Crypto'97, LNCS 1296, pp. 410--424, 1997.

Digital Library

Google Scholar

[5]

M. J. Freedman, K. Nissim, B. Pinkas, Efficient Private Matching and Set Intersection, Proc. Advances in Cryptology, Eurocrypt'04, LNCS 3027, pp. 1--19, 2004.

Crossref

Google Scholar

[6]

O. Goldreich, Secure Multi-party Computation, Final (incomplete) draft, version 1.4, 2002.

Google Scholar

[7]

L. Kissner, D. Song, Privacy-Preserving Set Operations, Advances in Cryptology, Crypto'05.

Digital Library

Google Scholar

[8]

Y. P. Li, J. D. Tygar, J. M Hellerstein, Private Matchig, Computer Security in the 21st Century, Springer, pp. 25--50, 2005.

Google Scholar

Cited By

View all

Yan ZZhang PVasilakos A(2014)A survey on trust management for Internet of ThingsJournal of Network and Computer Applications10.1016/j.jnca.2014.01.01442(120-134)Online publication date: Jun-2014
https://doi.org/10.1016/j.jnca.2014.01.014
Wu MChang SLu CSun H(2014)A communication-efficient private matching scheme in Client–Server modelInformation Sciences10.1016/j.ins.2014.01.016275(348-359)Online publication date: Aug-2014
https://doi.org/10.1016/j.ins.2014.01.016
Wu ZChen ZGuo FXu L(2007)Identity Based Private MatchingThird International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (SecPerU 2007)10.1109/SECPERU.2007.6(85-90)Online publication date: Jul-2007
https://doi.org/10.1109/SECPERU.2007.6

Index Terms

Practical private data matching deterrent to spoofing attacks
1. Information systems
  1. Information systems applications

Recommendations

Efficient Disjointness Tests for Private Datasets
ACISP '08: Proceedings of the 13th Australasian conference on Information Security and Privacy

We 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 ...
Background knowledge attacks in privacy-preserving data publishing models
Abstract
Massive volumes of data are being generated at every moment through various sources in the cyber-physical world. While storing as well as facilitating these data for business or individual requirements, data disclosure, sensitive data leakage, ...
Efficient Commodity Matching for Privacy-Preserving Two-Party Bartering
CODASPY '17: Proceedings of the Seventh ACM on Conference on Data and Application Security and Privacy

Current bartering platforms place the burden of finding simultaneously executable quotes on their users. In addition, these bartering platforms do not keep quotes private. To address these shortcomings, this paper introduces a privacy-preserving ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management

November 2006

916 pages

ISBN:1595934332

DOI:10.1145/1183614

General Chair:
Philip S. Yu
IBM T.J. Watson Research Center (USA)
,
Program Chairs:
Vassilis Tsotras
University of California-Riverside (USA)
,
Edward Fox
Virginia Tech (USA)
,
Bing Liu
University of Illinois at Chicago (USA)

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM06

Sponsor:

CIKM06: Conference on Information and Knowledge Management

November 6 - 11, 2006

Virginia, Arlington, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
232
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yan ZZhang PVasilakos A(2014)A survey on trust management for Internet of ThingsJournal of Network and Computer Applications10.1016/j.jnca.2014.01.01442(120-134)Online publication date: Jun-2014
https://doi.org/10.1016/j.jnca.2014.01.014
Wu MChang SLu CSun H(2014)A communication-efficient private matching scheme in Client–Server modelInformation Sciences10.1016/j.ins.2014.01.016275(348-359)Online publication date: Aug-2014
https://doi.org/10.1016/j.ins.2014.01.016
Wu ZChen ZGuo FXu L(2007)Identity Based Private MatchingThird International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (SecPerU 2007)10.1109/SECPERU.2007.6(85-90)Online publication date: Jul-2007
https://doi.org/10.1109/SECPERU.2007.6

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient Disjointness Tests for Private Datasets

Background knowledge attacks in privacy-preserving data publishing models

Efficient Commodity Matching for Privacy-Preserving Two-Party Bartering