1. bookVolume 2021 (2021): Issue 4 (October 2021)
Zeitschriftendaten
License
Format
Zeitschrift
Erstveröffentlichung
16 Apr 2015
Erscheinungsweise
4 Hefte pro Jahr
Sprachen
Englisch
access type Open Access

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Online veröffentlicht: 23 Jul 2021
Seitenbereich: 291 - 311
Eingereicht: 28 Feb 2021
Akzeptiert: 16 Jun 2021
Zeitschriftendaten
License
Format
Zeitschrift
Erstveröffentlichung
16 Apr 2015
Erscheinungsweise
4 Hefte pro Jahr
Sprachen
Englisch

[1] 2020. Lattigo v2.1.1. Online: http://github.com/ldsec/lattigo.EPFL-LDS. Search in Google Scholar

[2] 2020. MP-SPDZ. Online: https://github.com/data61/MPSPDZ/. Search in Google Scholar

[3] Martin Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin Lauter, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, and Vinod Vaikuntanathan. 2018. Homomorphic Encryption Security Standard. Technical Report. HomomorphicEncryption.org, Toronto, Canada. Search in Google Scholar

[4] Andreea B Alexandru, Manfred Morari, and George J Pappas. 2018. Cloud-based MPC with encrypted data. In 2018 IEEE Conference on Decision and Control (CDC). IEEE, 5014–5019. Search in Google Scholar

[5] David W Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P Smart, and Rebecca N Wright. 2018. From Keys to Databases—Real-World Applications of Secure Multi-Party Computation. Comput. J. 61, 12 (2018), 1749–1771. Search in Google Scholar

[6] Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. 2012. Multiparty computation with low communication, computation and interaction via threshold FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 483–501. Search in Google Scholar

[7] Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O’Hearn, and Christian Winnerlein. 2013. BLAKE2: simpler, smaller, fast as MD5. In International Conference on Applied Cryptography and Network Security. Springer, 119–135. Search in Google Scholar

[8] Jean-Claude Bajard, Julien Eynard, M Anwar Hasan, and Vincent Zucca. 2016. A full RNS variant of FV like somewhat homomorphic encryption schemes. In International Conference on Selected Areas in Cryptography. Springer, 423–442. Search in Google Scholar

[9] Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Annual International Cryptology Conference. Springer, 420–432. Search in Google Scholar

[10] Dan Bogdanov, Marko Jõemets, Sander Siim, and Meril Vaht. 2015. How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation. In International Conference on Financial Cryptography and Data Security. Springer, 227–234. Search in Google Scholar

[11] Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Share-mind: A framework for fast privacy-preserving computations. In European Symposium on Research in Computer Security. Springer, 192–206. Search in Google Scholar

[12] Dan Bogdanov, Riivo Talviste, and Jan Willemson. 2012. Deploying secure multi-party computation for financial data analysis. In International Conference on Financial Cryptography and Data Security. Springer, 57–64. Search in Google Scholar

[13] Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, et al. 2009. Secure multiparty computation goes live. In International Conference on Financial Cryptography and Data Security. Springer, 325–343. Search in Google Scholar

[14] Jonathan Bootle, Vadim Lyubashevsky, and Gregor Seiler. 2019. Algebraic techniques for short (er) exact lattice-based zero-knowledge proofs. In Annual International Cryptology Conference. Springer, 176–202. Search in Google Scholar

[15] Jean-Philippe Bossuat, Christian Mouchet, Juan Troncoso-Pastoriza, and Jean-Pierre Hubaux. 2020. Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. IACR Cryptol. ePrint Arch (2020), 1203. Search in Google Scholar

[16] Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT) 6, 3 (2014), 13. Search in Google Scholar

[17] Ran Canetti and Marc Fischlin. 2001. Universally composable commitments. In Annual International Cryptology Conference. Springer, 19–40. Search in Google Scholar

[18] Hao Chen, Wei Dai, Miran Kim, and Yongsoo Song. 2019. Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 395–412. Search in Google Scholar

[19] Jung Hee Cheon, Kyoohyung Han, Andrey Kim, Miran Kim, and Yongsoo Song. 2018. Bootstrapping for approximate homomorphic encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 360–384. Search in Google Scholar

[20] Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2017. Homomorphic encryption for arithmetic of approximate numbers. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 409–437. Search in Google Scholar

[21] Hyunghoon Cho, David J Wu, and Bonnie Berger. 2018. Secure genome-wide association analysis using multiparty computation. Nature biotechnology 36, 6 (2018), 547. Search in Google Scholar

[22] Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: Private, robust, and scalable computation of aggregate statistics. In 14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17). 259–282. Search in Google Scholar

[23] Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPDℤ2k : Efficient MPC mod 2k for Dishonest Majority. In Annual International Cryptology Conference. Springer, 769–798. Search in Google Scholar

[24] Ronald Cramer, Ivan Damgård, and Jesper B Nielsen. 2001. Multiparty computation from threshold homomorphic encryption. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 280–300. Search in Google Scholar

[25] Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P Smart. 2013. Practical covertly secure MPC for dishonest majority–or: breaking the SPDZ limits. In European Symposium on Research in Computer Security. Springer, 1–18. Search in Google Scholar

[26] Ivan Damgård, Valerio Pastro, Nigel Smart, and Sarah Zakarias. 2012. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology–CRYPTO 2012. Springer, 643–662. Search in Google Scholar

[27] Leo de Castro, Chiraag Juvekar, Analog Devices, and Vinod Vaikuntanathan. 2020. Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors. IACR Cryptology ePrint Archive (2020). Search in Google Scholar

[28] Yvo G Desmedt. 1994. Threshold cryptography. European Transactions on Telecommunications 5, 4 (1994), 449–458. Search in Google Scholar

[29] Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2012 (2012), 144. Search in Google Scholar

[30] Matthew Franklin and Stuart Haber. 1996. Joint encryption and message-efficient secure computation. Journal of Cryptology 9, 4 (1996), 217–232. Search in Google Scholar

[31] David Froelicher, Juan R. Troncoso-Pastoriza, Apostolos Pyrgelis, Sinem Sav, Joao Sa Sousa, Jean-Philippe Bossuat, and Jean-Pierre Hubaux. 2021. Scalable Privacy-Preserving Distributed Learning. To be presented at PETS’21 (2021). Search in Google Scholar

[32] David Froelicher, Juan R. Troncoso-Pastoriza, Joao S. Sousa, and Jean-Pierre Hubaux. 2020. Drynx: Decentralized, Secure, Verifiable System for Statistical Queries and-Machine Learning on Distributed Datasets. IEEE Transactions on Information Forensics and Security (2020), 1–1. https://doi.org/10.1109/TIFS.2020.2976612 Search in Google Scholar

[33] Craig Gentry and Dan Boneh. 2009. A fully homomorphic encryption scheme. Vol. 20. Stanford University Stanford. Search in Google Scholar

[34] Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press. 636–638 pages. Search in Google Scholar

[35] Kyoohyung Han and Dohyeong Ki. 2020. Better bootstrapping for approximate homomorphic encryption. In Cryptographers’ Track at the RSA Conference. Springer, 364–390. Search in Google Scholar

[36] Marcella Hastings, Brett Hemenway, Daniel Noble, and Steve Zdancewic. 2019. SoK: General Purpose Compilers for Secure Multi-Party Computation. In Symposium on Security and Privacy (SP). IEEE, 1220–1270. Search in Google Scholar

[37] Karthik A Jagadeesh, David J Wu, Johannes A Birgmeier, Dan Boneh, and Gill Bejerano. 2017. Deriving genomic diagnoses without revealing patient genomes. Science 357, 6352 (2017), 692–695. Search in Google Scholar

[38] Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2016. MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 830–842. Search in Google Scholar

[39] Marcel Keller, Valerio Pastro, and Dragos Rotaru. 2018. Overdrive: making SPDZ great again. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 158–189. Search in Google Scholar

[40] Vladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek, and Ni Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.. In ACM Conference on Computer and Communications Security. 1257–1272. Search in Google Scholar

[41] Joshua Kroll, Edward Felten, and Dan Boneh. 2014. Secure protocols for accountable warrant execution. See https://www.jkroll.com/papers/warrant_paper.pdf. (2014). Search in Google Scholar

[42] Yehuda Lindell. 2017. How to simulate it–a tutorial on the simulation proof technique. In Tutorials on the Foundations of Cryptography. Springer, 277–346. Search in Google Scholar

[43] Adriana López-Alt, Eran Tromer, and Vinod Vaikuntanathan. 2011. Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2011 (2011), 663. Search in Google Scholar

[44] Adriana López-Alt, Eran Tromer, and Vinod Vaikuntanathan. 2012. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing. ACM, 1219–1234. Search in Google Scholar

[45] Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On ideal lattices and learning with errors over rings. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 1–23. Search in Google Scholar

[46] Payman Mohassel and Yupeng Zhang. 2017. SecureML: A system for scalable privacy-preserving machine learning. In 2017 38th IEEE Symposium on Security and Privacy (SP). IEEE, 19–38. Search in Google Scholar

[47] Valeria Nikolaenko, Udi Weinsberg, Stratis Ioannidis, Marc Joye, Dan Boneh, and Nina Taft. 2013. Privacy-preserving ridge regression on hundreds of millions of records. In Security and Privacy (SP), 2013 IEEE Symposium on. IEEE, 334–348. Search in Google Scholar

[48] Yuriy Polyakov, Kurt Rohloff, and Gerard W Ryan. 2018. PALISADE lattice cryptography library. https://git.njit.edu/palisade/PALISADE. Search in Google Scholar

[49] Jean Louis Raisaro, Juan Troncoso-Pastoriza, Mickaël Mis-bach, João Sá Sousa, Sylvain Pradervand, Edoardo Missiaglia, Olivier Michielin, Bryan Ford, and Jean-Pierre Hubaux. 2018. MedCo: Enabling Secure and Privacy-Preserving Exploration of Distributed Clinical and Genomic Data. IEEE/ACM transactions on computational biology and bioinformatics 16, 4 (2018), 1328–1341. Search in Google Scholar

[50] Oded Regev. 2009. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) 56, 6 (2009), 34. Search in Google Scholar

[51] Dragos Rotaru, Nigel P Smart, Titouan Tanguy, Frederik Vercauteren, and Tim Wood. 2019. Actively Secure Setup for SPDZ. IACR Cryptol. ePrint Arch. 2019 (2019), 1300. Search in Google Scholar

[52] SEAL 2019. Microsoft SEAL (release 3.2). https://github.com/Microsoft/SEAL. Microsoft Research, Redmond, WA. Search in Google Scholar

[53] Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612–613. Search in Google Scholar

[54] Alexander Viand. 2021. SoK: Fully Homomorphic Encryption Compilers. In IEEE Symposium on Security and Privacy. Search in Google Scholar

[55] Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte. 2019. Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications. In Annual International Cryptology Conference. Springer, 147–175. Search in Google Scholar

[56] Wenting Zheng, Raluca Ada Popa, Joseph E Gonzalez, and Ion Stoica. 2019. Helen: Maliciously secure coopetitive learning for linear models. In 2019 IEEE Symposium on Security and Privacy (SP). IEEE, 724–738. Search in Google Scholar

Recommended articles from Trend MD

Plan your remote conference with Sciendo