{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:27:45Z","timestamp":1775744865978,"version":"3.50.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031477539","type":"print"},{"value":"9783031477546","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47754-6_16","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:02:35Z","timestamp":1701334955000},"page":"270-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Eagle: Efficient Privacy Preserving Smart Contracts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7905-0198","authenticated-orcid":false,"given":"Carsten","family":"Baum","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5126-9494","authenticated-orcid":false,"given":"James Hsin-yu","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Bernardo","family":"David","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0358-2638","authenticated-orcid":false,"given":"Tore Kasper","family":"Frederiksen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-44774-1_8","volume-title":"Financial Cryptography and Data Security","author":"M Andrychowicz","year":"2014","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, \u0141: Fair two-party computations via bitcoin deposits. In: B\u00f6hme, R., Brenner, M., Moore, T., Smith, M. (eds.) FC 2014. LNCS, vol. 8438, pp. 105\u2013121. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44774-1_8"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 443\u2013458. IEEE Computer Society Press (2014). https:\/\/doi.org\/10.1109\/SP.2014.35","DOI":"10.1109\/SP.2014.35"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-63688-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Badertscher","year":"2017","unstructured":"Badertscher, C., Maurer, U., Tschudi, D., Zikas, V.: Bitcoin as a transaction ledger: a composable treatment. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 324\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_11"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Clear, M., Tewari, H.: zkhawk: practical private smart contracts from mpc-based hawk. In: 2021 3rd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS), pp. 245\u2013248. IEEE (2021). https:\/\/doi.org\/10.1109\/BRAINS52497.2021.9569822","DOI":"10.1109\/BRAINS52497.2021.9569822"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Tewari, H.: Multiverse of HawkNess: A Universally-Composable MPC-based Hawk Variant. Cryptology ePrint Archive (2022). https:\/\/eprint.iacr.org\/2022\/421","DOI":"10.3390\/cryptography6030039"},{"key":"16_CR6","unstructured":"Baum, C., yu Chiang, J.H., David, B., Frederiksen, T.K.: Eagle: efficient privacy preserving smart contracts. Cryptology ePrint Archive, Paper 2022\/1435 (2022). https:\/\/eprint.iacr.org\/2022\/1435,"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-51280-4_22","volume-title":"Financial Cryptography and Data Security","author":"C Baum","year":"2020","unstructured":"Baum, C., David, B., Dowsley, R.: Insured MPC: efficient secure computation with financial penalties. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 404\u2013420. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_22"},{"key":"16_CR8","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: CRAFT: composable randomness and almost fairness from time. Cryptology ePrint Archive, Report 2020\/784 (2020). https:\/\/eprint.iacr.org\/2020\/784"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-78372-3_7","volume-title":"Applied Cryptography and Network Security","author":"C Baum","year":"2021","unstructured":"Baum, C., David, B., Frederiksen, T.K.: P2DEX: privacy-preserving decentralized cryptocurrency exchange. In: Sako, K., Tippenhauer, N.O. (eds.) ACNS 2021. LNCS, vol. 12726, pp. 163\u2013194. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78372-3_7"},{"issue":"2\/3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1147\/JRD.2019.2913621","volume":"63","author":"F Benhamouda","year":"2019","unstructured":"Benhamouda, F., Halevi, S., Halevi, T.: Supporting private data on hyperledger fabric with secure multiparty computation. IBM J. Res. Dev. 63(2\/3), 1\u20133 (2019). https:\/\/doi.org\/10.1147\/JRD.2019.2913621","journal-title":"IBM J. Res. Dev."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421\u2013439. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-70697-9_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"I Bentov","year":"2017","unstructured":"Bentov, I., Kumaresan, R., Miller, A.: Instantaneous decentralized poker. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 410\u2013440. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_15"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0314-9","journal-title":"J. Cryptol."},{"key":"16_CR14","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, pp. 947\u2013964. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00050","DOI":"10.1109\/SP40000.2020.00050"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-030-51280-4_23","volume-title":"Financial Cryptography and Data Security","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Agrawal, S., Zamani, M., Boneh, D.: Zether: towards privacy in a smart contract world. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 423\u2013443. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23"},{"key":"16_CR16","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, pp. 315\u2013334. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001), https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: 17th IEEE Computer Security Foundations Workshop, (CSFW-17 2004), 28\u201330 June 2004, Pacific Grove, CA, USA, p. 219. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/CSFW.2004.24, http:\/\/doi.ieeecomputersociety.org\/10.1109\/CSFW.2004.24","DOI":"10.1109\/CSFW.2004.24"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Cheng, R., et al.: Ekiden: a platform for confidentiality-preserving, trustworthy, and performant smart contracts. In: 2019 IEEE European Symposium on Security and Privacy (EuroS &P) (2019). https:\/\/doi.org\/10.1109\/EuroSP.2019.00023","DOI":"10.1109\/EuroSP.2019.00023"},{"key":"16_CR22","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: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 719\u2013728. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134092","DOI":"10.1145\/3133956.3134092"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Daian, P., et al.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: 2020 IEEE Symposium on Security and Privacy, pp. 910\u2013927. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00040","DOI":"10.1109\/SP40000.2020.00040"},{"key":"16_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-662-54970-4_10","volume-title":"FC 2016","author":"I Damg\u00e5rd","year":"2016","unstructured":"Damg\u00e5rd, I., Damg\u00e5rd, K., Nielsen, K., Nordholt, P.S., Toft, T.: Confidential benchmarking based on multiparty computation. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 169\u2013187. Springer, Heidelberg (Feb (2016). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_10"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"David, B., Dowsley, R., Larangeira, M.: Kaleidoscope: an efficient poker protocol with payment distribution and penalty enforcement. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 500\u2013519. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58387-6_27","DOI":"10.1007\/978-3-662-58387-6_27"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"David, B., Gentile, L., Pourpouneh, M.: FAST: fair auctions via secret transactions. In: Ateniese, G., Venturi, D. (eds.) ACNS 2022. LNCS, vol. 13269, pp. 727\u2013747. Springer, Heidelberg (Jun 2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_36","DOI":"10.1007\/978-3-031-09234-3_36"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Fiat-shamir bulletproofs are non-malleable (in the algebraic group model). In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 397\u2013426. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_14","DOI":"10.1007\/978-3-031-07085-3_14"},{"issue":"3","key":"16_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2220357.2220358","volume":"59","author":"J Groth","year":"2012","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: New techniques for noninteractive zero-knowledge. J. ACM (JACM) 59(3), 1\u201335 (2012). https:\/\/doi.org\/10.1145\/2220357.2220358","journal-title":"J. ACM (JACM)"},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Jakobsen, T.P., Nielsen, J.B., Orlandi, C.: A framework for outsourcing of secure computation. In: Ahn, G., Oprea, A., Safavi-Naini, R. (eds.) Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW 2014, Scottsdale, Arizona, USA, 7 November 2014, pp. 81\u201392. ACM (2014). https:\/\/doi.org\/10.1145\/2664168.2664170","DOI":"10.1145\/2664168.2664170"},{"key":"16_CR32","unstructured":"Kalodner, H.A., Goldfeder, S., Chen, X., Weinberg, S.M., Felten, E.W.: Arbitrum: scalable, private smart contracts. In: Enck, W., Felt, A.P. (eds.) USENIX Security 2018, pp. 1353\u20131370. USENIX Association (Aug 2018)"},{"key":"16_CR33","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: IEEE European Symposium on Security and Privacy Workshops, EuroS &P 2021, Vienna, Austria, 6\u201310 September 2021, pp. 386\u2013411. IEEE (2021). https:\/\/doi.org\/10.1109\/EuroSPW54576.2021.00048","DOI":"10.1109\/EuroSPW54576.2021.00048"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"16_CR35","doi-asserted-by":"publisher","unstructured":"Kerber, T., Kiayias, A., Kohlweiss, M.: KACHINA - foundations of private smart contracts. In: K\u00fcsters, R., Naumann, D. (eds.) CSF 2021 Computer Security Foundations Symposium, pp. 1\u201316. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/CSF51468.2021.00002","DOI":"10.1109\/CSF51468.2021.00002"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-49896-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Kiayias","year":"2016","unstructured":"Kiayias, A., Zhou, H.-S., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 705\u2013734. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_25"},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Kosba, A.E., 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, pp. 839\u2013858. IEEE Computer Society Press (May 2016). https:\/\/doi.org\/10.1109\/SP.2016.55","DOI":"10.1109\/SP.2016.55"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Kumaresan, R., Bentov, I.: Amortizing secure computation with penalties. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 418\u2013429. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978424","DOI":"10.1145\/2976749.2978424"},{"key":"16_CR39","doi-asserted-by":"publisher","unstructured":"Kumaresan, R., Moran, T., Bentov, I.: How to use bitcoin to play decentralized poker. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 195\u2013206 (2015). https:\/\/doi.org\/10.1145\/2810103.2813712","DOI":"10.1145\/2810103.2813712"},{"key":"16_CR40","doi-asserted-by":"publisher","unstructured":"Kumaresan, R., Vaikuntanathan, V., Vasudevan, P.N.: Improvements to secure computation with penalties. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 406\u2013417. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978421","DOI":"10.1145\/2976749.2978421"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Lee, J., Nikitin, K., Setty, S.T.V.: Replicated state machines without replicated execution. In: 2020 IEEE Symposium on Security and Privacy, pp. 119\u2013134. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00068","DOI":"10.1109\/SP40000.2020.00068"},{"key":"16_CR42","unstructured":"Nilsson, A., Bideh, P.N., Brorsson, J.: A survey of published attacks on intel SGX. CoRR abs\/ arXiv: 2006.13598 (2020)"},{"key":"16_CR43","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with collaborative zk-SNARKs: Zero-knowledge proofs for distributed secrets. Cryptology ePrint Archive, Report 2021\/1530 (2021). https:\/\/eprint.iacr.org\/2021\/1530"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"16_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-36178-2_26","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"M Abe","year":"2002","unstructured":"Abe, M., Ohkubo, M., Suzuki, K.: 1-out-of-n signatures from a variety of keys. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 415\u2013432. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_26"},{"key":"16_CR46","doi-asserted-by":"crossref","unstructured":"Steffen, S., Bichsel, B., Baumgartner, R., Vechev, M.: ZeeStar: private Smart Contracts by Homomorphic Encryption and Zero-knowledge Proofs. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 1543\u20131543. IEEE Computer Society (2022). https:\/\/files.sri.inf.ethz.ch\/website\/papers\/sp22-zeestar.pdf","DOI":"10.1109\/SP46214.2022.9833732"},{"key":"16_CR47","doi-asserted-by":"publisher","unstructured":"Steffen, S., Bichsel, B., Gersbach, M., Melchior, N., Tsankov, P., Vechev, M.T.: zkay: specifying and enforcing data privacy in smart contracts. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 1759\u20131776. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363222","DOI":"10.1145\/3319535.3363222"},{"key":"16_CR48","unstructured":"Team, T.S.N.: Secret network: a privacy-preserving secret contract & decentralized application platform (2022). https:\/\/scrt.network\/graypaper"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47754-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:06:04Z","timestamp":1701335164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47754-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"ISBN":["9783031477539","9783031477546"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47754-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}