Paper 2024/949
Efficient 2PC for Constant Round Secure Equality Testing and Comparison
Abstract
Secure equality testing and comparison are two important primitives widely used in many secure computation scenarios, such as privacy-preserving machine learning, private set intersection, and secure data mining, etc. This work proposes new constant-round two-party computation (2PC) protocols for secure equality testing and comparison.
Our protocols are designed in the online/offline paradigm.
For 32-bit inputs, the online communication cost of our equality testing protocol and secure comparison protocol are as low as 76 bits (1\% of ABY) and 384 bits (5\% of ABY) , respectively.
Our benchmarks show that (i) for 32-bit equality testing, our scheme performs
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. USENIX SECURITY 2025
- Keywords
- Equality TestingSecure ComparisonSecure Two-Party Computation
- Contact author(s)
-
lutianpei @ zju edu cn
kangxin @ stu xidian edu cn
bingsheng @ zju edu cn
mazhuo @ mail xidian edu cn
zhangxiaoyuan @ zju edu cn
bcds2018 @ foxmail com
kuiren @ zju edu cn
chenc @ zju edu cn - History
- 2025-01-26: last of 2 revisions
- 2024-06-13: received
- See all versions
- Short URL
- https://ia.cr/2024/949
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/949, author = {Tianpei Lu and Xin Kang and Bingsheng Zhang and Zhuo Ma and Xiaoyuan Zhang and Yang Liu and Kui Ren and Chun Chen}, title = {Efficient {2PC} for Constant Round Secure Equality Testing and Comparison}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/949}, year = {2024}, url = {https://eprint.iacr.org/2024/949} }