Efficient Implementation of Private License Plate Matching Protocols
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).
KeywordsSecure license plate matching Paillier’s encryption Performance analysis Encryption-decryption Parallelisation
- 1.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)Google Scholar
- 3.Jost, C., Lam, H., Maximov, A., Smeets, B.: Encryption performance improvements of the Paillier cryptosystem. IACR Cryptol. ePrint Arch. 2015, 864 (2015)Google Scholar
- 4.Sunil, A.B.: Secure License Plate Matching using Homomorphic Encryption. Masters thesis, Vrije Universiteit Amsterdam (2015)Google Scholar
- 5.Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)Google Scholar