{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:42:01Z","timestamp":1780069321250,"version":"3.54.0"},"publisher-location":"Singapore","reference-count":57,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551187","type":"print"},{"value":"9789819551194","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5119-4_16","type":"book-chapter","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:44:31Z","timestamp":1765057471000},"page":"506-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Context-Dependent Threshold Decryption and\u00a0Its Applications"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benedikt","family":"B\u00fcnz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lior","family":"Rotem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,7]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-28628-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M Abe","year":"2004","unstructured":"Abe, M., Fehr, S.: Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 317\u2013334. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_20"},{"key":"16_CR2","unstructured":"Agarwal, A., Fernando, R., Pinkas, B.: Efficiently-thresholdizable batched identity based encryption, with applications. Cryptology ePrint Archive, Paper 2024\/1575 (2024). https:\/\/eprint.iacr.org\/2024\/1575"},{"key":"16_CR3","unstructured":"Bebel, J., Ojha, D.: Ferveo: Threshold decryption for mempool privacy in BFT networks. Cryptology ePrint Paper 2022\/898 (2022). https:\/\/eprint.iacr.org\/2022\/898"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Crites, E.C., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Better than advertised security for non-interactive threshold signatures. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 517\u2013550. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_18","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"16_CR5","unstructured":"Bellare, M., Tessaro, S., Zhu, C.: Stronger security for non-interactive threshold signatures: BLS and FROST. Cryptology ePrint Archive, Paper 2022\/833 (2022). https:\/\/eprint.iacr.org\/2022\/833"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: CRYPTO 1984. Lecture Notes in Computer Science, vol.\u00a0196, pp. 242\u2013268. Springer (1984)","DOI":"10.1007\/3-540-39568-7_20"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, Multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11605805_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Boyen, X., Halevi, S.: Chosen ciphertext secure public key threshold encryption without random oracles. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 226\u2013243. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11605805_15"},{"key":"16_CR9","unstructured":"Boneh, D., B\u00fcnz, B., Nayak, K., Rotem, L., Shoup, V.: Context-dependent threshold decryption and its applications. Cryptology ePrint Archive, Paper 2025\/279 (2025). https:\/\/eprint.iacr.org\/2025\/279"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"16_CR12","unstructured":"Boneh, D., Laufer, E., Tas, E.N.: Batch decryption without epochs and its application to encrypted mempools. Cryptology ePrint Archive, Paper 2025\/1254 (2025). https:\/\/eprint.iacr.org\/2025\/1254"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. In: CRYPTO 2024. LNCS, vol. 14926, pp. 317\u2013351. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_11","DOI":"10.1007\/978-3-031-68394-7_11"},{"key":"16_CR16","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography (version 0.6) (2023). https:\/\/toc.cryptobook.us\/"},{"key":"16_CR17","unstructured":"Bormet, J., Faust, S., Othman, H., Qu, Z.: BEAT-MEV: Epochless approach to batched threshold encryption for MEV prevention. ePrint 2024\/1533 (2024)"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Boyen, X., Mei, Q., Waters, B.: Direct chosen ciphertext security from identity-based techniques. In: ACM CCS 2005, pp. 320\u2013329 (2005). https:\/\/doi.org\/10.1145\/1102120.1102162","DOI":"10.1145\/1102120.1102162"},{"key":"16_CR19","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus (2018). arxiv:1807.04938"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: practical asynchronous byzantine agreement using cryptography (extended abstract). In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Drijvers, M., Hanke, T., Pignolet, Y., Shoup, V., Williams, D.: Internet computer consensus. In: PODC 2022, pp. 81\u201391. ACM (2022). https:\/\/doi.org\/10.1145\/3519270.3538430","DOI":"10.1145\/3519270.3538430"},{"issue":"5","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 1\u201394 (2020)","journal-title":"J. ACM"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldwasser, S.: An efficient Threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In: Stern, J. (ed.) EUROCRYPT 1999. Lecture Notes in Computer Science, vol.\u00a01592, pp. 90\u2013106. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_7","DOI":"10.1007\/3-540-48910-X_7"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207\u2013222. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_13"},{"issue":"4","key":"16_CR25","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398\u2013461 (2002). https:\/\/doi.org\/10.1145\/571637.571640","journal-title":"ACM Trans. Comput. Syst."},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Chan, B.Y., Pass, R.: Simplex consensus: a simple and fast consensus protocol. In: TCC 2023. Lecture Notes in Computer Science, vol. 14372, pp. 452\u2013479. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_17","DOI":"10.1007\/978-3-031-48624-1_17"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291\u2013310. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_17"},{"key":"16_CR28","unstructured":"Choudhuri, A.R., Garg, S., Piet, J., Policharla, G.: Mempool privacy via batched threshold encryption: attacks and defenses. In: USENIX Security 2024 (2024)"},{"key":"16_CR29","unstructured":"Choudhuri, A.R., Garg, S., Policharla, G.V., Wang, M.: Practical mempool privacy via one-time setup batched threshold encryption. Cryptology ePrint Archive, Paper 2024\/1516 (2024). https:\/\/eprint.iacr.org\/2024\/1516"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Proceedings of the Second International Conference on Theory of Cryptography, TCC 2005, pp. 342\u2013362. Springer-Verlag (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_19","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055717"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Daian, P., et al.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: IEEE Computer Society Press, pp. 910\u2013927 (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"key":"16_CR33","unstructured":"Das, S., Ren, L., Yang, Z.: Adaptively secure threshold ElGamal decryption from DDH. Cryptology ePrint Archive, Paper 2025\/1477 (2025). https:\/\/eprint.iacr.org\/2025\/1477"},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"De\u00a0Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 522\u2013533. Association for Computing Machinery (1994). https:\/\/doi.org\/10.1145\/195058.195405","DOI":"10.1145\/195058.195405"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: CRYPTO 1987, pp. 120\u2013127. Springer-Verlag (1987)","DOI":"10.1007\/3-540-48184-2_8"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Desmedt, Y.: Threshold cryptosystems. In: AUSCRYPT 1992, pp. 1\u201314. Springer Berlin Heidelberg (1992)","DOI":"10.1007\/3-540-57220-1_47"},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Devevey, J., Libert, B., Nguyen, K., Peters, T., Yung, M.: Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings. In: PKC 2021. LNCS, vol. 12710, pp. 659\u2013690. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_24","DOI":"10.1007\/978-3-030-75245-3_24"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Katz, J.: Chosen-ciphertext security of multiple encryption. In: TCC 2005, pp. 188\u2013209. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_11","DOI":"10.1007\/978-3-540-30576-7_11"},{"key":"16_CR39","unstructured":"Dziembowski, S., Faust, S., Luhn, J.: Shutter network: Private transactions from threshold cryptography. ePrint 2024\/1981 (2024). https:\/\/eprint.iacr.org\/2024\/1981"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"P-A Fouque","year":"2001","unstructured":"Fouque, P.-A., Pointcheval, D.: Threshold cryptosystems secure against chosen-ciphertext attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 351\u2013368. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_21"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Garg, S., Kolonelos, D., Policharla, G., Wang, M.: Threshold encryption with silent setup. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. Lecture Notes in Computer Science, vol. 14926, pp. 352\u2013386. Springer (2024)","DOI":"10.1007\/978-3-031-68394-7_12"},{"key":"16_CR42","unstructured":"Groth, J.: Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive, Paper 2021\/339 (2021). https:\/\/eprint.iacr.org\/2021\/339"},{"key":"16_CR43","unstructured":"Jalalzai, M.M., Niu, J., Feng, C.: Fast-hotstuff: A fast and resilient hotstuff protocol (2020). arxiv:2010.11454"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: introducing concurrency, removing erasures. In: EUROCRYPT 2000, pp. 221\u2013242. Springer (2000)","DOI":"10.1007\/3-540-45539-6_16"},{"key":"16_CR45","unstructured":"Labs, O.: Osmosis project (2021). https:\/\/docs.osmosis.zone\/"},{"key":"16_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-642-55220-5_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B Libert","year":"2014","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Non-malleability from malleability: simulation-sound quasi-adaptive NIZK Proofs and CCA2-secure encryption from homomorphic signatures. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 514\u2013532. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_29"},{"key":"16_CR47","doi-asserted-by":"publisher","unstructured":"Libert, B., Yung, M.: Non-interactive CCA-secure threshold cryptosystems with adaptive security: new framework and constructions. In: Theory of Cryptography 2012. LNCS, vol.\u00a07194, pp. 75\u201393. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_5","DOI":"10.1007\/978-3-642-28914-9_5"},{"key":"16_CR48","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2013.01.001","volume":"478","author":"B Libert","year":"2013","unstructured":"Libert, B., Yung, M.: Adaptively secure non-interactive threshold cryptosystems. Theoret. Comput. Sci. 478, 76\u2013100 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.01.001","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree Residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"3","key":"16_CR50","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1145\/177492.177745","volume":"16","author":"M Reiter","year":"1994","unstructured":"Reiter, M., Birman, K.: How to securely replicate services. ACM TOPLAS 16(3), 986\u20131009 (1994)","journal-title":"ACM TOPLAS"},{"key":"16_CR51","doi-asserted-by":"publisher","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO 1984. Lecture Notes in Computer Science, vol.\u00a0196, pp. 47\u201353. Springer (1984). https:\/\/doi.org\/10.1007\/3-540-39568-7_5","DOI":"10.1007\/3-540-39568-7_5"},{"key":"16_CR52","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15","DOI":"10.1007\/3-540-45539-6_15"},{"key":"16_CR53","unstructured":"Shoup, V.: Back to the future: simple threshold decryption secure against adaptive corruptions. Cryptology ePrint Archive, Paper 2025\/1578 (2025). https:\/\/eprint.iacr.org\/2025\/1578"},{"issue":"2","key":"16_CR54","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V Shoup","year":"2002","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptol. 15(2), 75\u201396 (2002)","journal-title":"J. Cryptol."},{"key":"16_CR55","unstructured":"Suegami, S., Ashizawa, S., Shibano, K.: Constant-cost batched partial decryption in threshold encryption. ePrint 2024\/762 (2024). https:\/\/eprint.iacr.org\/2024\/762"},{"key":"16_CR56","unstructured":"de\u00a0Valence, H.: The Penumbra protocol (2021)"},{"key":"16_CR57","doi-asserted-by":"crossref","unstructured":"Wee, H.: Threshold and revocation cryptosystems via extractable hash proofs. In: EUROCRYPT 2011, pp. 589\u2013609. Springer-Verlag (2011)","DOI":"10.1007\/978-3-642-20465-4_32"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5119-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:44:47Z","timestamp":1765057487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5119-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,7]]},"ISBN":["9789819551187","9789819551194"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5119-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,7]]},"assertion":[{"value":"7 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}