research-article

Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model

Authors:

Daniel A. Mayer,

Susanne WetzelAuthors Info & Claims

ASIACCS '12: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security

Pages 46 - 47

https://doi.org/10.1145/2414456.2414482

Published: 02 May 2012 Publication History

Abstract

In this paper we introduce the novel notion called Verifiable Private Equality Test (VPET) and propose an efficient 2-party protocol for its implementation. VPET enables two parties to securely perform an arbitrary number of comparisons on a fixed collection of (key, value) pairs and thus it is more generic than existing techniques such as Private Equality Test and Private Set Intersection.

In addition, we demonstrate how higher-level protocols such as Privacy-Preserving Reconciliation on Ordered Sets (PROS) can be implemented using VPET.

Using simulation-based techniques, our new protocols are proven secure in the malicious model. Furthermore, we present a theoretical complexity analysis as well as a thorough experimental performance evaluation of the C++ implementation of our new VPET and PROS protocols.

References

[1]

C. Aggarwal and P. Yu. Privacy-Preserving Data Mining: Models and Algorithms. Advances in Database Systems. Springer, 2008.

Digital Library

[2]

R. Agrawal, A. Evfimievski, and R. Srikant. Information Sharing Across Private Databases. In ACM Management of Data (SIGMOD), pages 86--97, New York, NY, USA, 2003. ACM.

Digital Library

[3]

F. Boudot, B. Schoenmakers, and J. Traore. A Fair and Efficient Solution to the Socialist Millionaires Problem. Discrete Applied Mathematics, 111(1--2): 23--36, 2001.

[4]

D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung. Efficient Robust Private Set Intersection. In Applied Cryptography and Network Security (ACNS), volume 5536 of LNCS, pages 125--142. Springer, 2009.

Digital Library

[5]

E. De Cristofaro, J. Kim, and G. Tsudik. Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In Advances in Cryptology (ASIACRYPT), volume 6477 of LNCS, pages 213--231. Springer Berlin/Heidelberg, 2010.

[6]

E. De Cristofaro and G. Tsudik. Practical Private Set Intersection Protocols with Linear Complexity. In Financial Cryptography and Data Security (FC), volume 6052 of LNCS, pages 143--159. Springer, 2010.

Digital Library

[7]

R. Fagin, M. Naor, and P. Winkler. Comparing Iinformation Without Leaking It. Communications of the ACM, 39: 77--85, May 1996.

Digital Library

[8]

M. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In Advances in Cryptology (EUROCRYPT), volume 3027 of LNCS, pages 1--19. Springer, 2004.

[9]

C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology, 23(3): 422--456, 2008.

[10]

C. Hazay and K. Nissim. Efficient Set Operations in the Presence of Malicious Adversaries. In Public Key Cryptography (PKC), volume 6056 of LNCS, pages 312--331. Springer, 2010.

Digital Library

[11]

S. Jarecki and X. Liu. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. In Theory of Cryptography (TCC), volume 5444 of LNCS, pages 577--594. Springer, 2009.

Digital Library

[12]

M. Kantarcioglu and O. Kardes. Privacy-Preserving Data Mining in the Malicious Model. International Journal of Information and Computer Security, 2(4): 353--375, 2008.

Digital Library

[13]

D. A. Mayer, G. Neugebauer, U. Meyer, and S. Wetzel. Enabling Fair and Privacy-Preserving Applications Using Reconciliation Protocols on Ordered Sets. In Sarnoff Symposium. IEEE, 2011.

[14]

U. Meyer, S. Wetzel, and S. Ioannidis. Distributed Privacy-Preserving Policy Reconciliation. In IEEE International Conference on Communications (ICC), pages 1342--1349. IEEE, 2007.

[15]

U. Meyer, S. Wetzel, and S. Ioannidis. New Advances on Privacy-Preserving Policy Reconciliation. In Cryptology ePrint Archive, Report 2010/64, 2010. http://eprint.iacr.org/2010/064.

[16]

M. Milian. Two Lawsuits Target Apple, App Makers Over Privacy Concerns. http://cnn.com/2010/TECH/mobile/12/28/apple.app.lawsuits/index.html, December 2010.

[17]

A. Miyaji and M. Rahman. Privacy-Preserving Data Mining in Presence of Covert Adversaries. In Advanced Data Mining and Applications (ADMA), volume 6440 of LNCS, pages 429--440. Springer Berlin/Heidelberg, 2010.

Digital Library

[18]

M. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. In Symposium on Theory of Computing (STOC), pages 245--254, New York, NY, USA, 1999. ACM.

Digital Library

[19]

