Abstract
In secure multi-party computation, one of the most useful and basic functionalities that have been realized over additive homomorphic encryption is secure comparison of two integers, where one party has encrypted integers to be compared while only the other party has the decryption key. In IEEE WIFS 2012, Veugen proposed an efficient protocol for this problem in the semi-honest model, which provides perfect security against the latter party. In this paper, we point out that the protocol by Veugen outputs an incorrect value in some cases, and then propose a way to fix the flaws with only slight overhead in efficiency. Our proposed correction is not straightforward, in the sense that it required an “outsourced” homomorphic multiplication protocol for two encrypted values, which was not needed in the original protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. In: NDSS 2015, California, USA, February 2015
Damgård, I., Geisler, M., Krøigaard, M.: Efficient and secure comparison for on-line auctions. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 416–430. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73458-1_30
Damgård, I., Geisler, M., Krøigaard, M.: A correction to ‘efficient and secure comparison for on-line auctions’. Int. J. Appl. Cryptography 1(4), 323–324 (2009)
Hallgren, P., Ochoa, M., Sabelfeld, A.: BetterTimes. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 291–309. Springer, Cham (2015). doi:10.1007/978-3-319-26059-4_16
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). doi:10.1007/3-540-48910-X_16
Veugen, T.: Improving the DGK comparison protocol. In: Proceedings of IEEE WIFS 2012, pp. 49–54 (2012)
Acknowledgments
The authors thank Goichiro Hanaoka, Kana Shimizu and more generally all the members of Advanced Cryptography Research Group, Information Technology Research Institute from AIST for their supervision, help and collaboration. They also thank Jean-Pierre Hubaux from the EPFL Laboratory for Communications and Applications for assuming the role of supervising teacher of the first author’s Master Thesis during which this paper was mainly produced. They also thank the anonymous reviewers for their comments. This work was supported by JST PRESTO Grant Number JPMJPR14E8, Japan.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Vinh Mau, B., Nuida, K. (2017). Correction of a Secure Comparison Protocol for Encrypted Integers in IEEE WIFS 2012 (Short Paper). In: Obana, S., Chida, K. (eds) Advances in Information and Computer Security. IWSEC 2017. Lecture Notes in Computer Science(), vol 10418. Springer, Cham. https://doi.org/10.1007/978-3-319-64200-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-64200-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64199-7
Online ISBN: 978-3-319-64200-0
eBook Packages: Computer ScienceComputer Science (R0)