{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T10:44:42Z","timestamp":1785926682313,"version":"3.56.0"},"reference-count":147,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Privacy-preserving computation (PPC) solutions, such as secure multiparty computation (MPC) and homomorphic encryption (HE), are deployed increasingly often to guarantee data confidentiality for computations over private, distributed data. Similarly, we observe a steep increase in the adoption of zeroknowledge proofs (ZKPs) to guarantee (public) verifiability of locally executed computations. We project that applications that are data intensive and require strong privacy guarantees, are also likely to require verifiable correctness guarantees, especially when they are outsourced. Combining methods for verifiability and privacy protection has clear benefits, however certain challenges stand before their widespread practical adoption. In this work, we analyze existing solutions that combine verifiability with privacy-preserving computations over distributed data, in order to preserve confidentiality and guarantee correctness at the same time. We classify and compare 41 different schemes, regarding solution approach, security, efficiency, and practicality. Lastly, we discuss some of the most promising solutions in this regard, and present various open challenges and directions for future research.<\/jats:p>","DOI":"10.1007\/s10207-025-01047-7","type":"journal-article","created":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T15:37:19Z","timestamp":1748101039000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Verifiability for privacy-preserving computing on distributed data \u2014 a survey"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5331-4033","authenticated-orcid":false,"given":"Tariq","family":"Bontekoe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8827-2590","authenticated-orcid":false,"given":"Dimka","family":"Karastoyanova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6262-4869","authenticated-orcid":false,"given":"Fatih","family":"Turkmen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,24]]},"reference":[{"key":"1047_CR1","doi-asserted-by":"publisher","unstructured":"Abadi, A., Terzis, S., Dong, C.: VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets. In: J.\u00a0Grossklags, B.\u00a0Preneel (eds.) Financial Cryptography and Data Security, Lecture Notes in Computer Science, pp. 149\u2013168. Springer, Berlin, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_9","DOI":"10.1007\/978-3-662-54970-4_9"},{"key":"1047_CR2","doi-asserted-by":"publisher","unstructured":"Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep Learning with Differential Privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, pp. 308\u2013318. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2976749.2978318","DOI":"10.1145\/2976749.2978318"},{"key":"1047_CR3","doi-asserted-by":"publisher","first-page":"e12,130","DOI":"10.7717\/peerj.12130","volume":"9","author":"B Adanur Dedeturk","year":"2021","unstructured":"Adanur Dedeturk, B., Soran, A., Bakir-Gungor, B.: Blockchain for genomics and healthcare: A literature review, current status, classification and open issues. PeerJ 9, e12,130 (2021). https:\/\/doi.org\/10.7717\/peerj.12130","journal-title":"PeerJ"},{"key":"1047_CR4","doi-asserted-by":"publisher","first-page":"113,436","DOI":"10.1109\/ACCESS.2022.3216643","volume":"10","author":"MR Ahmed","year":"2022","unstructured":"Ahmed, M.R., Islam, A.K.M.M., Shatabda, S., Islam, S.: Blockchain-Based Identity Management System and Self-Sovereign Identity Ecosystem: A Comprehensive Survey. IEEE Access 10, 113,436-113,481 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3216643","journal-title":"IEEE Access"},{"issue":"2","key":"1047_CR5","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/3563044","volume":"1","author":"M Alghazwi","year":"2022","unstructured":"Alghazwi, M., Turkmen, F., Van Der Velde, J., Karastoyanova, D.: Blockchain for Genomics: A Systematic Literature Review. Distributed Ledger Technologies: Research and Practice 1(2), 11:1-11:28 (2022). https:\/\/doi.org\/10.1145\/3563044","journal-title":"Distributed Ledger Technologies: Research and Practice"},{"key":"1047_CR6","doi-asserted-by":"publisher","first-page":"101,502","DOI":"10.1016\/j.cose.2019.03.023","volume":"88","author":"R Alvarez","year":"2020","unstructured":"Alvarez, R., Nojoumian, M.: Comprehensive survey on privacy-preserving protocols for sealed-bid auctions. Computers & Security 88, 101,502 (2020). https:\/\/doi.org\/10.1016\/j.cose.2019.03.023","journal-title":"Computers & Security"},{"key":"1047_CR7","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Jakobsson, M., Lipmaa, H.: Cryptographic Randomized Response Techniques. In: F.\u00a0Bao, R.\u00a0Deng, J.\u00a0Zhou (eds.) Public Key Cryptography \u2013 PKC 2004, Lecture Notes in Computer Science, pp. 425\u2013438. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24632-9_31","DOI":"10.1007\/978-3-540-24632-9_31"},{"key":"1047_CR8","unstructured":"AMD: AMD Secure Encrypted Virtualization (2023). https:\/\/www.amd.com\/en\/processors\/amd-secure-encrypted-virtualization"},{"key":"1047_CR9","unstructured":"Anthoine, G., Dumas, J.G., de Jonghe, M., Maignan, A., Pernet, C., Hanling, M., Roche, D.S.: Dynamic proofs of retrievability with low server storage. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 537\u2013554. USENIX Association, Virtual (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/anthoine"},{"key":"1047_CR10","unstructured":"Armknecht, F., Boyd, C., Carr, C., Gj\u00f8steen, K., J\u00e4schke, A., Reuter, C.A., Strand, M.: A Guide to Fully Homomorphic Encryption (2015). https:\/\/eprint.iacr.org\/2015\/1192"},{"key":"1047_CR11","doi-asserted-by":"publisher","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. In: D.\u00a0Pointcheval, T.\u00a0Johansson (eds.) Advances in Cryptology \u2013 EUROCRYPT 2012, Lecture Notes in Computer Science, pp. 483\u2013501. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"1047_CR12","doi-asserted-by":"publisher","unstructured":"Asharov, G., Orlandi, C.: Calling Out Cheaters: Covert Security with Public Verifiability. In: X.\u00a0Wang, K.\u00a0Sako (eds.) Advances in Cryptology \u2013 ASIACRYPT 2012, Lecture Notes in Computer Science, pp. 681\u2013698. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_41","DOI":"10.1007\/978-3-642-34961-4_41"},{"key":"1047_CR13","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R.: Compressed $$\\Sigma $$-Protocol Theory and\u00a0Practical Application\u00a0to\u00a0Plug\u00a0 &\u00a0Play Secure Algorithmics. In: D.\u00a0Micciancio, T.\u00a0Ristenpart (eds.) Advances in Cryptology \u2013 CRYPTO 2020, Lecture Notes in Computer Science, pp. 513\u2013543. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"1047_CR14","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Kohl, L.: A Compressed $$\\sigma $$-Protocol Theory for Lattices. In: Advances in Cryptology \u2013 CRYPTO 2021, pp. 549\u2013579. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"1047_CR15","doi-asserted-by":"publisher","unstructured":"B., A., S., S.: A survey on genomic data by privacy-preserving techniques perspective. Computational Biology and Chemistry 93, 107,538 (2021). https:\/\/doi.org\/10.1016\/j.compbiolchem.2021.107538","DOI":"10.1016\/j.compbiolchem.2021.107538"},{"key":"1047_CR16","doi-asserted-by":"crossref","unstructured":"Backes, M., Barbosa, M., Fiore, D., Reischuk, R.M.: ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data (2014). https:\/\/eprint.iacr.org\/2014\/617","DOI":"10.1109\/SP.2015.24"},{"key":"1047_CR17","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Sahai, A.: Verifiable Functional Encryption. In: Advances in Cryptology \u2013 ASIACRYPT 2016, pp. 557\u2013587. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_19","DOI":"10.1007\/978-3-662-53890-6_19"},{"key":"1047_CR18","doi-asserted-by":"publisher","unstructured":"Bahmani, R., Barbosa, M., Brasser, F., Portela, B., Sadeghi, A.R., Scerri, G., Warinschi, B.: Secure Multiparty Computation from SGX. In: Financial Cryptography and Data Security: 21st International Conference, FC 2017, Sliema, Malta, April 3\u20137, 2017, Revised Selected Papers, pp. 477\u2013497. Springer-Verlag, Berlin, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_27","DOI":"10.1007\/978-3-319-70972-7_27"},{"key":"1047_CR19","doi-asserted-by":"publisher","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Crowd Verifiable Zero-Knowledge and\u00a0End-to-End Verifiable Multiparty Computation. In: S.\u00a0Moriai, H.\u00a0Wang (eds.) Advances in Cryptology \u2013 ASIACRYPT 2020, Lecture Notes in Computer Science, pp. 717\u2013748. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_24","DOI":"10.1007\/978-3-030-64840-4_24"},{"key":"1047_CR20","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Garg, S., Masny, D., Mukherjee, P.: Reusable Two-Round MPC from DDH. In: R.\u00a0Pass, K.\u00a0Pietrzak (eds.) Theory of Cryptography, Lecture Notes in Computer Science, pp. 320\u2013348. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_12","DOI":"10.1007\/978-3-030-64378-2_12"},{"key":"1047_CR21","unstructured":"Baum, C., Chiang, J.H.y., David, B., Frederiksen, T.K.: SoK: Privacy-Enhancing Technologies in Finance (2023). https:\/\/eprint.iacr.org\/2023\/122"},{"key":"1047_CR22","doi-asserted-by":"publisher","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More Efficient Commitments from Structured Lattice Assumptions. In: Security and Cryptography for Networks, pp. 368\u2013385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"1047_CR23","doi-asserted-by":"publisher","unstructured":"Baum, C., Damg\u00e5rd, I., Orlandi, C.: Publicly Auditable Secure Multi-Party Computation. In: M.\u00a0Abdalla, R.\u00a0De\u00a0Prisco (eds.) Security and Cryptography for Networks, Lecture Notes in Computer Science, pp. 175\u2013196. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_11","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"1047_CR24","doi-asserted-by":"publisher","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. In: D.\u00a0Micciancio, T.\u00a0Ristenpart (eds.) Advances in Cryptology \u2013 CRYPTO 2020, Lecture Notes in Computer Science, pp. 562\u2013592. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_20","DOI":"10.1007\/978-3-030-56880-1_20"},{"key":"1047_CR25","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient Multiparty Protocols Using Circuit Randomization. In: J.\u00a0Feigenbaum (ed.) Advances in Cryptology \u2014 CRYPTO \u201991, Lecture Notes in Computer Science, pp. 420\u2013432. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"1047_CR26","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The Round Complexity of Secure Protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC \u201990, pp. 503\u2013513. Association for Computing Machinery, New York, NY, USA (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"1047_CR27","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS \u201912, pp. 784\u2013796. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"1047_CR28","doi-asserted-by":"publisher","unstructured":"Ben-Efraim, A.: On Multiparty Garbling of Arithmetic Circuits. In: Advances in Cryptology \u2013 ASIACRYPT 2018: 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2\u20136, 2018, Proceedings, Part III, pp. 3\u201333. Springer-Verlag, Berlin, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_1","DOI":"10.1007\/978-3-030-03332-3_1"},{"key":"1047_CR29","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: Decentralized Anonymous Payments from Bitcoin (2014). https:\/\/eprint.iacr.org\/2014\/349","DOI":"10.1109\/SP.2014.36"},{"key":"1047_CR30","doi-asserted-by":"publisher","first-page":"164,908","DOI":"10.1109\/ACCESS.2019.2950872","volume":"7","author":"J Bernal Bernabe","year":"2019","unstructured":"Bernal Bernabe, J., Canovas, J.L., Hernandez-Ramos, J.L., Torres Moreno, R., Skarmeta, A.: Privacy-Preserving Solutions for Blockchain: Review and Challenges. IEEE Access 7, 164,908-164,940 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2950872","journal-title":"IEEE Access"},{"key":"1047_CR31","unstructured":"Bernstein, D.J.: Pippenger\u2019s Exponentiation Algorithm (2002). https:\/\/cr.yp.to\/papers\/pippenger-20020118-retypeset20220327.pdf. Unpublished manuscript"},{"key":"1047_CR32","doi-asserted-by":"publisher","unstructured":"Biswas, A., Cormode, G.: Verifiable Differential Privacy (2023). https:\/\/doi.org\/10.48550\/arXiv.2208.09011","DOI":"10.48550\/arXiv.2208.09011"},{"key":"1047_CR33","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 111\u2013120. ACM, Palo Alto California USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"1047_CR34","doi-asserted-by":"publisher","unstructured":"Bittau, A., Erlingsson, \u00da., Maniatis, P., Mironov, I., Raghunathan, A., Lie, D., Rudominer, M., Kode, U., Tinnes, J., Seefeld, B.: Prochlo: Strong Privacy for Analytics in the Crowd. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP \u201917, pp. 441\u2013459. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3132747.3132769","DOI":"10.1145\/3132747.3132769"},{"key":"1047_CR35","doi-asserted-by":"publisher","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, pp. 103\u2013112. Association for Computing Machinery, New York, NY, USA (1988). https:\/\/doi.org\/10.1145\/62212.62222","DOI":"10.1145\/62212.62222"},{"key":"1047_CR36","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and Efficient Verifiable Computation on Encrypted Data (2020). https:\/\/eprint.iacr.org\/2020\/1526"},{"key":"1047_CR37","doi-asserted-by":"publisher","unstructured":"Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H.B., Patel, S., Ramage, D., Segal, A., Seth, K.: Practical Secure Aggregation for Privacy-Preserving Machine Learning. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201917, pp. 1175\u20131191. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3133982","DOI":"10.1145\/3133956.3133982"},{"key":"1047_CR38","doi-asserted-by":"publisher","unstructured":"Bontekoe, T., Everts, M., Peter, A.: Balancing privacy and accountability in digital payment methods using zk-SNARKs. In: 2022 19th Annual International Conference on Privacy, Security & Trust (PST), pp. 1\u201310. IEEE, Fredericton, NB, Canada (2022). https:\/\/doi.org\/10.1109\/PST55820.2022.9851987","DOI":"10.1109\/PST55820.2022.9851987"},{"key":"1047_CR39","doi-asserted-by":"publisher","unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: Enabling Decentralized Private Computation. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 947\u2013964. IEEE, San Francisco, CA, USA (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00050","DOI":"10.1109\/SP40000.2020.00050"},{"key":"1047_CR40","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Agrawal, S., Zamani, M., Boneh, D.: Zether: Towards Privacy in a Smart Contract World. In: J.\u00a0Bonneau, N.\u00a0Heninger (eds.) Financial Cryptography and Data Security, Lecture Notes in Computer Science, pp. 423\u2013443. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23","DOI":"10.1007\/978-3-030-51280-4_23"},{"key":"1047_CR41","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short Proofs for Confidential Transactions and More. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 315\u2013334. IEEE, San Francisco, CA, USA (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"1047_CR42","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201919, pp. 2075\u20132092. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"1047_CR43","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Practical Homomorphic MACs for Arithmetic Circuits. In: T.\u00a0Johansson, P.Q. Nguyen (eds.) Advances in Cryptology \u2013 EUROCRYPT 2013, Lecture Notes in Computer Science, pp. 336\u2013352. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_21","DOI":"10.1007\/978-3-642-38348-9_21"},{"issue":"12","key":"1047_CR44","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.14778\/2994509.2994528","volume":"9","author":"Z Chang","year":"2016","unstructured":"Chang, Z., Xie, D., Li, F.: A dissection and experimental evaluation. Proceedings of the VLDB Endowment 9(12), 1113\u20131124 (2016). https:\/\/doi.org\/10.14778\/2994509.2994528","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1047_CR45","doi-asserted-by":"publisher","unstructured":"Chatel, S., Knabenhans, C., Pyrgelis, A., Hubaux, J.P.: Verifiable Encodings for Secure Homomorphic Analytics (2022). https:\/\/doi.org\/10.48550\/arXiv.2207.14071","DOI":"10.48550\/arXiv.2207.14071"},{"issue":"1","key":"1047_CR46","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSECP.2004.1264852","volume":"2","author":"D Chaum","year":"2004","unstructured":"Chaum, D.: Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy 2(1), 38\u201347 (2004). https:\/\/doi.org\/10.1109\/MSECP.2004.1264852","journal-title":"IEEE Security & Privacy"},{"key":"1047_CR47","first-page":"26","volume":"26","author":"J Chen","year":"2021","unstructured":"Chen, J., Wang, W.H., Shi, X.: Differential Privacy Protection Against Membership Inference Attack on Machine Learning for Genomic Data. Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing 26, 26\u201337 (2021)","journal-title":"Pacific Symposium on Biocomputing"},{"key":"1047_CR48","doi-asserted-by":"publisher","unstructured":"Cheng, R., Zhang, F., Kos, J., He, W., Hynes, N., Johnson, N., Juels, A., Miller, A., Song, D.: Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts. In: 2019 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 185\u2013200. IEEE, Stockholm, Sweden (2019). https:\/\/doi.org\/10.1109\/EuroSP.2019.00023","DOI":"10.1109\/EuroSP.2019.00023"},{"key":"1047_CR49","doi-asserted-by":"publisher","unstructured":"Cheu, A., Smith, A., Ullman, J.: Manipulation Attacks in Local Differential Privacy. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 883\u2013900. IEEE, San Francisco, CA, USA (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00001","DOI":"10.1109\/SP40001.2021.00001"},{"key":"1047_CR50","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In: A.\u00a0Canteaut, Y.\u00a0Ishai (eds.) Advances in Cryptology \u2013 EUROCRYPT 2020, Lecture Notes in Computer Science, pp. 738\u2013768. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"1047_CR51","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In: A.\u00a0Canteaut, Y.\u00a0Ishai (eds.) Advances in Cryptology \u2013 EUROCRYPT 2020, Lecture Notes in Computer Science, pp. 769\u2013793. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27","DOI":"10.1007\/978-3-030-45721-1_27"},{"issue":"1","key":"1047_CR52","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: Fast Fully Homomorphic Encryption Over the Torus. Journal of Cryptology 33(1), 34\u201391 (2020). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"Journal of Cryptology"},{"key":"1047_CR53","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Green, M., Jain, A., Kaptchuk, G., Miers, I.: Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201917, pp. 719\u2013728. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134092","DOI":"10.1145\/3133956.3134092"},{"key":"1047_CR54","doi-asserted-by":"publisher","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), pp. 372\u2013382. IEEE, Portland, OR, USA (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.2","DOI":"10.1109\/SFCS.1985.2"},{"key":"1047_CR55","unstructured":"Computer Security\u00a0Division, I.T.L.: Post-Quantum Cryptography (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"1047_CR56","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: SPD$$\\mathbb{Z}_{2^k}$$ : Efficient MPC mod $$2^k$$ for Dishonest Majority. In: Advances in Cryptology \u2013 CRYPTO 2018, pp. 769\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"1047_CR57","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. In: B.\u00a0Pfitzmann (ed.) Advances in Cryptology \u2014 EUROCRYPT 2001, Lecture Notes in Computer Science, pp. 280\u2013300. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18","DOI":"10.1007\/3-540-44987-6_18"},{"key":"1047_CR58","doi-asserted-by":"crossref","unstructured":"Cunningham, R., Fuller, B., Yakoubov, S.: Catching MPC Cheaters: Identification and Openability (2016). https:\/\/eprint.iacr.org\/2016\/611","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"1047_CR59","doi-asserted-by":"publisher","unstructured":"Cuvelier, \u00c9., Pereira, O.: Verifiable Multi-party Computation with Perfectly Private Audit Trail. In: M.\u00a0Manulis, A.R. Sadeghi, S.\u00a0Schneider (eds.) Applied Cryptography and Network Security, Lecture Notes in Computer Science, pp. 367\u2013385. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_20","DOI":"10.1007\/978-3-319-39555-5_20"},{"key":"1047_CR60","doi-asserted-by":"publisher","unstructured":"Dahl, M., Ning, C., Toft, T.: On Secure Two-Party Integer Division. In: A.D. Keromytis (ed.) Financial Cryptography and Data Security, Lecture Notes in Computer Science, pp. 164\u2013178. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_13","DOI":"10.1007\/978-3-642-32946-3_13"},{"key":"1047_CR61","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty Computation from Somewhat Homomorphic Encryption. In: R.\u00a0Safavi-Naini, R.\u00a0Canetti (eds.) Advances in Cryptology \u2013 CRYPTO 2012, Lecture Notes in Computer Science, pp. 643\u2013662. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"1047_CR62","doi-asserted-by":"publisher","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In: Proceedings 2015 Network and Distributed System Security Symposium, pp. 1\u201315. Internet Society, San Diego, CA (2015). https:\/\/doi.org\/10.14722\/ndss.2015.23113","DOI":"10.14722\/ndss.2015.23113"},{"key":"1047_CR63","unstructured":"Dutta, M., Ganesh, C., Patranabis, S., Singh, N.: Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs (2022). https:\/\/eprint.iacr.org\/2022\/1648"},{"key":"1047_CR64","doi-asserted-by":"publisher","unstructured":"Dwork, C.: Differential Privacy. In: M.\u00a0Bugliesi, B.\u00a0Preneel, V.\u00a0Sassone, I.\u00a0Wegener (eds.) Automata, Languages and Programming, Lecture Notes in Computer Science, pp. 1\u201312. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1","DOI":"10.1007\/11787006_1"},{"key":"1047_CR65","unstructured":"Enarx: Enarx | Confidential Computing with WebAssembly (2023). https:\/\/enarx.dev\/"},{"key":"1047_CR66","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How To Prove Yourself: Practical Solutions to Identification and Signature Problems. In: A.M. Odlyzko (ed.) Advances in Cryptology \u2014 CRYPTO\u2019 86, Lecture Notes in Computer Science, pp. 186\u2013194. Springer, Berlin, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1047_CR67","doi-asserted-by":"publisher","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently Verifiable Computation on Encrypted Data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201914, pp. 844\u2013855. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2660267.2660366","DOI":"10.1145\/2660267.2660366"},{"key":"1047_CR68","doi-asserted-by":"publisher","unstructured":"Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting Verifiable Computation on\u00a0Encrypted Data. In: A.\u00a0Kiayias, M.\u00a0Kohlweiss, P.\u00a0Wallden, V.\u00a0Zikas (eds.) Public-Key Cryptography \u2013 PKC 2020, Lecture Notes in Computer Science, pp. 124\u2013154. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_5","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"1047_CR69","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: SNARKs for Ring Arithmetic (2021). https:\/\/eprint.iacr.org\/2021\/322"},{"key":"1047_CR70","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. In: T.\u00a0Rabin (ed.) Advances in Cryptology \u2013 CRYPTO 2010, Lecture Notes in Computer Science, pp. 465\u2013482. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"1047_CR71","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic Span Programs and Succinct NIZKs without PCPs. In: T.\u00a0Johansson, P.Q. Nguyen (eds.) Advances in Cryptology \u2013 EUROCRYPT 2013, Lecture Notes in Computer Science, pp. 626\u2013645. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"1047_CR72","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Wichs, D.: Fully Homomorphic Message Authenticators. In: K.\u00a0Sako, P.\u00a0Sarkar (eds.) Advances in Cryptology - ASIACRYPT 2013, Lecture Notes in Computer Science, pp. 301\u2013320. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_16","DOI":"10.1007\/978-3-642-42045-0_16"},{"key":"1047_CR73","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC \u201909, pp. 169\u2013178. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"1047_CR74","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Gordon, S.D., Goyal, V., Jain, A., Katz, J., Liu, F.H., Sahai, A., Shi, E., Zhou, H.S.: Multi-input Functional Encryption. In: Advances in Cryptology \u2013 EUROCRYPT 2014, pp. 578\u2013602. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32","DOI":"10.1007\/978-3-642-55220-5_32"},{"issue":"1","key":"1047_CR75","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing 18(1), 186\u2013208 (1989). https:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM Journal on Computing"},{"key":"1047_CR76","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: Linear-Time and\u00a0Field-Agnostic SNARKs for\u00a0R1CS. In: Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, Proceedings, Part II, pp. 193\u2013226. Springer-Verlag, Berlin, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"1047_CR77","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the Size of Pairing-Based Non-interactive Arguments. In: M.\u00a0Fischlin, J.S. Coron (eds.) Advances in Cryptology \u2013 EUROCRYPT 2016, Lecture Notes in Computer Science, pp. 305\u2013326. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"1047_CR78","doi-asserted-by":"publisher","unstructured":"Harth-Kitzerow, C., Carle, G., Fei, F., Luckow, A., Klepsch, J.: CRGC \u2013 A Practical Framework for Constructing Reusable Garbled Circuits (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.12646","DOI":"10.48550\/arXiv.2203.12646"},{"key":"1047_CR79","doi-asserted-by":"publisher","unstructured":"Hoang, T., Behnia, R., Jang, Y., Yavuz, A.A.: MOSE: Practical Multi-User Oblivious Storage via Secure Enclaves. In: Proceedings of the Tenth ACM Conference on Data and Application Security and Privacy, CODASPY \u201920, pp. 17\u201328. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3374664.3375749","DOI":"10.1145\/3374664.3375749"},{"key":"1047_CR80","doi-asserted-by":"publisher","unstructured":"Hoogh S.J.A., d.: Design of large scale applications of secure multiparty computation : Secure linear programming. Phd Thesis 1 (Research TU\/e \/ Graduation TU\/e), Technische Universiteit Eindhoven, Eindhoven (2012). https:\/\/doi.org\/10.6100\/IR735328","DOI":"10.6100\/IR735328"},{"key":"1047_CR81","unstructured":"Intel: Intel\u00ae Software Guard Extensions (Intel\u00ae SGX) (2023). https:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/software-guard-extensions.html"},{"key":"1047_CR82","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending Oblivious Transfers Efficiently. In: D.\u00a0Boneh (ed.) Advances in Cryptology - CRYPTO 2003, Lecture Notes in Computer Science, pp. 145\u2013161. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"1047_CR83","unstructured":"Jain, A., Rasmussen, P.M.R., Sahai, A.: Threshold Fully Homomorphic Encryption (2017). https:\/\/eprint.iacr.org\/2017\/257"},{"key":"1047_CR84","doi-asserted-by":"publisher","unstructured":"Jakobsen, T.P., Nielsen, J.B., Orlandi, C.: A Framework for Outsourcing of Secure Computation. In: Proceedings of the 6th Edition of the ACM Workshop on Cloud Computing Security, CCSW \u201914, pp. 81\u201392. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2664168.2664170","DOI":"10.1145\/2664168.2664170"},{"key":"1047_CR85","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.ins.2021.05.077","volume":"576","author":"C Jiang","year":"2021","unstructured":"Jiang, C., Xu, C., Zhang, Y.: PFLM: Privacy-preserving federated learning with membership proof. Information Sciences 576, 288\u2013311 (2021). https:\/\/doi.org\/10.1016\/j.ins.2021.05.077","journal-title":"Information Sciences"},{"issue":"7909","key":"1047_CR86","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1038\/s41586-022-04623-2","volume":"605","author":"D Joseph","year":"2022","unstructured":"Joseph, D., Misoczki, R., Manzano, M., Tricot, J., Pinuaga, F.D., Lacombe, O., Leichenauer, S., Hidary, J., Venables, P., Hansen, R.: Transitioning organizations to post-quantum cryptography. Nature 605(7909), 237\u2013243 (2022). https:\/\/doi.org\/10.1038\/s41586-022-04623-2","journal-title":"Nature"},{"key":"1047_CR87","doi-asserted-by":"publisher","unstructured":"Kanjalkar, S., Zhang, Y., Gandlur, S., Miller, A.: Publicly Auditable MPC-as-a-Service with succinct verification and universal setup. In: 2021 IEEE European Symposium on Security and Privacy Workshops (EuroS &PW), pp. 386\u2013411. IEEE, Vienna, Austria (2021). https:\/\/doi.org\/10.1109\/EuroSPW54576.2021.00048","DOI":"10.1109\/EuroSPW54576.2021.00048"},{"key":"1047_CR88","doi-asserted-by":"publisher","unstructured":"Kato, F., Cao, Y., Yoshikawa, M.: Preventing Manipulation Attack in Local Differential Privacy Using Verifiable Randomization Mechanism. In: K.\u00a0Barker, K.\u00a0Ghazinour (eds.) Data and Applications Security and Privacy XXXV, Lecture Notes in Computer Science, pp. 43\u201360. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81242-3_3","DOI":"10.1007\/978-3-030-81242-3_3"},{"key":"1047_CR89","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: A Versatile Framework for Multi-Party Computation (2020). https:\/\/eprint.iacr.org\/2020\/521","DOI":"10.1145\/3372297.3417872"},{"key":"1047_CR90","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, pp. 830\u2013842. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"1047_CR91","doi-asserted-by":"publisher","unstructured":"Kone\u010dn\u00fd, J., McMahan, H.B., Ramage, D., Richt\u00e1rik, P.: Federated Optimization: Distributed Machine Learning for On-Device Intelligence (2016). https:\/\/doi.org\/10.48550\/arXiv.1610.02527","DOI":"10.48550\/arXiv.1610.02527"},{"key":"1047_CR92","doi-asserted-by":"publisher","unstructured":"Kosba, A., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 839\u2013858. IEEE, San Jose, CA, USA (2016). https:\/\/doi.org\/10.1109\/SP.2016.55","DOI":"10.1109\/SP.2016.55"},{"key":"1047_CR93","doi-asserted-by":"publisher","unstructured":"Koutsos, V., Papadopoulos, D.: Publicly Auditable Functional Encryption. In: Applied Cryptography and Network Security: 21st International Conference, ACNS 2023, Kyoto, Japan, June 19\u201322, 2023, Proceedings, Part II, pp. 396\u2013425. Springer-Verlag, Berlin, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_15","DOI":"10.1007\/978-3-031-33491-7_15"},{"key":"1047_CR94","unstructured":"Lee, J., Choi, J., Kim, J., Oh, H.: SAVER: SNARK-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization (2019). https:\/\/eprint.iacr.org\/2019\/1270"},{"key":"1047_CR95","doi-asserted-by":"publisher","unstructured":"Li, S., Wang, X., Zhang, R.: Privacy-Preserving Homomorphic MACs with Efficient Verification. In: H.\u00a0Jin, Q.\u00a0Wang, L.J. Zhang (eds.) Web Services \u2013 ICWS 2018, Lecture Notes in Computer Science, pp. 100\u2013115. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94289-6_7","DOI":"10.1007\/978-3-319-94289-6_7"},{"key":"1047_CR96","doi-asserted-by":"publisher","unstructured":"Li, X., Zhao, B., Yang, G., Xiang, T., Weng, J., Deng, R.H.: A Survey of Secure Computation Using Trusted Execution Environments (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.12150","DOI":"10.48550\/arXiv.2302.12150"},{"key":"1047_CR97","unstructured":"Lindell, Y.: Secure Multiparty Computation (MPC) (2020). https:\/\/eprint.iacr.org\/2020\/300"},{"issue":"1","key":"1047_CR98","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s42400-021-00105-6","volume":"5","author":"P Liu","year":"2022","unstructured":"Liu, P., Xu, X., Wang, W.: Threats, attacks and defenses to federated learning: Issues, taxonomy and perspectives. Cybersecurity 5(1), 4 (2022). https:\/\/doi.org\/10.1186\/s42400-021-00105-6","journal-title":"Cybersecurity"},{"key":"1047_CR99","doi-asserted-by":"publisher","unstructured":"Lou, Q., Santriaji, M., Yudha, A.W.B., Xue, J., Solihin, Y.: vFHE: Verifiable Fully Homomorphic Encryption with Blind Hash (2023). https:\/\/doi.org\/10.48550\/arXiv.2303.08886","DOI":"10.48550\/arXiv.2303.08886"},{"key":"1047_CR100","doi-asserted-by":"publisher","unstructured":"Mascia, C., Sala, M., Villa, I.: A survey on functional encryption. Advances in Mathematics of Communications 17(5), 1251\u20131289 (Sun Oct 01 04:00:00 UTC 2023). https:\/\/doi.org\/10.3934\/amc.2021049","DOI":"10.3934\/amc.2021049"},{"key":"1047_CR101","unstructured":"Microsoft Research: Post-Quantum TLS (2024). https:\/\/www.microsoft.com\/en-us\/research\/project\/post-quantum-tls\/"},{"key":"1047_CR102","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Rindal, P.: ABY3: A Mixed Protocol Framework for Machine Learning. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201918, pp. 35\u201352. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3243734.3243760","DOI":"10.1145\/3243734.3243760"},{"key":"1047_CR103","doi-asserted-by":"publisher","first-page":"100,567","DOI":"10.1016\/j.cosrev.2023.100567","volume":"49","author":"D Morales","year":"2023","unstructured":"Morales, D., Agudo, I., Lopez, J.: Private set intersection: A systematic literature review. Computer Science Review 49, 100,567 (2023). https:\/\/doi.org\/10.1016\/j.cosrev.2023.100567","journal-title":"Computer Science Review"},{"issue":"2","key":"1047_CR104","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s00145-023-09452-8","volume":"36","author":"C Mouchet","year":"2023","unstructured":"Mouchet, C., Bertrand, E., Hubaux, J.P.: An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption. Journal of Cryptology 36(2), 10 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09452-8","journal-title":"Journal of Cryptology"},{"key":"1047_CR105","doi-asserted-by":"publisher","unstructured":"Movsowitz\u00a0Davidow, D., Manevich, Y., Toch, E.: Privacy-Preserving Transactions with Verifiable Local Differential Privacy. In: 5th Conference on Advances in Financial Technologies (AFT 2023), vol. 282, pp. 1\u201323. Schloss-Dagstuhl - Leibniz Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.AFT.2023.1","DOI":"10.4230\/LIPIcs.AFT.2023.1"},{"key":"1047_CR106","doi-asserted-by":"publisher","unstructured":"Munilla\u00a0Garrido, G., Sedlmeir, J., Babel, M.: Towards Verifiable Differentially-Private Polling. In: Proceedings of the 17th International Conference on Availability, Reliability and Security, ARES \u201922, pp. 1\u201311. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3538969.3538992","DOI":"10.1145\/3538969.3538992"},{"key":"1047_CR107","doi-asserted-by":"publisher","first-page":"103,180","DOI":"10.1016\/j.cose.2023.103180","volume":"129","author":"A Mu\u00f1oz","year":"2023","unstructured":"Mu\u00f1oz, A., R\u00edos, R., Rom\u00e1n, R., L\u00f3pez, J.: A survey on the (in)security of trusted execution environments. Computers & Security 129, 103,180 (2023). https:\/\/doi.org\/10.1016\/j.cose.2023.103180","journal-title":"Computers & Security"},{"key":"1047_CR108","unstructured":"Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System (2008). https:\/\/bitcoin.org\/bitcoin.pdf. Unpublished manuscript"},{"key":"1047_CR109","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, EC \u201999, pp. 129\u2013139. Association for Computing Machinery, New York, NY, USA (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"1047_CR110","doi-asserted-by":"publisher","unstructured":"Narayan, A., Feldman, A., Papadimitriou, A., Haeberlen, A.: Verifiable differential privacy. In: Proceedings of the Tenth European Conference on Computer Systems, EuroSys \u201915, pp. 1\u201314. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2741948.2741978","DOI":"10.1145\/2741948.2741978"},{"key":"1047_CR111","unstructured":"Natarajan, D., Loveless, A., Dai, W., Dreslinski, R.: CHEX-MIX: Combining Homomorphic Encryption with Trusted Execution Environments for Two-party Oblivious Inference in the Cloud (2021). https:\/\/eprint.iacr.org\/2021\/1603"},{"key":"1047_CR112","unstructured":"NCSC: Preparing for Quantum-Safe Cryptography (2020). https:\/\/www.ncsc.gov.uk\/whitepaper\/preparing-for-quantum-safe-cryptography"},{"key":"1047_CR113","doi-asserted-by":"publisher","unstructured":"Nguyen, D.D., Phan, D.H., Pointcheval, D.: Verifiable Decentralized Multi-client Functional Encryption for Inner Product. In: Advances in Cryptology \u2013 ASIACRYPT 2023, pp. 33\u201365. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_2","DOI":"10.1007\/978-981-99-8733-7_2"},{"key":"1047_CR114","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Skeith, W.E.: A Survey of Single-Database Private Information Retrieval: Techniques and Applications. In: T.\u00a0Okamoto, X.\u00a0Wang (eds.) Public Key Cryptography \u2013 PKC 2007, Lecture Notes in Computer Science, pp. 393\u2013411. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_26","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"1047_CR115","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 4291\u20134308. USENIX Association, Boston, MA (2022). https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/ozdemir"},{"key":"1047_CR116","doi-asserted-by":"publisher","first-page":"102,815","DOI":"10.1016\/j.jisa.2021.102815","volume":"59","author":"S Panja","year":"2021","unstructured":"Panja, S., Roy, B.: A secure end-to-end verifiable e-voting system using blockchain and cloud server. Journal of Information Security and Applications 59, 102,815 (2021). https:\/\/doi.org\/10.1016\/j.jisa.2021.102815","journal-title":"Journal of Information Security and Applications"},{"key":"1047_CR117","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly Practical Verifiable Computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252. IEEE, Berkeley, CA, USA (2013). https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"1047_CR118","doi-asserted-by":"publisher","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: Verifiable computation from attribute-based encryption. In: Proceedings of the 9th International Conference on Theory of Cryptography, TCC\u201912, pp. 422\u2013439. Springer-Verlag, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_24","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"1047_CR119","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E., Tram\u00e8r, F.: Formal Abstractions for Attested Execution Secure Processors. In: Advances in Cryptology \u2013 EUROCRYPT 2017, pp. 260\u2013289. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_10","DOI":"10.1007\/978-3-319-56620-7_10"},{"issue":"4","key":"1047_CR120","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1515\/jmc-2018-0012","volume":"12","author":"MB Paterson","year":"2018","unstructured":"Paterson, M.B., Stinson, D.R., Upadhyay, J.: Multi-prover proof of retrievability. Journal of Mathematical Cryptology 12(4), 203\u2013220 (2018). https:\/\/doi.org\/10.1515\/jmc-2018-0012","journal-title":"Journal of Mathematical Cryptology"},{"key":"1047_CR121","doi-asserted-by":"publisher","unstructured":"Pettai, M., Laud, P.: Combining Differential Privacy and Secure Multiparty Computation. In: Proceedings of the 31st Annual Computer Security Applications Conference, ACSAC \u201915, pp. 421\u2013430. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2818000.2818027","DOI":"10.1145\/2818000.2818027"},{"key":"1047_CR122","unstructured":"PRIViLEDGE project: Revision of Extended Core Protocols. Public Deliverable D3.3, HORIZON 2020 (2021). https:\/\/media.voog.com\/0000\/0042\/1115\/files\/D3.3"},{"key":"1047_CR123","doi-asserted-by":"publisher","unstructured":"Ramchen, K., Culnane, C., Pereira, O., Teague, V.: Universally Verifiable MPC and IRV Ballot Counting. In: I.\u00a0Goldberg, T.\u00a0Moore (eds.) Financial Cryptography and Data Security, Lecture Notes in Computer Science, pp. 301\u2013319. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_19","DOI":"10.1007\/978-3-030-32101-7_19"},{"key":"1047_CR124","doi-asserted-by":"crossref","unstructured":"Rivinius, M., Reisert, P., Rausch, D., Kuesters, R.: Publicly Accountable Robust Multi-Party Computation (2022). https:\/\/eprint.iacr.org\/2022\/436","DOI":"10.1109\/SP46214.2022.9833608"},{"key":"1047_CR125","doi-asserted-by":"publisher","unstructured":"Schabh\u00fcser, L., Butin, D., Demirel, D., Buchmann, J.: Function-Dependent Commitments for Verifiable Multi-party Computation. In: L.\u00a0Chen, M.\u00a0Manulis, S.\u00a0Schneider (eds.) Information Security, Lecture Notes in Computer Science, pp. 289\u2013307. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99136-8_16","DOI":"10.1007\/978-3-319-99136-8_16"},{"key":"1047_CR126","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient Identification and Signatures for Smart Cards. In: G.\u00a0Brassard (ed.) Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings, Lecture Notes in Computer Science, pp. 239\u2013252. Springer, New York, NY (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"1047_CR127","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In: M.\u00a0Wiener (ed.) Advances in Cryptology \u2014 CRYPTO\u2019 99, Lecture Notes in Computer Science, pp. 148\u2013164. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10","DOI":"10.1007\/3-540-48405-1_10"},{"key":"1047_CR128","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B., Veeningen, M.: Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems. In: T.\u00a0Malkin, V.\u00a0Kolesnikov, A.B. Lewko, M.\u00a0Polychronakis (eds.) Applied Cryptography and Network Security, Lecture Notes in Computer Science, pp. 3\u201322. Springer International Publishing, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_1","DOI":"10.1007\/978-3-319-28166-7_1"},{"key":"1047_CR129","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B., Veeningen, M., de Vreede, N.: Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation. In: M.\u00a0Manulis, A.R. Sadeghi, S.\u00a0Schneider (eds.) Applied Cryptography and Network Security, Lecture Notes in Computer Science, pp. 346\u2013366. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_19","DOI":"10.1007\/978-3-319-39555-5_19"},{"issue":"11","key":"1047_CR130","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Communications of the ACM"},{"key":"1047_CR131","unstructured":"Sinha, R., Gaddam, S., Kumaresan, R.: LucidiTEE: A TEE-Blockchain System for Policy-Compliant Multiparty Computation with Fairness (2019). https:\/\/eprint.iacr.org\/2019\/178"},{"key":"1047_CR132","doi-asserted-by":"publisher","unstructured":"Spini, G., Fehr, S.: Cheater Detection in SPDZ Multiparty Computation. In: A.C. Nascimento, P.\u00a0Barreto (eds.) Information Theoretic Security, Lecture Notes in Computer Science, pp. 151\u2013176. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_8","DOI":"10.1007\/978-3-319-49175-2_8"},{"key":"1047_CR133","doi-asserted-by":"publisher","unstructured":"Stadler, M.: Publicly Verifiable Secret Sharing. In: U.\u00a0Maurer (ed.) Advances in Cryptology \u2014 EUROCRYPT \u201996, Lecture Notes in Computer Science, pp. 190\u2013199. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_17","DOI":"10.1007\/3-540-68339-9_17"},{"key":"1047_CR134","doi-asserted-by":"publisher","unstructured":"Terada, S., Yoneyama, K.: Improved Verifiable Delegated Private Set Intersection. In: 2018 International Symposium on Information Theory and Its Applications (ISITA), pp. 520\u2013524. IEEE, Singapore (2018). https:\/\/doi.org\/10.23919\/ISITA.2018.8664310","DOI":"10.23919\/ISITA.2018.8664310"},{"issue":"2\u20134","key":"1047_CR135","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/3300000030","volume":"4","author":"J Thaler","year":"2022","unstructured":"Thaler, J.: Proofs, Arguments, and Zero-Knowledge. Foundations and Trends\u00ae in Privacy and Security 4(2\u20134), 117\u2013660 (2022). https:\/\/doi.org\/10.1561\/3300000030","journal-title":"Foundations and Trends\u00ae in Privacy and Security"},{"key":"1047_CR136","doi-asserted-by":"crossref","unstructured":"Tsaloli, G., Mitrokotsa, A.: Differential Privacy meets Verifiable Computation: Achieving Strong Privacy and Integrity Guarantees. In: 16th International Conference on Security and Cryptography, pp. 425\u2013430. SciTePress, Prague, Czech Republic (2023). https:\/\/www.scitepress.org\/PublicationsDetail.aspx?ID=HUXWvgGpS1M=&t=1","DOI":"10.5220\/0007919404250430"},{"key":"1047_CR137","doi-asserted-by":"publisher","unstructured":"Veeningen, M.: Pinocchio-Based Adaptive zk-SNARKs and Secure\/Correct Adaptive Function Evaluation. In: M.\u00a0Joye, A.\u00a0Nitaj (eds.) Progress in Cryptology - AFRICACRYPT 2017, Lecture Notes in Computer Science, pp. 21\u201339. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57339-7_2","DOI":"10.1007\/978-3-319-57339-7_2"},{"key":"1047_CR138","unstructured":"Veugen, T.: Correction to \u201cImproving the DGK comparison protocol\u201d (2018). https:\/\/eprint.iacr.org\/2018\/1100"},{"key":"1047_CR139","doi-asserted-by":"publisher","unstructured":"Viand, A., Knabenhans, C., Hithnawi, A.: Verifiable Fully Homomorphic Encryption (2023). https:\/\/doi.org\/10.48550\/arXiv.2301.07041","DOI":"10.48550\/arXiv.2301.07041"},{"key":"1047_CR140","doi-asserted-by":"publisher","unstructured":"Vos, J., Conti, M., Erkin, Z.: SoK: Collusion-resistant Multi-party Private Set Intersections in the Semi-honest Model. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 79\u201379. IEEE Computer Society, San Francisco, CA, USA (2023). https:\/\/doi.org\/10.1109\/SP54263.2024.00079","DOI":"10.1109\/SP54263.2024.00079"},{"key":"1047_CR141","doi-asserted-by":"publisher","unstructured":"Wohlin, C.: Guidelines for snowballing in systematic literature studies and a replication in software engineering. In: Proceedings of the 18th International Conference on Evaluation and Assessment in Software Engineering, EASE \u201914, pp. 1\u201310. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2601248.2601268","DOI":"10.1145\/2601248.2601268"},{"key":"1047_CR142","unstructured":"Wood, G.: Ethereum: A Secure Decentralised Generalised Transaction Ledger (2014). https:\/\/gavwood.com\/paper.pdf. Unpublished manuscript"},{"key":"1047_CR143","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In: Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III, pp. 733\u2013764. Springer-Verlag, Berlin, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"1047_CR144","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (Sfcs 1986), pp. 162\u2013167. IEEE, Toronto, ON, Canada (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"1047_CR145","unstructured":"Zama: Zama - Fully homomorphic encryption (2023). https:\/\/www.zama.ai\/"},{"key":"1047_CR146","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Yu, H.: Towards Verifiable Federated Learning. In: Thirty-First International Joint Conference on Artificial Intelligence, vol.\u00a06, pp. 5686\u20135693. International Joint Conferences on Artificial Intelligence Organization, Vienna, Austria (2022). https:\/\/doi.org\/10.24963\/ijcai.2022\/792","DOI":"10.24963\/ijcai.2022\/792"},{"key":"1047_CR147","unstructured":"ZKProof: ZKProof Wiki of Concrete ZKP Schemes (2022). https:\/\/docs.zkproof.org\/schemes"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01047-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-025-01047-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01047-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T10:12:08Z","timestamp":1750500728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-025-01047-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,24]]},"references-count":147,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1047"],"URL":"https:\/\/doi.org\/10.1007\/s10207-025-01047-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,24]]},"assertion":[{"value":"24 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"141"}}