Practical private data matching deterrent to spoofing attacks

Authors:
Yanjiang Yang;Robert H. Deng;Feng Bao
Affiliations:
Singapore Management University, Singapore;Singapore Management University, Singapore;Institute for Infocomm Research, Singapore
Venue:
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Year:
2006

Citing 5
Cited 0

Demonstrating possession of a discrete logarithm without revealing it

Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge undeniable signatures (extended abstract)

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Information sharing across private databases

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Privacy-preserving set operations

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.02

Visualization

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.