A New Paradigm for Server-Aided MPC
Authors
Alessandra Scafuro, Tanner Verber
Abstract
The server-aided model for multiparty computation (MPC) was introduced to capture a real-world scenario where clients wish to off-load the heavy computation of MPC protocols to dedicated servers. A rich body of work has studied various trade-offs between security guarantees (e.g., semi-honest vs malicious), trust assumptions (e.g., the threshold on corrupted servers), and efficiency.
However, all existing works make the assumption that all clients must agree on employing the same servers, and accept the same corruption threshold. In this paper, we challenge this assumption and introduce a new paradigm for server-aided MPC, where each client can choose their own set of servers and their own threshold of corrupted servers. In this new model, the privacy of each client is guaranteed as long as their own threshold is satisfied, regardless of the other servers/clients. We call this paradigm per-party private server-aided MPC to highlight both a security and efficiency guarantee: (1) per-party privacy, which means that each party gets their own privacy guarantees that depend on their own choice of the servers; (2) per-party complexity, which means that each party only needs to communicate with their chosen servers. Our primary contribution is a new theoretical framework for server-aided MPC. We provide two protocols to show feasibility, but leave it as a future work to investigate protocols that focus on concrete efficiency.
References
[AJJM20]
Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, and Giulio Malavolta. Multi-key Fully-Homomorphic Encryption in the Plain Model. In Rafael Pass and Krzysztof Pietrzak, editors, Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part I, volume 12550 of Lecture Notes in Computer Science, pages 28–57. 2020. Springer. DOI: 10.1007/978-3-030-64375-1_2
[AJL+12]
Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. In David Pointcheval and Thomas Johansson, editors, Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings, volume 7237 of Lecture Notes in Computer Science, pages 483–501. 2012. Springer. DOI: 10.1007/978-3-642-29011-4_29
[BCC+17]
Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, and Eran Tromer. The Hunting of the SNARK. J. Cryptol., 30(4):989–1066, 2017. DOI: 10.1007/S00145-016-9241-9
[BCPS20]
Megha Byali, Harsh Chaudhari, Arpita Patra, and Ajith Suresh. FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. Proc. Priv. Enhancing Technol., 2020(2):459–480, 2020. DOI: 10.2478/POPETS-2020-0036
[BEP23]
Alexander Bienstock, Daniel Escudero, and Antigoni Polychroniadou. On Linear Communication Complexity for (Maximally) Fluid MPC. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, volume 14081 of Lecture Notes in Computer Science, pages 263–294. 2023. Springer. DOI: 10.1007/978-3-031-38557-5_9
[BGW88]
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 1–10. 1988. ACM. DOI: 10.1145/62212.62213
[BLCW19]
Fabian Boemer, Yixing Lao, Rosario Cammarota, and Casimir Wierzynski. nGraph-HE: a graph compiler for deep learning on homomorphically encrypted data. In Francesca Palumbo, Michela Becchi, Martin Schulz, and Kento Sato, editors, Proceedings of the 16th ACM International Conference on Computing Frontiers, CF 2019, Alghero, Italy, April 30 - May 2, 2019, pages 3–13. 2019. ACM. DOI: 10.1145/3310273.3323047
[BMR90]
Donald Beaver, Silvio Micali, and Phillip Rogaway. The Round Complexity of Secure Protocols (Extended Abstract). In Harriet Ortiz, editor, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pages 503–513. 1990. ACM. DOI: 10.1145/100216.100287
[BPP+17]
Foteini Baldimtsi, Dimitrios Papadopoulos, Stavros Papadopoulos, Alessandra Scafuro, and Nikos Triandopoulos. Server-Aided Secure Computation with Off-line Parties. In Simon N. Foley, Dieter Gollmann, and Einar Snekkenes, editors, Computer Security - ESORICS 2017 - 22nd European Symposium on Research in Computer Security, Oslo, Norway, September 11-15, 2017, Proceedings, Part I, volume 10492 of Lecture Notes in Computer Science, pages 103–123. 2017. Springer. DOI: 10.1007/978-3-319-66402-6_8
[BR93]
Mihir Bellare and Phillip Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Dorothy E. Denning, Raymond Pyle, Ravi Ganesan, Ravi S. Sandhu, and Victoria Ashby, editors, CCS '93, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, November 3-5, 1993, pages 62–73. 1993. ACM. DOI: 10.1145/168588.168596
[BV14]
Zvika Brakerski and Vinod Vaikuntanathan. Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$. SIAM J. Comput., 43(2):831–871, 2014. DOI: 10.1137/120868669
[Can01]
Ran Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pages 136–145. 2001. IEEE Computer Society. DOI: 10.1109/SFCS.2001.959888
[CCH+19]
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, and Daniel Wichs. Fiat-Shamir: from practice to theory. In Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 1082–1090. 2019. ACM. DOI: 10.1145/3313276.3316380
[CCP22]
Anirudh Chandramouli, Ashish Choudhury, and Arpita Patra. A Survey on Perfectly Secure Verifiable Secret-sharing. ACM Comput. Surv., 54(11s):232:1–232:36, 2022. DOI: 10.1145/3512344
[CCPS19]
Harsh Chaudhari, Ashish Choudhury, Arpita Patra, and Ajith Suresh. ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. In Radu Sion and Charalampos Papamanthou, editors, Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, CCSW@CCS 2019, London, UK, November 11, 2019, pages 81–92. 2019. ACM. DOI: 10.1145/3338466.3358922
[CGG+21]
Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, and Gabriel Kaptchuk. Fluid MPC: Secure Multiparty Computation with Dynamic Participants. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II, volume 12826 of Lecture Notes in Computer Science, pages 94–123. 2021. Springer. DOI: 10.1007/978-3-030-84245-1_4
[CJJ21]
Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin. SNARGs for $\mathcal{P}$ from LWE. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 68–79. 2021. IEEE. DOI: 10.1109/FOCS52979.2021.00016
[CKKC13]
Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, and Carlos Cid. Multi-Client Non-interactive Verifiable Computation. In Amit Sahai, editor, Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings, volume 7785 of Lecture Notes in Computer Science, pages 499–518. 2013. Springer. DOI: 10.1007/978-3-642-36594-2_28
[CKL21]
Jung Hee Cheon, Dongwoo Kim, and Keewoo Lee. MHz2k: MPC from HE over $\mathbb {Z}_{2k}$ with New Packing, Simpler Reshare, and Better ZKP. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II, volume 12826 of Lecture Notes in Computer Science, pages 426–456. 2021. Springer. DOI: 10.1007/978-3-030-84245-1_15
[CMTB16]
Henry Carter, Benjamin Mood, Patrick Traynor, and Kevin R. B. Butler. Secure outsourced garbled circuit evaluation for mobile devices. J. Comput. Secur., 24(2):137–180, 2016. DOI: 10.3233/JCS-150540
[DDG+23]
Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, and Varun Narayanan. Perfect MPC over Layered Graphs. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, volume 14081 of Lecture Notes in Computer Science, pages 360–392. 2023. Springer. DOI: 10.1007/978-3-031-38557-5_12
[DEP23]
Ivan Damgård, Daniel Escudero, and Antigoni Polychroniadou. Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. In Kai-Min Chung, editor, 4th Conference on Information-Theoretic Cryptography, ITC 2023, June 6-8, 2023, Aarhus University, Aarhus, Denmark, volume 267 of LIPIcs, pages 7:1–7:21. 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. DOI: 10.4230/LIPICS.ITC.2023.7
[DI05]
Ivan Damgård and Yuval Ishai. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In Victor Shoup, editor, Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, volume 3621 of Lecture Notes in Computer Science, pages 378–394. 2005. Springer. DOI: 10.1007/11535218_23
[DPSZ12]
Ivan Damgård, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. Multiparty Computation from Somewhat Homomorphic Encryption. In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, volume 7417 of Lecture Notes in Computer Science, pages 643–662. 2012. Springer. DOI: 10.1007/978-3-642-32009-5_38
[FKN94]
Uriel Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In Frank Thomson Leighton and Michael T. Goodrich, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pages 554–563. 1994. ACM. DOI: 10.1145/195058.195408
[Gen09]
Craig Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, USA, 2009.
[GGJS11]
Sanjam Garg, Vipul Goyal, Abhishek Jain, and Amit Sahai. Bringing People of Different Beliefs Together to Do UC. In Yuval Ishai, editor, Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings, volume 6597 of Lecture Notes in Computer Science, pages 311–328. 2011. Springer. DOI: 10.1007/978-3-642-19571-6_19
[GHK+21]
Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, and Sophia Yakoubov. YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II, volume 12826 of Lecture Notes in Computer Science, pages 64–93. 2021. Springer. DOI: 10.1007/978-3-030-84245-1_3
[GJM+23]
Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, and Yinuo Zhang. Cryptography with Weights: MPC, Encryption and Signatures. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, volume 14081 of Lecture Notes in Computer Science, pages 295–327. 2023. Springer. DOI: 10.1007/978-3-031-38557-5_10
[GLO+21]
Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, and Yifan Song. ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II, volume 12826 of Lecture Notes in Computer Science, pages 244–274. 2021. Springer. DOI: 10.1007/978-3-030-84245-1_9
[GMW87]
Oded Goldreich, Silvio Micali, and Avi Wigderson. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Alfred V. Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pages 218–229. 1987. ACM. DOI: 10.1145/28395.28420
[GO14]
Jens Groth and Rafail Ostrovsky. Cryptography in the Multi-string Model. J. Cryptol., 27(3):506–543, 2014. DOI: 10.1007/S00145-013-9152-Y
[HJKS22]
James Hulett, Ruta Jawale, Dakshita Khurana, and Akshayaram Srinivasan. SNARGs for P from Sub-exponential DDH and QR. In Orr Dunkelman and Stefan Dziembowski, editors, Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part II, volume 13276 of Lecture Notes in Computer Science, pages 520–549. 2022. Springer. DOI: 10.1007/978-3-031-07085-3_18
[HLP11]
Shai Halevi, Yehuda Lindell, and Benny Pinkas. Secure Computation on the Web: Computing without Simultaneous Interaction. In Phillip Rogaway, editor, Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings, volume 6841 of Lecture Notes in Computer Science, pages 132–150. 2011. Springer. DOI: 10.1007/978-3-642-22792-9_8
[JKKZ21]
Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, and Rachel Yun Zhang. SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 708–721. 2021. ACM. DOI: 10.1145/3406325.3451055
[JNO14]
Thomas P. Jakobsen, Jesper Buus Nielsen, and Claudio Orlandi. A Framework for Outsourcing of Secure Computation. In Gail-Joon Ahn, Alina Oprea, and Reihaneh Safavi-Naini, editors, Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14, Scottsdale, Arizona, USA, November 7, 2014, pages 81–92. 2014. ACM. DOI: 10.1145/2664168.2664170
[Kat07]
Jonathan Katz. Universally Composable Multi-party Computation Using Tamper-Proof Hardware. In Moni Naor, editor, Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, volume 4515 of Lecture Notes in Computer Science, pages 115–128. 2007. Springer. DOI: 10.1007/978-3-540-72540-4_7
[KL14]
Jonathan Katz and Yehuda Lindell. Introduction to Modern Cryptography, Second Edition. CRC Press 2014.
[KMR11]
Seny Kamara, Payman Mohassel, and Mariana Raykova. Outsourcing Multi-Party Computation. IACR Cryptol. ePrint Arch., 2011.
[KMR12]
Seny Kamara, Payman Mohassel, and Ben Riva. Salus: a system for server-aided secure function evaluation. In Ting Yu, George Danezis, and Virgil D. Gligor, editors, the ACM Conference on Computer and Communications Security, CCS'12, Raleigh, NC, USA, October 16-18, 2012, pages 797–808. 2012. ACM. DOI: 10.1145/2382196.2382280
[KPPS21]
Nishat Koti, Mahak Pancholi, Arpita Patra, and Ajith Suresh. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In Michael D. Bailey and Rachel Greenstadt, editors, 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, pages 2651–2668. 2021. USENIX Association.
[KPY19]
Yael Tauman Kalai, Omer Paneth, and Lisa Yang. How to delegate computations publicly. In Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 1115–1124. 2019. ACM. DOI: 10.1145/3313276.3316411
[Lin17]
Yehuda Lindell. How to Simulate It - A Tutorial on the Simulation Proof Technique. In Yehuda Lindell, editor, Tutorials on the Foundations of Cryptography, pages 277–346. Springer International Publishing 2017. DOI: 10.1007/978-3-319-57048-8_6
[LTV12]
Adriana López-Alt, Eran Tromer, and Vinod Vaikuntanathan. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Howard J. Karloff and Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pages 1219–1234. 2012. ACM. DOI: 10.1145/2213977.2214086
[MGBF14]
Benjamin Mood, Debayan Gupta, Kevin R. B. Butler, and Joan Feigenbaum. Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3-7, 2014, pages 582–596. 2014. ACM. DOI: 10.1145/2660267.2660285
[Mic94]
Silvio Micali. CS Proofs (Extended Abstracts). In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 436–453. 1994. IEEE Computer Society. DOI: 10.1109/SFCS.1994.365746
[MOR16]
Payman Mohassel, Ostap Orobets, and Ben Riva. Efficient Server-Aided 2PC for Mobile Phones. Proc. Priv. Enhancing Technol., 2016(2):82–99, 2016. DOI: 10.1515/POPETS-2016-0006
[MR18]
Payman Mohassel and Peter Rindal. ABY\({}^{\mbox{3}}\): A Mixed Protocol Framework for Machine Learning. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pages 35–52. 2018. ACM. DOI: 10.1145/3243734.3243760
[MTZC21]
Jack P. K. Ma, Raymond K. H. Tai, Yongjun Zhao, and Sherman S. M. Chow. Let's Stride Blindfolded in a Forest: Sublinear Multi-Client Decision Trees Evaluation. In 28th Annual Network and Distributed System Security Symposium, NDSS 2021, virtually, February 21-25, 2021. 2021. The Internet Society.
[MZ17]
Payman Mohassel and Yupeng Zhang. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017, pages 19–38. 2017. IEEE Computer Society. DOI: 10.1109/SP.2017.12
[PS20]
Arpita Patra and Ajith Suresh. BLAZE: Blazing Fast Privacy-Preserving Machine Learning. In 27th Annual Network and Distributed System Security Symposium, NDSS 2020, San Diego, California, USA, February 23-26, 2020. 2020. The Internet Society.
[RS22]
Rahul Rachuri and Peter Scholl. Le Mans: Dynamic and Fluid MPC for Dishonest Majority. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I, volume 13507 of Lecture Notes in Computer Science, pages 719–749. 2022. Springer. DOI: 10.1007/978-3-031-15802-5_25
[SH21]
Jaskaran V. Singh and Nicholas Hopper. Grades of Trust in Multiparty Computation. IACR Cryptol. ePrint Arch., 2021.
[TKTW21]
Sijun Tan, Brian Knott, Yuan Tian, and David J. Wu. CryptGPU: Fast Privacy-Preserving Machine Learning on the GPU. In 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24-27 May 2021, pages 1021–1038. 2021. IEEE. DOI: 10.1109/SP40001.2021.00098
[WGC19]
Sameer Wagh, Divya Gupta, and Nishanth Chandran. SecureNN: 3-Party Secure Computation for Neural Network Training. Proc. Priv. Enhancing Technol., 2019(3):26–49, 2019. DOI: 10.2478/POPETS-2019-0035
[Yao86]
Andrew Chi-Chih Yao. How to Generate and Exchange Secrets (Extended Abstract). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pages 162–167. 1986. IEEE Computer Society. DOI: 10.1109/SFCS.1986.25
PDF
History
Submitted: 2024-07-09
Accepted: 2024-12-03
Published: 2025-01-13
Accepted: 2024-12-03
Published: 2025-01-13
How to cite
Alessandra Scafuro and Tanner Verber, A New Paradigm for Server-Aided MPC. IACR Communications in Cryptology, vol. 1, no. 4, Jan 13, 2025, doi: 10.62056/ab3wa0l5vt.
License
Copyright is held by the author(s)
This work is licensed under a Creative Commons Attribution (CC BY) license.