{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T04:05:34Z","timestamp":1779163534274,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":53,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987238","type":"print"},{"value":"9789819987245","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8724-5_14","type":"book-chapter","created":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T08:02:20Z","timestamp":1702886540000},"page":"453-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Universally Composable Auditable Surveillance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8157-9768","authenticated-orcid":false,"given":"Valerie","family":"Fetzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3466-0675","authenticated-orcid":false,"given":"Michael","family":"Kloo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6449-9494","authenticated-orcid":false,"given":"Markus","family":"Raiber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0439-3633","authenticated-orcid":false,"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,19]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Abelson, H., Anderson, R.J., Bellovin, S.M., et al.: Keys under doormats: mandating insecurity by requiring government access to all data and communications. J. Cybersecur. 1(1), 69\u201379 (2015). https:\/\/doi.org\/10.1093\/cybsec\/tyv009","DOI":"10.1093\/cybsec\/tyv009"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-88418-5_2","volume-title":"Computer Security \u2013 ESORICS 2021","author":"G Arfaoui","year":"2021","unstructured":"Arfaoui, G., et al.: How to (legally) keep secrets from mobile operators. In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12972, pp. 23\u201343. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88418-5_2"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Backes, M., Camenisch, J., Sommer, D.: Anonymous yet accountable access control. In: Atluri, V., di Vimercati, S.D.C., Dingledine, R. (eds.) Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, WPES 2005, Alexandria, VA, USA, 7 November 2005, pp. 40\u201346. ACM (2005). https:\/\/doi.org\/10.1145\/1102199.1102208","DOI":"10.1145\/1102199.1102208"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30144-8_6","volume-title":"Information Security","author":"M Backes","year":"2004","unstructured":"Backes, M., Hofheinz, D.: How to break and repair a universally composable signature functionality. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 61\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30144-8_6"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Maurer, U., Tschudi, D., Zikas, V.: Bitcoin as a transaction ledger: a composable treatment. Cryptology ePrint Archive, Report 2017\/149. https:\/\/ia.cr\/2017\/149.2017","DOI":"10.1007\/978-3-319-63688-7_11"},{"key":"14_CR6","unstructured":"Bates, A.M., Butler, K.R.B., Sherr, M., et al.: Accountable wiretapping -or- I know they can hear you now. In: NDSS 2012. The Internet Society, February 2012"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/PL00003819","volume":"12","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Rivest, R.L.: Translucent cryptography\u2014an alternative to key escrow, and its implementation via fractional oblivious transfer. J. Cryptol. 12(2), 117\u2013139 (1999). https:\/\/doi.org\/10.1007\/PL00003819","journal-title":"J. Cryptol."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-64375-1_10","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., Gentry, C., Gorbunov, S., Halevi, S., Krawczyk, H., Lin, C., Rabin, T., Reyzin, L.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"14_CR9","unstructured":"Brickell, E.F., Gemmell, P., Kravitz, D.W.: Trustee-based tracing extensions to anonymous cash and the making of anonymous change. In: Clarkson, K.L. (ed.) 6th SODA. ACM-SIAM, Janurary 1995, pp. 457\u2013466 (1995)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-031-30872-7_7","volume-title":"Topics in Cryptology - CT-RSA 2023","author":"J Brorsson","year":"2023","unstructured":"Brorsson, J., David, B., Gentile, L., Pagnin, E., Wagner, P.S.: PAPR: publicly auditable privacy revocation for anonymous credentials. In: Rosulek, M. (ed.) CT-RSA 2023. LNCS, vol. 13871, pp. 163\u2013190. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_7"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-662-53890-6_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Enderlein, R.R., Krenn, S., K\u00fcsters, R., Rausch, D.: Universal composition with responsive environments. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 807\u2013840. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_27"},{"key":"14_CR12","unstructured":"Campanelli, M., David, B., Khoshakhlagh, H., Konring, A., Nielsen, J.B.: Encryption to the future: a paradigm for sending secret messages to future (anonymous) committees. Cryptology ePrint Archive, Report 2021\/1423 (2021). https:\/\/eprint.iacr.org\/2021\/1423"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-031-22969-5_6","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"M Campanelli","year":"2022","unstructured":"Campanelli, M., David, B., Khoshakhlagh, H., Konring, A., Nielsen, J.B.: Encryption to the future. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13793, pp. 151\u2013180. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_6"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5) 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"14_CR15","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067. https:\/\/ia.cr\/2000\/067.2000"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW, p. 219. IEEE Computer Society (2004)","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Cascudo, I., David, B., Garms, L., Konring, A.: YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model. Cryptology ePrint Archive, Report 2022\/242 (2022). https:\/\/ia.cr\/2022\/242","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"14_CR18","unstructured":"Council of the European Union: Council Resolution on Encryption - Security through encryption and security despite encryption. https:\/\/data.consilium.europa.eu\/doc\/document\/ST-13084-2020-REV-1\/en\/pdf.2020"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-031-07689-3_24","volume-title":"Cyber Security, Cryptology, and Machine Learning - CSCML 2022","author":"V Daza","year":"2022","unstructured":"Daza, V., Haque, A., Scafuro, A., Zacharakis, A., Zapico, A.: Mutual accountability layer: accountable anonymity within accountable trust. In: Dolev, S., Katz, J., Meisels, A. (eds.) CSCML 2022. LNCS, vol. 13301, pp. 318\u2013336. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07689-3_24"},{"key":"14_CR20","unstructured":"Erwig, A., Faust, S., Riahi, S.: Large-scale non- interactive threshold cryptosystems through anonymity. Cryptology ePrint Archive, Report 2021\/1290. https:\/\/eprint.iacr.org\/2021\/1290.2021"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Fetzer, V., Kloo\u00df, M., M\u00fcller-Quade, J., Raiber, M., Rupp, A.: Universally composable auditable surveillance. Cryptology ePrint Archive, Paper 2023\/1343 (2023). https:\/\/eprint.iacr.org\/2023\/1343","DOI":"10.1007\/978-981-99-8724-5_14"},{"key":"14_CR22","unstructured":"Frankle, J., Park, S., Shaar, D., Goldwasser, S., Weitzner, D.J.: Practical accountability of secret processes. In: Enck, W., Felt, A.P. (eds.) USENIX Security 2018, pp. 657\u2013674. USENIX Association, August 2018"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-662-44371-2_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 518\u2013535. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_29"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-662-54970-4_5","volume-title":"Financial Cryptography and Data Security","author":"C Garman","year":"2017","unstructured":"Garman, C., Green, M., Miers, I.: Accountable privacy for decentralized anonymous payments. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 81\u201398. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_5"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84245-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Gentry","year":"2021","unstructured":"Gentry, C., et al.: YOSO: you only speak once. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-031-06944-4_16","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"C Gentry","year":"2022","unstructured":"Gentry, C., Halevi, S., Lyubashevsky, V.: Practical noninteractive publicly verifiable secret sharing with thousands of parties. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 458\u2013487. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_16"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-662-44371-2_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"C Gentry","year":"2014","unstructured":"Gentry, C., Lewko, A., Waters, B.: Witness encryption from instance independent assumptions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 426\u2013443. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_24"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-40084-1_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Goldwasser","year":"2013","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run Turing machines on encrypted data. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 536\u2013553. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_30"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Park, S.: Public accountability vs. secret laws: can they coexist?: A cryptographic proposal. In: Thuraisingham, B.M., Lee, A.J. (eds.) Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, Dallas, TX, USA, 30 October\u20133 November 2017, pp. 99\u2013110. ACM (2017). https:\/\/doi.org\/10.1145\/3139550.3139565","DOI":"10.1145\/3139550.3139565"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-97121-2_10","volume-title":"Public-Key Cryptography - PKC 2022","author":"V Goyal","year":"2022","unstructured":"Goyal, V., Kothapalli, A., Masserova, E., Parno, B., Song, Y.: Storing and retrieving secrets on a blockchain. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022. LNCS, vol. 13177, pp. 252\u2013282. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_10"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-030-77883-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"M Green","year":"2021","unstructured":"Green, M., Kaptchuk, G., Van Laer, G.: Abuse resistant law enforcement access systems. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 553\u2013583. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_19"},{"key":"14_CR32","unstructured":"Encryption Working Group: Moving the Encryption Policy Conversation Forward. Technical report, Carnegie Endowment for International Peace (2019)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-24676-3_35","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S Jarecki","year":"2004","unstructured":"Jarecki, S., Shmatikov, V.: Handcuffing big brother: an abuse-resilient transaction escrow scheme. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 590\u2013608. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_35"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-56784-2_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Jost","year":"2020","unstructured":"Jost, D., Maurer, U.: Overcoming impossibility results in composable security using interval-wise guarantees. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 33\u201362. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_2"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-44750-4_17","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"J Kilian","year":"1995","unstructured":"Kilian, J., Leighton, T.: Fair cryptosystems, revisited. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 208\u2013221. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_17"},{"key":"14_CR36","unstructured":"Kroll, J.A., Felten, E.W., Boneh, D.: Secure protocols for accountable warrant execution (2014). https:\/\/www.jkroll.com\/papers\/warrant_paper.pdf"},{"key":"14_CR37","unstructured":"Kroll, J.A., Zimmerman, J., Wu, D.J., et al.: Accountable Cryptographic Access Control (2018). https:\/\/www.cs.yale.edu\/homes\/jf\/kroll-paper.pdf"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-36504-4_19","volume-title":"Financial Cryptography","author":"D K\u00fcgler","year":"2003","unstructured":"K\u00fcgler, D., Vogt, H.: Offline payments with auditable tracing. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 269\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_19"},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-540-70583-3_43","volume-title":"Automata, Languages and Programming","author":"K Kurosawa","year":"2008","unstructured":"Kurosawa, K., Furukawa, J.: Universally composable undeniable signature. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 524\u2013535. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_43"},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-84259-8_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"X Liang","year":"2021","unstructured":"Liang, X., Pandey, O.: Towards a unified approach to black-box constructions of zero-knowledge proofs. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 34\u201364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_2"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Liu, J., Ryan, M.D., Chen, L.: Balancing societal security and individual privacy: accountable escrow system. In: Datta, A., Fournet, C. (eds.) CSF 2014 Computer Security Foundations Symposium, pp. 427\u2013440. IEEE Computer Society Press (2014). https:\/\/doi.org\/10.1109\/CSF.2014.37","DOI":"10.1109\/CSF.2014.37"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"JB Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 111\u2013126. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_8"},{"key":"14_CR43","unstructured":"Official Journal of the European Communities. Council Resolution on on the lawful interception of telecommunications (1995). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/PDF\/?uri=CELEX:31996G1104 &from=EN"},{"key":"14_CR44","unstructured":"Official Journal of the European Communities. Directive (EU) 2018\/843 of the European Parliament and of the Council amending Directive (EU) 2015\/849 on the prevention of the use of the financial system for the purposes of money laundering or terrorist & financing, and amending Directives 2009\/138\/EC and 2013\/36\/EU (2018). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/PDF\/?uri=CELEX:31996G1104 &from=EN"},{"key":"14_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/10719994_20","volume-title":"Information Security and Cryptology - ICISC\u201999","author":"P Paillier","year":"2000","unstructured":"Paillier, P., Yung, M.: Self-escrowed public-key infrastructures. In: Song, J.S. (ed.) ICISC 1999. LNCS, vol. 1787, pp. 257\u2013268. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719994_20"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Panwar, G., Vishwanathan, R., Misra, S., Bos, A.: SAMPL: scalable auditability of monitoring processes using public ledgers. In: Cavallaro, L., Kinder, J., Wang, X.F., Katz, J. (eds.) ACM CCS 2019, pp. 2249\u20132266. ACM Press, November 2019. https:\/\/doi.org\/10.1145\/3319535.3354219","DOI":"10.1145\/3319535.3354219"},{"key":"14_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-07085-3_2","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"G Persiano","year":"2022","unstructured":"Persiano, G., Phan, D.H., Yung, M.: Anamorphic encryption: private communication against a dictator. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 34\u201363. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_2"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-32009-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Rosulek","year":"2012","unstructured":"Rosulek, M.: Must you know the code of f to securely compute f? In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 87\u2013104. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_7"},{"key":"14_CR49","doi-asserted-by":"publisher","unstructured":"Savage, S.: Lawful device access without mass surveillance risk: a technical design discussion. In: Lie, D., Mannan, M., Backes, M., Wang, X.F. (eds.) ACM CCS 2018, pp. 1761\u20131774. ACM Press, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243758","DOI":"10.1145\/3243734.3243758"},{"key":"14_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-17259-6_2","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"A Scafuro","year":"2019","unstructured":"Scafuro, A.: Break-glass encryption. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 34\u201362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_2"},{"key":"14_CR51","unstructured":"Servan-Schreiber, S., Wheeler, A.: Judge, jury & encryptioner: exceptional access with a fixed social cost. CoRR abs\/1912.05620 (2019). http:\/\/arxiv.org\/abs\/1912.05620"},{"key":"14_CR52","doi-asserted-by":"publisher","unstructured":"Wright, C.V., Varia, M.: Crypto crumple zones: enabling limited access without mass surveillance. In: 2018 IEEE European Symposium on Security and Privacy, EuroS &P 2018, London, United Kingdom, 24\u201326 April 2018, pp. 288\u2013306. IEEE (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00028","DOI":"10.1109\/EuroSP.2018.00028"},{"key":"14_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0054114","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"A Young","year":"1998","unstructured":"Young, A., Yung, M.: Auto-recoverable auto-certifiable cryptosystems. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 17\u201331. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054114"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8724-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T01:02:24Z","timestamp":1766019744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8724-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987238","9789819987245"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8724-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","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":"375","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":"106","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":"0","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":"28% - 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","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":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}