T. Nishide and K. Ohta. Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In Public Key Cryptography (PKC), volume 4450 of LNCS, pages 343--360. Springer Berlin/Heidelberg, 2007.

Digital Library

[20]

J. Pepitone. Facebook Settles FTC Charges Over 2009 Privacy Breaches, 2011.

Cited By

Meng SDang CLiang BDing J(2024)Two-Round Post-quantum Private Equality Test and OT from RLWE-EncryptionInformation and Communications Security10.1007/978-981-97-8801-9_2(24-42)Online publication date: 25-Dec-2024
https://doi.org/10.1007/978-981-97-8801-9_2
Jiang YWei JPan J(2022)Publicly Verifiable Private Set Intersection from Homomorphic EncryptionSecurity and Privacy in Social Networks and Big Data10.1007/978-981-19-7242-3_8(117-137)Online publication date: 9-Oct-2022
https://doi.org/10.1007/978-981-19-7242-3_8
Alornyo SKissi Mireku KTonny-Hagan AHu X(2019)Mobile Money Wallet Security against Insider Attack Using ID-Based Cryptographic Primitive with Equality Test2019 International Conference on Cyber Security and Internet of Things (ICSIoT)10.1109/ICSIoT47925.2019.00021(82-87)Online publication date: May-2019
https://doi.org/10.1109/ICSIoT47925.2019.00021
Show More Cited By

Index Terms

Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model

Recommendations

Two-Round Post-quantum Private Equality Test and OT from RLWE-Encryption
Information and Communications Security
Abstract
This work uses the RLWE-encryption scheme to construct a novel and efficient two-round post-quantum protocol for a private equality test(PET) between two parties. The basic idea of this protocol is that the private key holder can successfully ...
Broadcast and verifiable secret sharing: new security models and round optimal constructions
New Protocols for Secure Equality Test and Comparison
Applied Cryptography and Network Security
Abstract
Protocols for securely comparing private values are among the most fundamental building blocks of multiparty computation. introduced by Yao under the name millionaire’s problem, they have found numerous applications in a variety of privacy-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASIACCS '12: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security

May 2012

119 pages

ISBN:9781450316484

DOI:10.1145/2414456

General Chairs:
Heung Youl Youm
SoonChunHyang University, Korea
,
Yoojae Won
Kisa, Korea

Copyright © 2012 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

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 May 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

ASIA CCS '12

Sponsor:

SIGSAC

ASIA CCS '12: 7th ACM Symposium on Information, Compuer and Communications Security

May 2 - 4, 2012

Seoul, Korea

Acceptance Rates

Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
148
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Meng SDang CLiang BDing J(2024)Two-Round Post-quantum Private Equality Test and OT from RLWE-EncryptionInformation and Communications Security10.1007/978-981-97-8801-9_2(24-42)Online publication date: 25-Dec-2024
https://doi.org/10.1007/978-981-97-8801-9_2
Jiang YWei JPan J(2022)Publicly Verifiable Private Set Intersection from Homomorphic EncryptionSecurity and Privacy in Social Networks and Big Data10.1007/978-981-19-7242-3_8(117-137)Online publication date: 9-Oct-2022
https://doi.org/10.1007/978-981-19-7242-3_8
Alornyo SKissi Mireku KTonny-Hagan AHu X(2019)Mobile Money Wallet Security against Insider Attack Using ID-Based Cryptographic Primitive with Equality Test2019 International Conference on Cyber Security and Internet of Things (ICSIoT)10.1109/ICSIoT47925.2019.00021(82-87)Online publication date: May-2019
https://doi.org/10.1109/ICSIoT47925.2019.00021
Shi WWei WWang JZhao QLin ZWang H(2017)A Verifiable Sealed-Bid Multi-Qualitative-Attribute Based Auction Scheme in the Semi-Honest ModelIEEE Access10.1109/ACCESS.2016.26245585(12380-12388)Online publication date: 2017
https://doi.org/10.1109/ACCESS.2016.2624558
Wu TMa SMu YZeng S(2017)ID-Based Encryption with Equality Test Against Insider AttackInformation Security and Privacy10.1007/978-3-319-60055-0_9(168-183)Online publication date: 31-May-2017
https://doi.org/10.1007/978-3-319-60055-0_9
Neugebauer GBrutschy LMeyer UWetzel S(2013)Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious ModelRevised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 824710.1007/978-3-642-54568-9_12(178-193)Online publication date: 12-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-54568-9_12
Meyer UWetzel S(2013)Privacy-Preserving Reconciliation Protocols: From Theory to Practice‘10.1007/978-3-642-42001-6_14(183-210)Online publication date: 2013
https://doi.org/10.1007/978-3-642-42001-6_14

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents