{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:00:05Z","timestamp":1778497205390,"version":"3.51.4"},"reference-count":56,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"4","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE). To support our solution, we introduce a multiparty version of the Brakerski-Fan-Vercauteren homomorphic cryptosystem and implement it in an open-source library. MHE-based MPC solutions have several advantages: Their transcript is public, their <jats:italic>o~ine<\/jats:italic> phase is compact, and their circuit-evaluation procedure is noninteractive. By exploiting these properties, the communication complexity of MPC tasks is reduced from quadratic to linear in the number of parties, thus enabling secure computation among potentially thousands of parties and in a broad variety of computing paradigms, from the traditional peer-to-peer setting to cloud-outsourcing and smart-contract technologies. MHE-based approaches can also outperform the state-of-the-art solutions, even for a small number of parties. We demonstrate this for three circuits: <jats:italic>private input selection<\/jats:italic> with application to private-information retrieval, <jats:italic>component-wise vector multiplication<\/jats:italic> with application to private-set intersection, and <jats:italic>Beaver multiplication triples generation<\/jats:italic>. For the first circuit, privately selecting one input among eight thousand parties\u2019 (of 32 KB each) requires only 1.31 MB of communication per party and completes in 61.7 seconds. For the second circuit with eight parties, our approach is 8.6 times faster and requires 39.3 times less communication than the current methods. For the third circuit and ten parties, our approach generates 20 times more triples per second while requiring 136 times less communication per-triple than an approach based on oblivious transfer. We implemented our scheme in the Lattigo library and open-sourced the code at github.com\/ldsec\/lattigo.<\/jats:p>","DOI":"10.2478\/popets-2021-0071","type":"journal-article","created":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T23:24:56Z","timestamp":1627169096000},"page":"291-311","source":"Crossref","is-referenced-by-count":106,"title":["Multiparty Homomorphic Encryption from Ring-Learning-with-Errors"],"prefix":"10.56553","volume":"2021","author":[{"given":"Christian","family":"Mouchet","sequence":"first","affiliation":[{"name":"\u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne"}]},{"given":"Juan","family":"Troncoso-Pastoriza","sequence":"additional","affiliation":[{"name":"\u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne"}]},{"given":"Jean-Philippe","family":"Bossuat","sequence":"additional","affiliation":[{"name":"\u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne"}]},{"given":"Jean-Pierre","family":"Hubaux","sequence":"additional","affiliation":[{"name":"\u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne"}]}],"member":"35752","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"2022060521172488203_j_popets-2021-0071_ref_001","unstructured":"[1] 2020. Lattigo v2.1.1. Online: http:\/\/github.com\/ldsec\/lattigo.EPFL-LDS."},{"key":"2022060521172488203_j_popets-2021-0071_ref_002","unstructured":"[2] 2020. MP-SPDZ. Online: https:\/\/github.com\/data61\/MPSPDZ\/."},{"key":"2022060521172488203_j_popets-2021-0071_ref_003","unstructured":"[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."},{"key":"2022060521172488203_j_popets-2021-0071_ref_004","doi-asserted-by":"crossref","unstructured":"[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\u20135019.","DOI":"10.1109\/CDC.2018.8619835"},{"key":"2022060521172488203_j_popets-2021-0071_ref_005","doi-asserted-by":"crossref","unstructured":"[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\u2014Real-World Applications of Secure Multi-Party Computation. Comput. J. 61, 12 (2018), 1749\u20131771.10.1093\/comjnl\/bxy090","DOI":"10.1093\/comjnl\/bxy090"},{"key":"2022060521172488203_j_popets-2021-0071_ref_006","doi-asserted-by":"crossref","unstructured":"[6] Gilad Asharov, Abhishek Jain, Adriana L\u00f3pez-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\u2013501.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"2022060521172488203_j_popets-2021-0071_ref_007","doi-asserted-by":"crossref","unstructured":"[7] Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O\u2019Hearn, and Christian Winnerlein. 2013. BLAKE2: simpler, smaller, fast as MD5. In International Conference on Applied Cryptography and Network Security. Springer, 119\u2013135.","DOI":"10.1007\/978-3-642-38980-1_8"},{"key":"2022060521172488203_j_popets-2021-0071_ref_008","doi-asserted-by":"crossref","unstructured":"[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\u2013442.","DOI":"10.1007\/978-3-319-69453-5_23"},{"key":"2022060521172488203_j_popets-2021-0071_ref_009","doi-asserted-by":"crossref","unstructured":"[9] Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Annual International Cryptology Conference. Springer, 420\u2013432.","DOI":"10.1007\/3-540-46766-1_34"},{"key":"2022060521172488203_j_popets-2021-0071_ref_010","doi-asserted-by":"crossref","unstructured":"[10] Dan Bogdanov, Marko J\u00f5emets, 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\u2013234.","DOI":"10.1007\/978-3-662-47854-7_14"},{"key":"2022060521172488203_j_popets-2021-0071_ref_011","doi-asserted-by":"crossref","unstructured":"[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\u2013206.","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"2022060521172488203_j_popets-2021-0071_ref_012","doi-asserted-by":"crossref","unstructured":"[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\u201364.","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"2022060521172488203_j_popets-2021-0071_ref_013","doi-asserted-by":"crossref","unstructured":"[13] Peter Bogetoft, Dan Lund Christensen, Ivan Damg\u00e5rd, Martin Geisler, Thomas Jakobsen, Mikkel Kr\u00f8igaard, 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\u2013343.","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"2022060521172488203_j_popets-2021-0071_ref_014","doi-asserted-by":"crossref","unstructured":"[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\u2013202.","DOI":"10.1007\/978-3-030-26948-7_7"},{"key":"2022060521172488203_j_popets-2021-0071_ref_015","doi-asserted-by":"crossref","unstructured":"[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.","DOI":"10.1007\/978-3-030-77870-5_21"},{"key":"2022060521172488203_j_popets-2021-0071_ref_016","doi-asserted-by":"crossref","unstructured":"[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.","DOI":"10.1145\/2633600"},{"key":"2022060521172488203_j_popets-2021-0071_ref_017","doi-asserted-by":"crossref","unstructured":"[17] Ran Canetti and Marc Fischlin. 2001. Universally composable commitments. In Annual International Cryptology Conference. Springer, 19\u201340.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"2022060521172488203_j_popets-2021-0071_ref_018","doi-asserted-by":"crossref","unstructured":"[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\u2013412.10.1145\/3319535.3363207","DOI":"10.1145\/3319535.3363207"},{"key":"2022060521172488203_j_popets-2021-0071_ref_019","doi-asserted-by":"crossref","unstructured":"[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\u2013384.","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"2022060521172488203_j_popets-2021-0071_ref_020","doi-asserted-by":"crossref","unstructured":"[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\u2013437.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"2022060521172488203_j_popets-2021-0071_ref_021","doi-asserted-by":"crossref","unstructured":"[21] Hyunghoon Cho, David J Wu, and Bonnie Berger. 2018. Secure genome-wide association analysis using multiparty computation. Nature biotechnology 36, 6 (2018), 547.","DOI":"10.1038\/nbt.4108"},{"key":"2022060521172488203_j_popets-2021-0071_ref_022","unstructured":"[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\u2013282."},{"key":"2022060521172488203_j_popets-2021-0071_ref_023","doi-asserted-by":"crossref","unstructured":"[23] Ronald Cramer, Ivan Damg\u00e5rd, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPD\u21242k : Efficient MPC mod 2k for Dishonest Majority. In Annual International Cryptology Conference. Springer, 769\u2013798.","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"2022060521172488203_j_popets-2021-0071_ref_024","doi-asserted-by":"crossref","unstructured":"[24] Ronald Cramer, Ivan Damg\u00e5rd, and Jesper B Nielsen. 2001. Multiparty computation from threshold homomorphic encryption. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 280\u2013300.","DOI":"10.1007\/3-540-44987-6_18"},{"key":"2022060521172488203_j_popets-2021-0071_ref_025","doi-asserted-by":"crossref","unstructured":"[25] Ivan Damg\u00e5rd, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P Smart. 2013. Practical covertly secure MPC for dishonest majority\u2013or: breaking the SPDZ limits. In European Symposium on Research in Computer Security. Springer, 1\u201318.","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"2022060521172488203_j_popets-2021-0071_ref_026","doi-asserted-by":"crossref","unstructured":"[26] Ivan Damg\u00e5rd, Valerio Pastro, Nigel Smart, and Sarah Zakarias. 2012. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology\u2013CRYPTO 2012. Springer, 643\u2013662.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"2022060521172488203_j_popets-2021-0071_ref_027","doi-asserted-by":"crossref","unstructured":"[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).10.1145\/3474366.3486928","DOI":"10.1145\/3474366.3486928"},{"key":"2022060521172488203_j_popets-2021-0071_ref_028","doi-asserted-by":"crossref","unstructured":"[28] Yvo G Desmedt. 1994. Threshold cryptography. European Transactions on Telecommunications 5, 4 (1994), 449\u2013458.","DOI":"10.1002\/ett.4460050407"},{"key":"2022060521172488203_j_popets-2021-0071_ref_029","unstructured":"[29] Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2012 (2012), 144."},{"key":"2022060521172488203_j_popets-2021-0071_ref_030","doi-asserted-by":"crossref","unstructured":"[30] Matthew Franklin and Stuart Haber. 1996. Joint encryption and message-efficient secure computation. Journal of Cryptology 9, 4 (1996), 217\u2013232.","DOI":"10.1007\/BF00189261"},{"key":"2022060521172488203_j_popets-2021-0071_ref_031","doi-asserted-by":"crossref","unstructured":"[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\u201921 (2021).10.2478\/popets-2021-0030","DOI":"10.2478\/popets-2021-0030"},{"key":"2022060521172488203_j_popets-2021-0071_ref_032","doi-asserted-by":"crossref","unstructured":"[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\u20131. https:\/\/doi.org\/10.1109\/TIFS.2020.297661210.1109\/TIFS.2020.2976612","DOI":"10.1109\/TIFS.2020.2976612"},{"key":"2022060521172488203_j_popets-2021-0071_ref_033","unstructured":"[33] Craig Gentry and Dan Boneh. 2009. A fully homomorphic encryption scheme. Vol. 20. Stanford University Stanford."},{"key":"2022060521172488203_j_popets-2021-0071_ref_034","unstructured":"[34] Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press. 636\u2013638 pages."},{"key":"2022060521172488203_j_popets-2021-0071_ref_035","doi-asserted-by":"crossref","unstructured":"[35] Kyoohyung Han and Dohyeong Ki. 2020. Better bootstrapping for approximate homomorphic encryption. In Cryptographers\u2019 Track at the RSA Conference. Springer, 364\u2013390.","DOI":"10.1007\/978-3-030-40186-3_16"},{"key":"2022060521172488203_j_popets-2021-0071_ref_036","doi-asserted-by":"crossref","unstructured":"[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\u20131270.","DOI":"10.1109\/SP.2019.00028"},{"key":"2022060521172488203_j_popets-2021-0071_ref_037","doi-asserted-by":"crossref","unstructured":"[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\u2013695.","DOI":"10.1126\/science.aam9710"},{"key":"2022060521172488203_j_popets-2021-0071_ref_038","doi-asserted-by":"crossref","unstructured":"[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\u2013842.10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"2022060521172488203_j_popets-2021-0071_ref_039","doi-asserted-by":"crossref","unstructured":"[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\u2013189.","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"2022060521172488203_j_popets-2021-0071_ref_040","doi-asserted-by":"crossref","unstructured":"[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\u20131272.10.1145\/3133956.3134065","DOI":"10.1145\/3133956.3134065"},{"key":"2022060521172488203_j_popets-2021-0071_ref_041","unstructured":"[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)."},{"key":"2022060521172488203_j_popets-2021-0071_ref_042","doi-asserted-by":"crossref","unstructured":"[42] Yehuda Lindell. 2017. How to simulate it\u2013a tutorial on the simulation proof technique. In Tutorials on the Foundations of Cryptography. Springer, 277\u2013346.","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"2022060521172488203_j_popets-2021-0071_ref_043","unstructured":"[43] Adriana L\u00f3pez-Alt, Eran Tromer, and Vinod Vaikuntanathan. 2011. Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2011 (2011), 663."},{"key":"2022060521172488203_j_popets-2021-0071_ref_044","doi-asserted-by":"crossref","unstructured":"[44] Adriana L\u00f3pez-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\u20131234.","DOI":"10.1145\/2213977.2214086"},{"key":"2022060521172488203_j_popets-2021-0071_ref_045","doi-asserted-by":"crossref","unstructured":"[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\u201323.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2022060521172488203_j_popets-2021-0071_ref_046","doi-asserted-by":"crossref","unstructured":"[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\u201338.","DOI":"10.1109\/SP.2017.12"},{"key":"2022060521172488203_j_popets-2021-0071_ref_047","doi-asserted-by":"crossref","unstructured":"[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\u2013348.","DOI":"10.1109\/SP.2013.30"},{"key":"2022060521172488203_j_popets-2021-0071_ref_048","unstructured":"[48] Yuriy Polyakov, Kurt Rohloff, and Gerard W Ryan. 2018. PALISADE lattice cryptography library. https:\/\/git.njit.edu\/palisade\/PALISADE."},{"key":"2022060521172488203_j_popets-2021-0071_ref_049","doi-asserted-by":"crossref","unstructured":"[49] Jean Louis Raisaro, Juan Troncoso-Pastoriza, Micka\u00ebl Mis-bach, Jo\u00e3o S\u00e1 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\u20131341.","DOI":"10.1109\/TCBB.2018.2854776"},{"key":"2022060521172488203_j_popets-2021-0071_ref_050","doi-asserted-by":"crossref","unstructured":"[50] Oded Regev. 2009. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) 56, 6 (2009), 34.","DOI":"10.1145\/1568318.1568324"},{"key":"2022060521172488203_j_popets-2021-0071_ref_051","unstructured":"[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."},{"key":"2022060521172488203_j_popets-2021-0071_ref_052","unstructured":"[52] SEAL 2019. Microsoft SEAL (release 3.2). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA."},{"key":"2022060521172488203_j_popets-2021-0071_ref_053","doi-asserted-by":"crossref","unstructured":"[53] Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612\u2013613.","DOI":"10.1145\/359168.359176"},{"key":"2022060521172488203_j_popets-2021-0071_ref_054","doi-asserted-by":"crossref","unstructured":"[54] Alexander Viand. 2021. SoK: Fully Homomorphic Encryption Compilers. In IEEE Symposium on Security and Privacy.10.1109\/SP40001.2021.00068","DOI":"10.1109\/SP40001.2021.00068"},{"key":"2022060521172488203_j_popets-2021-0071_ref_055","doi-asserted-by":"crossref","unstructured":"[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\u2013175.","DOI":"10.1007\/978-3-030-26948-7_6"},{"key":"2022060521172488203_j_popets-2021-0071_ref_056","doi-asserted-by":"crossref","unstructured":"[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\u2013738.","DOI":"10.1109\/SP.2019.00045"}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.sciendo.com\/pdf\/10.2478\/popets-2021-0071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:31:43Z","timestamp":1658334703000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2021\/popets-2021-0071.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":56,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,7,23]]},"published-print":{"date-parts":[[2021,10,1]]}},"alternative-id":["10.2478\/popets-2021-0071"],"URL":"https:\/\/doi.org\/10.2478\/popets-2021-0071","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]}}}