# An Efficient BGV-type Encryption Scheme for IoT Systems
## Appendix A Source Code of Our Implementation
### stdafx.h
#### #pragma once
_IEEE Trans. Emerg. Top. Comp._**2020**, \(8\), 352-364. [CrossRef]
* _[PERSON] and [PERSON] (2015)_ [PERSON]; [PERSON] A Hybrid Scheme of Public-Key Encryption and Somewhat Homomorphic Encryption. _IEEE Trans. Inform. Forens. Sec._**2015**, _10_, 1052-1063. [CrossRef]
* _[PERSON] et al. (2017)_ [PERSON]; [PERSON]; [PERSON] Fast Private Set Intersection from Homomorphic Encryption. In Proceedings of the ACM Conference on Computer and Communications Security 2017, Dallas, TX, USA, 30 October-3 November 2017; pp. 1243-1255. * _[PERSON] et al. (2019)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Introduction of Key Problems in Long-Distance Learning and Training. _MONET_**2019**, _24_, 1-4. [CrossRef]
* _[PERSON] et al. (2017)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Hardware Assisted Fully Homomorphic Function Evaluation and Encrypted Search. _IEEE Trans. Comp._**2017**, _66_, 1562-1572. [CrossRef]
* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Fast Homomorphic Evaluation of Deep Discretized Neural Networks. In Proceedings of the International Cryptology Conference (CRYPTO) 2018, LNCS 10993, Santa Barbara, CA, USA, 19-23 August 2018; pp. 483-512. * _[PERSON] et al. (2019)_ [PERSON]; [PERSON]. Homomorphic Time-Lock Puzzles and Applications. In Proceedings of the International Cryptology Conference (CRYPTO) 2019, LNCS 11692, Santa Barbara, CA, USA, 18-22 August 2019; pp. 620-649. * _[PERSON] (2009)_ [PERSON] Fully homomorphic encryption using ideal lattices. In _ACM Symposium on Theory of Computing (STOC) 2009;_ ACM: New York, NY, USA, 2009; pp. 169-178. * [PERSON] (2005) [PERSON] On lattices, learning with errors, random linear codes, and cryptography. In _ACM Symposium on Theory of Computing (STOC) 2005_; ACM: New York, NY, USA, 2005; pp. 84-93. * [PERSON] (2009) [PERSON] Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract. In _ACM Symposium on Theory of Computing (STOC) 2009_; ACM: New York, NY, USA, 2009; pp. 333-342. * [PERSON] and [PERSON] (2011) [PERSON]; [PERSON] Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Proceedings of the International Cryptology Conference (CRYPTO) 2011, Santa Barbara, CA, USA, 14-18 August 2011; pp. 505-524. * [PERSON] and [PERSON] (2011) [PERSON]; [PERSON], [PERSON] Efficient fully homomorphic encryption from (standard) LWE. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) 2011, Palm Springs, CA, USA, 22-25 October 2011; pp. 97-106. * [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON] (Leveled) fully homomorphic encryption without bootstrapping. In Proceedings of the Conference on Innovations in Theoretical Computer Science (ITCS), Cambridge, MA, USA, 8-10 January 2012; ACM: New York, NY, USA, 2012; pp. 309-325. * [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON] Fully homomorphic encryption with polylog overhead. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) 2012, LNCS 7237, Cambridge, UK, 15-19 April 2012; pp. 465-482. * [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON] homomorphic evaluation of the AES circuit. In Proceedings of the International Cryptology Conference (CRYPTO) 2012, LNCS 7417, Santa Barbara, CA, USA, 14-18 August 2012; pp. 850-867. * [PERSON] (2012) [PERSON] Fully homomorphic encryption without modulus switching from classical GapSVP. In Proceedings of the International Cryptology Conference (CRYPTO) 2012, LNCS 7417, Santa Barbara, CA, USA, 14-18 August 2012; pp. 868-886. * [PERSON] and [PERSON] (2014) [PERSON]; [PERSON] Algorithms in HElib. In Proceedings of the International Cryptology Conference (CRYPTO) 2014, Santa Barbara, CA, USA, 17-21 August 2014; pp. 554-571. * [PERSON] and [PERSON] (2015) [PERSON]; [PERSON] Bootstrapping for HElib. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) 2015, Sofia, Bulgaria, 26-30 April 2015; pp. 641-670.