Abstract

Secure comparison protocol outputs an unencrypted or encrypted comparison result. In this paper, we focus on a secure comparison protocol with an encrypted output. In recent works, since the computation of such protocols proceeds bitwise, the efficiency problem has not yet been solved. In this study, we propose a new secure comparison protocol with an encrypted output, which is a generalization of one proposed by Kobayashi and Hakuta (2018). As an interesting feature, a computation of our proposed protocol proceeds w bits-by-w bits for any positive integer w to compute an output. We discuss the security under semi-honest model. Furthermore, we estimate for the efficiency.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.