Abstract
License plate matching is an important facilitator for new-age services like toll billing, calculation of road taxes and law enforcement that demand both effectiveness and efficiency. The license plate itself might not be of much importance but the information linked to it may reveal a lot about the owner. Therefore, in order to maintain the privacy of information and to ensure security of the ways in which the information is used, the search/match operations are performed in the encrypted domain. We practically analyze the performance of three existing protocols for private license plate matching based on Paillier’s additively homomorphic technique. We explore various performance improvement techniques for Paillier encryption and decryption to speedup the overall matching process. In addition, we attempt to parallelise the entire procedure by separately running encryption-decryption in a multi-threaded manner, thereby speeding up the process. Finally, we perform comparative analysis of experimental results of the four implementation techniques (along with parallelisation).
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
Sunil, A.B., Erkiny, Z., Veugenyz, T.: Secure matching of Dutch car license plates. In: 24th European Signal Processing Conference (EUSIPCO), pp. 2116–2120 (2016)
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). https://doi.org/10.1007/3-540-48910-X_16
Jost, C., Lam, H., Maximov, A., Smeets, B.: Encryption performance improvements of the Paillier cryptosystem. IACR Cryptol. ePrint Arch. 2015, 864 (2015)
Sunil, A.B.: Secure License Plate Matching using Homomorphic Encryption. Masters thesis, Vrije Universiteit Amsterdam (2015)
Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)
ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)
Min, Z., Yang, G., Shi, J.: A privacy-preserving parallel and homomorphic encryption scheme. Open Phys. 15, 135–142 (2017)
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5), 481–490 (1997)
Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 235–253. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03168-7_14
Jakobsen, T.P., Makkes, M.X., Nielsen, J.D.: Efficient implementation of the Orlandi protocol. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 255–272. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13708-2_16
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
Vaishnav, H., Sharma, S., Mathuria, A. (2017). Efficient Implementation of Private License Plate Matching Protocols. In: Ali, S., Danger, JL., Eisenbarth, T. (eds) Security, Privacy, and Applied Cryptography Engineering. SPACE 2017. Lecture Notes in Computer Science(), vol 10662. Springer, Cham. https://doi.org/10.1007/978-3-319-71501-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-71501-8_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71500-1
Online ISBN: 978-3-319-71501-8
eBook Packages: Computer ScienceComputer Science (R0)