Fully homomorphic encryption with applications to electronic voting
Has parts
Paper 1: Armknecht, Frederik; Boyd, Colin; Carr, Christopher; Gjøsteen, Kristian; Jäschke, Angela; Gorke, Christian A.; and Strand, Martin. A Guide to Fully Homomorphic Encryption. ePrint 2015/1192Paper 2: Gjøsteen, Kristian; Strand, Martin. Can there be efficient and natural FHE schemes? ePrint 2016/105.
Paper 3: Gjøsteen, Kristian; Strand, Martin. A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability. I: Financial Cryptography and Data Security -- FC 2017 International Workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, April 7, 2017, Revised Selected Papers. Springer 2017, s. 404-418. http://doi.org/10.1007/978-3-319-70278-0_25
Paper 4: Strand, Martin. A verifiable shuffle for the GSW cryptosystem. ePrint 2018/027.
Paper 5: Carr, Christopher; Costache, Anamaria; Davies, Gareth T.; Gjøsteen, Kristian; Strand, Martin. Zero-Knowledge Proof of Decryption for FHE Ciphertexts. ePrint 2018/026.