{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:57Z","timestamp":1750221237012,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":45,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002301","name":"Eesti Teadusagentuur","doi-asserted-by":"publisher","award":["IUT27-1"],"award-info":[{"award-number":["IUT27-1"]}],"id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3267973.3267979","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T12:56:36Z","timestamp":1539694596000},"page":"37-48","source":"Crossref","is-referenced-by-count":0,"title":["Bit Decomposition Protocols in Secure Multiparty Computation"],"prefix":"10.1145","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alisa","family":"Pankova","sequence":"additional","affiliation":[{"name":"Cybernetica AS, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3267973.3267979-1","unstructured":"Joy Algesheimer, Jan Camenisch, and Victor Shoup. 2002. Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18--22, 2002, Proceedings (Lecture Notes in Computer Science), Moti Yung (Ed.), Vol. 2442. Springer, 417--432. https:\/\/doi.org\/10.1007\/3--540--45708--9_27"},{"key":"key-10.1145\/3267973.3267979-2","doi-asserted-by":"crossref","unstructured":"Yonatan Aumann and Yehuda Lindell. 2010. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptology , Vol. 23, 2 (2010), 281--343. https:\/\/doi.org\/10.1007\/s00145-009--9040--7","DOI":"10.1007\/s00145-009-9040-7"},{"key":"key-10.1145\/3267973.3267979-3","doi-asserted-by":"crossref","unstructured":"Carsten Baum, Ivan Damgård, and Claudio Orlandi. 2014. Publicly Auditable Secure Multi-Party Computation. In Security and Cryptography for Networks - 9th International Conference, SCN 2014. Proceedings (LNCS), Michel Abdalla and Roberto De Prisco (Eds.), Vol. 8642. Springer, 175--196. https:\/\/doi.org\/10.1007\/978--3--319--10879--7_11","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"key-10.1145\/3267973.3267979-4","unstructured":"Dan Bogdanov, Peeter Laud, Sven Laur, and Pille Pullonen. 2014b. From Input Private to Universally Composable Secure Multi-party Computation Primitives. In IEEE 27th Computer Security Foundations Symposium, CSF 2014 . IEEE, 184--198."},{"key":"key-10.1145\/3267973.3267979-5","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov, Peeter Laud, and Jaak Randmets. 2014a. Domain-Polymorphic Programming of Privacy-Preserving Applications. In Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, PLAS@ECOOP 2014, Uppsala, Sweden, July 29, 2014 , , Alejandro Russo and Omer Tripp (Eds.). ACM , 53. https:\/\/doi.org\/10.1145\/2637113.2637119","DOI":"10.1145\/2637113.2637119"},{"key":"key-10.1145\/3267973.3267979-6","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS (LNCS), Sushil Jajodia and Javier López (Eds.), Vol. 5283. Springer, 192--206.","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"key-10.1145\/3267973.3267979-7","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov, Margus Niitsoo, Tomas Toft, and Jan Willemson. 2012. High-performance secure multi-party computation for data mining applications. Int. J. Inf. Sec. , Vol. 11, 6 (2012), 403--418.","DOI":"10.1007\/s10207-012-0177-2"},{"key":"key-10.1145\/3267973.3267979-8","doi-asserted-by":"crossref","unstructured":"Justin Brickell, Donald E. Porter, Vitaly Shmatikov, and Emmett Witchel. 2007. Privacy-preserving remote diagnostics. In Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28--31, 2007, Peng Ning, Sabrina De Capitani di Vimercati, and Paul F. Syverson (Eds.). ACM , 498--507. https:\/\/doi.org\/10.1145\/1315245.1315307","DOI":"10.1145\/1315245.1315307"},{"key":"key-10.1145\/3267973.3267979-9","unstructured":"Martin Burkhart, Mario Strasser, Dilip Many, and Xenofontas A. Dimitropoulos. 2010. SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In 19th USENIX Security Symposium, Washington, DC, USA, August 11--13, 2010, Proceedings. USENIX Association, 223--240. http:\/\/www.usenix.org\/events\/sec10\/tech\/full_papers\/Burkhart.pdf"},{"key":"key-10.1145\/3267973.3267979-10","doi-asserted-by":"crossref","unstructured":"Octavian Catrina and Amitabh Saxena. 2010. Secure Computation with Fixed-Point Numbers. In Financial Cryptography and Data Security (LNCS), Radu Sion (Ed.), Vol. 6052. Springer, 35--50.","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"key-10.1145\/3267973.3267979-11","doi-asserted-by":"crossref","unstructured":"David Chaum, Claude Cré peau, and Ivan Damgård. 1988. Multiparty Unconditionally Secure Protocols (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA , Janos Simon (Ed.). ACM, 11--19. https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"key-10.1145\/3267973.3267979-12","unstructured":"Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Nielsen, and Tomas Toft. 2006. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In Proceedings of The Third Theory of Cryptography Conference, TCC 2006 (LNCS), Vol. 3876. Springer."},{"key":"key-10.1145\/3267973.3267979-13","unstructured":"Ivan Damgård, Martin Geisler, Mikkel Krøigaard, and Jesper Buus Nielsen. 2009. Asynchronous Multiparty Computation: Theory and Implementation. In Public Key Cryptography - PKC 2009, 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18--20, 2009. Proceedings (Lecture Notes in Computer Science), , Stanislaw Jarecki and Gene Tsudik (Eds.), Vol. 5443. Springer, 160--179. https:\/\/doi.org\/10.1007\/978--3--642-00468--1_10"},{"key":"key-10.1145\/3267973.3267979-14","unstructured":"Ivan Damgård, Martin Geisler, and Jesper Buus Nielsen. 2010. From Passive to Covert Security at Low Cost. In Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9--11, 2010. Proceedings (LNCS), Daniele Micciancio (Ed.), Vol. 5978. Springer, 128--145."},{"key":"key-10.1145\/3267973.3267979-15","unstructured":"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 Computer Security - ESORICS 2013 - 18th European Symposium on Research in Computer Security, Egham, UK, September 9--13, 2013. Proceedings (LNCS), , Jason Crampton, Sushil Jajodia, and Keith Mayes (Eds.), Vol. 8134. Springer, 1--18."},{"key":"key-10.1145\/3267973.3267979-16","unstructured":"Ivan Damgård, Claudio Orlandi, and Mark Simkin. 2017. Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. Cryptology ePrint Archive, Report 2017\/908. https:\/\/eprint.iacr.org\/2017\/908."},{"key":"key-10.1145\/3267973.3267979-17","unstructured":"Ivan Damgård, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. 2012. Multiparty Computation from Somewhat Homomorphic Encryption, See citeNDBLP:conf\/crypto\/2012, 643--662."},{"key":"key-10.1145\/3267973.3267979-18","unstructured":"Ivan Damgård and Sarah Zakarias. 2013. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. In TCC. 621--641. https:\/\/doi.org\/10.1007\/978--3--642--36594--2_35"},{"key":"key-10.1145\/3267973.3267979-19","doi-asserted-by":"crossref","unstructured":"Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8--11, 2015. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2015\/aby--framework-efficient-mixed-protocol-secure-two-party-computation","DOI":"10.14722\/ndss.2015.23113"},{"key":"key-10.1145\/3267973.3267979-20","doi-asserted-by":"crossref","unstructured":"Vassil Dimitrov, Liisi Kerik, Toomas Krips, Jaak Randmets, and Jan Willemson. 2016. Alternative Implementations of Secure Real Numbers, See citeNDBLP:conf\/ccs\/2016, 553--564. https:\/\/doi.org\/10.1145\/2976749.2978348","DOI":"10.1145\/2976749.2978348"},{"key":"key-10.1145\/3267973.3267979-21","unstructured":"Jun Furukawa, Yehuda Lindell, Ariel Nof, and Or Weinstein. 2017. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part II (Lecture Notes in Computer Science), , Jean-Sé bastien Coron and Jesper Buus Nielsen (Eds.), Vol. 10211. 225--255. https:\/\/doi.org\/10.1007\/978--3--319--56614--6_8"},{"key":"key-10.1145\/3267973.3267979-22","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA , , Alfred V. Aho (Ed.). ACM, 218--229. https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"key-10.1145\/3267973.3267979-23","doi-asserted-by":"crossref","unstructured":"Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. 2010. TASTY: tool for automating secure two-party computations. In CCS '10: Proceedings of the 17th ACM conference on Computer and Communications Security . ACM, 451--462.","DOI":"10.1145\/1866307.1866358"},{"key":"key-10.1145\/3267973.3267979-24","doi-asserted-by":"crossref","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2016. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer, See citeNDBLP:conf\/ccs\/2016, 830--842. https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"key-10.1145\/3267973.3267979-25","doi-asserted-by":"crossref","unstructured":"Liisi Kerik, Peeter Laud, and Jaak Randmets. 2016. Optimizing MPC for robust and scalable integer and floating-point arithmetic. In Proceedings of WAHC'16 - 4th Workshop on Encrypted Computing and Applied Homomorphic Cryptography .","DOI":"10.1007\/978-3-662-53357-4_18"},{"key":"key-10.1145\/3267973.3267979-26","unstructured":"Eizen Kimura, Koki Hamada, Ryo Kikuchi, Koji Chida, Kazuya Okamoto, Shirou Manabe, Tomohiro Kuroda, Yasushi Matsumura, Toshihiro Takeda, and Naoki Mihara. 2016. Evaluation of Secure Computation in a Distributed Healthcare Setting. In Exploring Complexity in Health: An Interdisciplinary Systems Approach - Proceedings of MIE2016 at HEC2016, Munich, Germany, 28 August - 2 September 2016. (Studies in Health Technology and Informatics), , Alexander Hö rbst, Werner O. Hackl, Nicolette de Keizer, Hans-Ulrich Prokosch, Mira Hercigonja-Szekeres, and Simon de Lusignan (Eds.), Vol. 228. IOS Press, 152--156. https:\/\/doi.org\/10.3233\/978--1--61499--678--1--152"},{"key":"key-10.1145\/3267973.3267979-27","unstructured":"Toomas Krips and Jan Willemson. 2014. Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations. In Information Security - 17th International Conference, ISC 2014, Hong Kong, China, October 12--14, 2014. Proceedings (Lecture Notes in Computer Science), Sherman S. M. Chow, Jan Camenisch, Lucas Chi Kwong Hui, and Siu-Ming Yiu (Eds.), Vol. 8783. Springer, 179--197. https:\/\/doi.org\/10.1007\/978--3--319--13257-0_11"},{"key":"key-10.1145\/3267973.3267979-28","unstructured":"Peeter Laud. 2014. A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation. In Information and Communications Security - 16th International Conference, ICICS 2014, Hong Kong, China, December 16--17, 2014, Revised Selected Papers (Lecture Notes in Computer Science), Lucas Chi Kwong Hui, S. H. Qing, Elaine Shi, and Siu-Ming Yiu (Eds.), Vol. 8958. Springer, 143--157. https:\/\/doi.org\/10.1007\/978--3--319--21966-0_11"},{"key":"key-10.1145\/3267973.3267979-29","doi-asserted-by":"crossref","unstructured":"Peeter Laud and Alisa Pankova. 2014. Verifiable Computation in Multiparty Protocols with Honest Majority. In Provable Security - 8th International Conference, ProvSec 2014. Proceedings (LNCS), Sherman S. M. Chow, Joseph K. Liu, Lucas Chi Kwong Hui, and Siu-Ming Yiu (Eds.), Vol. 8782. Springer, 146--161. https:\/\/doi.org\/10.1007\/978--3--319--12475--9_11","DOI":"10.1007\/978-3-319-12475-9_11"},{"key":"key-10.1145\/3267973.3267979-30","doi-asserted-by":"crossref","unstructured":"Peeter Laud, Alisa Pankova, and Roman Jagom\"a gis. 2017. Preprocessing Based Verification of Multiparty Protocols with Honest Majority. PoPETs , Vol. 2017, 4 (2017), 23--76. https:\/\/doi.org\/10.1515\/popets-2017-0038","DOI":"10.1515\/popets-2017-0038"},{"key":"key-10.1145\/3267973.3267979-31","unstructured":"Peeter Laud, Alisa Pankova, Liina Kamm, and Meilof Veeningen. 2015. Basic Constructions of Secure Multiparty Computation . In Applications of Secure Multiparty Computation, Peeter Laud and Liina Kamm (Eds.). Cryptology and Information Security Series, Vol. 13. IOS Press, 1--25."},{"key":"key-10.1145\/3267973.3267979-32","doi-asserted-by":"crossref","unstructured":"Peeter Laud and Jaak Randmets. 2015. A Domain-Specific Language for Low-Level Secure Multiparty Computation Protocols. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12--6, 2015 , , Indrajit Ray, Ninghui Li, and Christopher Kruegel (Eds.). ACM, 1492--1503. https:\/\/doi.org\/10.1145\/2810103.2813664","DOI":"10.1145\/2810103.2813664"},{"key":"key-10.1145\/3267973.3267979-33","unstructured":"Sven Laur, Riivo Talviste, and Jan Willemson. 2013. From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting. In Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Banff, AB, Canada, June 25--28, 2013. Proceedings (Lecture Notes in Computer Science), , Michael J. Jacobson Jr., Michael E. Locasto, Payman Mohassel, and Reihaneh Safavi-Naini (Eds.), Vol. 7954. Springer, 84--101. https:\/\/doi.org\/10.1007\/978--3--642--38980--1_6"},{"key":"key-10.1145\/3267973.3267979-34","doi-asserted-by":"crossref","unstructured":"Sven Laur, Jan Willemson, and Bingsheng Zhang. 2011. Round-Efficient Oblivious Database Manipulation . In Proceedings of the 14th International Conference on Information Security. ISC'11. 262--277.","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"key-10.1145\/3267973.3267979-35","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Ariel Nof. 2017. A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017, Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu (Eds.). ACM , 259--276. https:\/\/doi.org\/10.1145\/3133956.3133999","DOI":"10.1145\/3133956.3133999"},{"key":"key-10.1145\/3267973.3267979-36","unstructured":"Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation, See citeNDBLP:conf\/crypto\/2012, 681--700. https:\/\/doi.org\/10.1007\/978--3--642--32009--5_40"},{"key":"key-10.1145\/3267973.3267979-37","unstructured":"Takashi Nishide and Kazuo Ohta. 2007. Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In Public Key Cryptography - PKC 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16--20, 2007, Proceedings (Lecture Notes in Computer Science), , Tatsuaki Okamoto and Xiaoyun Wang (Eds.), Vol. 4450. Springer, 343--360. https:\/\/doi.org\/10.1007\/978--3--540--71677--8_23"},{"key":"key-10.1145\/3267973.3267979-38","doi-asserted-by":"crossref","unstructured":"Martin Pettai and Peeter Laud. 2015. Automatic Proofs of Privacy of Secure Multi-party Computation Protocols against Active Adversaries. In IEEE 28th Computer Security Foundations Symposium, CSF 2015, Verona, Italy, 13--17 July, 2015 , , Cé dric Fournet, Michael W. Hicks, and Luca Viganò (Eds.). IEEE, 75--89. https:\/\/doi.org\/10.1109\/CSF.2015.13","DOI":"10.1109\/CSF.2015.13"},{"key":"key-10.1145\/3267973.3267979-39","doi-asserted-by":"crossref","unstructured":"Reihaneh Safavi-Naini and Ran Canetti (Eds.). 2012. Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings. LNCS, Vol. 7417. Springer.","DOI":"10.1007\/978-3-642-32009-5"},{"key":"key-10.1145\/3267973.3267979-40","doi-asserted-by":"crossref","unstructured":"Bharath K. K. Samanthula, Hu Chun, and Wei Jiang. 2013. An Efficient and Probabilistic Secure Bit-decomposition. In Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security (ASIA CCS '13). ACM, New York, NY, USA, 541--546. https:\/\/doi.org\/10.1145\/2484313.2484386","DOI":"10.1145\/2484313.2484386"},{"key":"key-10.1145\/3267973.3267979-41","unstructured":"Thomas Schneider and Michael Zohner. 2013. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits. In Financial Cryptography and Data Security - 17th International Conference, FC 2013, Okinawa, Japan, April 1--5, 2013, Revised Selected Papers (Lecture Notes in Computer Science), , Ahmad-Reza Sadeghi (Ed.), Vol. 7859. Springer, 275--292. https:\/\/doi.org\/10.1007\/978--3--642--39884--1_23"},{"key":"key-10.1145\/3267973.3267979-42","doi-asserted-by":"crossref","unstructured":"Berry Schoenmakers and Pim Tuyls. 2006. Efficient Binary Conversion for Paillier Encrypted Values. In Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings (Lecture Notes in Computer Science), , Serge Vaudenay (Ed.), Vol. 4004. Springer, 522--537. https:\/\/doi.org\/10.1007\/11761679_31","DOI":"10.1007\/11761679_31"},{"key":"key-10.1145\/3267973.3267979-43","doi-asserted-by":"crossref","unstructured":"Adi Shamir. 1979. How to Share a Secret. Commun. ACM , Vol. 22, 11 (1979), 612--613.","DOI":"10.1145\/359168.359176"},{"key":"key-10.1145\/3267973.3267979-44","unstructured":"Tomas Toft. 2009. Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. In Topics in Cryptology - CT-RSA 2009, The Cryptographers' Track at the RSA Conference 2009, San Francisco, CA, USA, April 20--24, 2009. Proceedings (Lecture Notes in Computer Science), , Marc Fischlin (Ed.), Vol. 5473. Springer, 357--371. https:\/\/doi.org\/10.1007\/978--3--642-00862--7_24"},{"key":"key-10.1145\/3267973.3267979-45","unstructured":"Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). 2016. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24--28, 2016. ACM . http:\/\/dl.acm.org\/citation.cfm?id=2976749"}],"event":{"number":"6","sponsor":["SIGSAC, ACM Special Interest Group on Security, Audit, and Control"],"acronym":"WAHC '18","name":"the 6th Workshop","start":{"date-parts":[[2018,10,15]]},"location":"Toronto, Canada","end":{"date-parts":[[2018,10,19]]}},"container-title":["Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography - WAHC '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3267973.3267979","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3267979&ftid=2008845&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:18Z","timestamp":1750212438000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3267973.3267979"}},"subtitle":[],"proceedings-subject":"Encrypted Computing & Applied Homomorphic Cryptography","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1145\/3267973.3267979","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}