Constant-round client-aided secure comparison protocol
From MaRDI portal
Publication:2167759
DOI10.1007/978-3-319-98989-1_20OpenAlexW2886176724MaRDI QIDQ2167759
Goichiro Hanaoka, Hiraku Morita, Satsuya Ohata, Koji Nuida, Nuttapong Attrapadung, Tadanori Teruya
Publication date: 25 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-98989-1_20
multi-party computationclient-server modelconstant roundsclient-aided methodGMW secret sharingless-than comparison
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Client-Aided Two-Party Secure Interval Test Protocol ⋮ An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
Cites Work
- Unnamed Item
- Encrypted integer division and secure comparison
- A correction to `efficient and secure comparison for on-line auctions'
- Homomorphic encryption and secure comparison
- Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols
- Conditional Encrypted Mapping and Comparing Encrypted Numbers
- Improved Primitives for Secure Multiparty Integer Computation
- Secret Sharing Comparison by Transformation and Rotation
- Foundations of Cryptography
- Practical Two-Party Computation Based on the Conditional Gate
- Strong Conditional Oblivious Transfer and Computing on Intervals
- Practical and Secure Solutions for Integer Comparison
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Theory of Cryptography
This page was built for publication: Constant-round client-aided secure comparison protocol
