Efficient NewHope Cryptography Based Facial Security System on a GPU

With explosive era of machine learning development, human data, such as biometric images, videos, and particularly facial information, have become an essential training resource. The popularity of video surveillance systems and growing use of facial images have increased the risk of leaking personal information. On the other hand, traditional cryptography systems are still expensive, time consuming, and low security, leading to be threatened by the foreseeable attacks of quantum computers. This paper proposes a novel approach to fully protect facial images extracted from videos based on a post-quantum cryptosystem named NewHope cryptography. Applying the proposed technique to arrange input data for encryption and decryption processes significantly reduces encryption and decryption times. The proposed facial security system was successfully accelerated using data-parallel computing model on the recently launched Nvidia GTX 2080Ti Graphics Processing Unit (GPU). Average face frame extracted from video (<inline-formula> <tex-math notation="LaTeX">$190\times 190$ </tex-math></inline-formula> pixel) required only <inline-formula> <tex-math notation="LaTeX">$2.2~ms$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$2.7~ms$ </tex-math></inline-formula> total encryption and decryption times with security parameters <inline-formula> <tex-math notation="LaTeX">$n=1024$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$n=2048$ </tex-math></inline-formula>, respectively, which is approximately 9 times faster than previous approaches. Analysis results of security criteria proved that the proposed system offered comparable confidentiality to previous systems.

[1]  C. Chui,et al.  A symmetric image encryption scheme based on 3D chaotic cat maps , 2004 .

[2]  DuttNikil,et al.  Post-Quantum Lattice-Based Cryptography Implementations , 2019 .

[3]  Dingding Jia,et al.  LAC: Practical Ring-LWE Based Public-Key Encryption with Byte-Level Modulus , 2018, IACR Cryptol. ePrint Arch..

[4]  Brindha Murugan,et al.  A chaotic image encryption scheme with complex diffusion matrix for plain image sensitivity , 2019 .

[5]  Sorin A. Huss,et al.  On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes , 2012, CHES.

[6]  Hongyuan Wang,et al.  Face Detection and Encryption for Privacy Preserving in Surveillance Video , 2018, PRCV.

[7]  Paul A. Viola,et al.  Rapid object detection using a boosted cascade of simple features , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[8]  Jaime Velasco-Medina,et al.  High-Throughput Ring-LWE Cryptoprocessors , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[9]  O. Regev The Learning with Errors problem , 2010 .

[10]  Hanho Lee,et al.  Ring-LWE Based Face Encryption and Decryption System on a GPU , 2019, 2019 International SoC Design Conference (ISOCC).

[11]  Léo Ducas,et al.  Lattice Signatures and Bimodal Gaussians , 2013, IACR Cryptol. ePrint Arch..

[12]  Tim Güneysu,et al.  High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers , 2015, LATINCRYPT.

[13]  Nikil D. Dutt,et al.  Post-Quantum Lattice-Based Cryptography Implementations , 2019, ACM Comput. Surv..

[14]  G. Marsaglia,et al.  The Ziggurat Method for Generating Random Variables , 2000 .

[15]  W. M. Gentleman,et al.  Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

[16]  Franz Winkler,et al.  Polynomial Algorithms in Computer Algebra , 1996, Texts and Monographs in Symbolic Computation.

[17]  Hanho Lee,et al.  High-Secure Fingerprint Authentication System Using Ring-LWE Cryptography , 2019, IEEE Access.

[18]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[19]  Morris J. Dworkin,et al.  SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions , 2015 .

[20]  Erdem Alkim,et al.  Post-quantum Key Exchange - A New Hope , 2016, USENIX Security Symposium.

[21]  Ingrid Verbauwhede,et al.  24.1 Circuit challenges from cryptography , 2015, 2015 IEEE International Solid-State Circuits Conference - (ISSCC) Digest of Technical Papers.

[22]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[23]  Hanho Lee,et al.  High-performance Ring-LWE Cryptography Scheme for Biometric Data Security , 2018 .

[24]  Frederik Vercauteren,et al.  Compact Ring-LWE Cryptoprocessor , 2014, CHES.

[25]  Tanja Lange,et al.  HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction , 2018, IACR Cryptol. ePrint Arch..

[26]  Shay Gueron,et al.  Speeding up R-LWE Post-quantum Key Exchange , 2016, NordSec.

[27]  Hanho Lee,et al.  Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor , 2016 .

[28]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[29]  Damien Stehlé,et al.  CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM , 2017, 2018 IEEE European Symposium on Security and Privacy (EuroS&P).

[30]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[31]  Taghi M. Khoshgoftaar,et al.  Deep learning applications and challenges in big data analytics , 2015, Journal of Big Data.

[32]  Craig Costello,et al.  Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem , 2015, 2015 IEEE Symposium on Security and Privacy.

[33]  Xue Ouyang,et al.  An Image Encryption Method Based on Elliptic Curve Elgamal Encryption and Chaotic Systems , 2019, IEEE Access.

[34]  Oded Regev,et al.  The Learning with Errors Problem (Invited Survey) , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[35]  Chris Peikert,et al.  On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.

[36]  Patrick Longa,et al.  Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography , 2016, CANS.

[37]  Rainer Lienhart,et al.  An extended set of Haar-like features for rapid object detection , 2002, Proceedings. International Conference on Image Processing.

[38]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.