{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:15:13Z","timestamp":1767863713094,"version":"3.49.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031308710","type":"print"},{"value":"9783031308727","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-3-031-30872-7_16","type":"book-chapter","created":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:03:56Z","timestamp":1681808636000},"page":"415-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Merkle Tree Ladder Mode: Reducing the Size Impact of NIST PQC Signature Algorithms in Practice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5760-9197","authenticated-orcid":false,"given":"Andrew","family":"Fregly","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9047-9320","authenticated-orcid":false,"given":"Joseph","family":"Harvey","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1233-5380","authenticated-orcid":false,"given":"Burton S.","family":"Kaliski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0075-7914","authenticated-orcid":false,"given":"Swapneel","family":"Sheth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,19]]},"reference":[{"key":"16_CR1","unstructured":"Post-quantum cryptography standardization, NIST. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization. Accessed 13 Feb 2023"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., et al.: NIST IR 8413-upd1: status report on the third round of the NIST post-quantum cryptography standardization process. NIST (2022); includes updates as of 26 Sept 2022. https:\/\/doi.org\/10.6028\/NIST.IR.8413-upd1. Accessed 13 Feb 2023","DOI":"10.6028\/NIST.IR.8413-upd1"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Cooper, D.A., Apon, D., Dang, Q.H., Davidson, M.S., Dworkin, M.J., Miller, C.A.: NIST special publication 800208: recommendation for stateful hash-based signature schemes. NIST (2020). https:\/\/doi.org\/10.6028\/NIST.SP.800-208","DOI":"10.6028\/NIST.SP.800-208"},{"key":"16_CR4","unstructured":"Announcing the Commercial National Security Algorithm suite 2.0, National Security Agency. https:\/\/media.defense.gov\/2022\/Sep\/07\/2003071834\/-1\/-1\/0\/CSA_CNSA_2.0_ALGORITHMS_.PDF. Accessed 13 Feb 2023"},{"key":"16_CR5","unstructured":"Migration to post-quantum cryptography. NIST National Cybersecurity Center of Excellence. https:\/\/www.nccoe.nist.gov\/crypto-agility-considerations-migrating-post-quantum-cryptographic-algorithms. Accessed 13 Feb 2023"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Wouters, P., Sury, O: RFC 8624, Algorithm implementation requirements and usage guidance for DNSSEC. IETF (2019). https:\/\/doi.org\/10.17487\/RFC8624","DOI":"10.17487\/RFC8624"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Cooper, D., Santesson, S., Farrell, S., Boeyen, S., Housley, R., Polk, W.: RFC 5280, Internet X.509 public key infrastructure certificate and certificate revocation list (CRL) profile. IETF (2008). https:\/\/doi.org\/10.17487\/RFC5280","DOI":"10.17487\/RFC5280"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Arends, R., Austein, R., Larson, M., Massey, D., Rose, S.: DNS security introduction and requirements. IETF (2005). https:\/\/doi.org\/10.17487\/RFC4033","DOI":"10.17487\/RFC4033"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Laurie, B., Messeri, E., Stradling, R.: RFC 9162: Certificate transparency version 2.0. IETF (2021). https:\/\/doi.org\/10.17487\/RFC9162","DOI":"10.17487\/RFC9162"},{"key":"16_CR10","unstructured":"Merkle, R.: Secrecy, authentication, and public key systems. Ph.D. thesis, Stanford University (1979). http:\/\/www.ralphmerkle.com\/papers\/Thesis1979.pdf. Accessed 13 Feb 2023"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"FIPS PUB 81: DES modes of operation. National Bureau of Standards, U.S. Department of Commerce (1980). https:\/\/doi.org\/10.6028\/NBS.FIPS.81","DOI":"10.6028\/NBS.FIPS.81"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-49384-7_15","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"A H\u00fclsing","year":"2016","unstructured":"H\u00fclsing, A., Rijneveld, J., Song, F.: Mitigating multi-target attacks in hash-based signatures. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 387\u2013416. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_15"},{"key":"16_CR13","unstructured":"Fluhrer, S.: Further analysis of a proposed hash-based signature standard. In: Cryptology ePrint Archive, Paper 2017\/553. https:\/\/eprint.iacr.org\/2017\/553. Accessed 13 Feb 2023"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-49100-4_12","volume-title":"Security Standardisation Research","author":"J Katz","year":"2016","unstructured":"Katz, J.: Analysis of a proposed hash-based signature standard. In: Chen, L., McGrew, D., Mitchell, C. (eds.) SSR 2016. LNCS, vol. 10074, pp. 261\u2013273. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49100-4_12"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-030-92062-3_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"AB Grilo","year":"2021","unstructured":"Grilo, A.B., H\u00f6velmanns, K., H\u00fclsing, A., Majenz, C.: Tight adaptive reprogramming in\u00a0the\u00a0QROM. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 637\u2013667. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_22"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Bos, J.W., H\u00fclsing, A., Renes, J., van Vredendaal, C.: Rapidly verifiable XMSS signatures, Cryptology ePrint archive, paper 2020\/898. https:\/\/eprint.iacr.org\/2020\/898. Accessed 13 Feb 2023","DOI":"10.46586\/tches.v2021.i1.137-168"},{"key":"16_CR17","unstructured":"Submission requirements and evaluation criteria for the post-quantum cryptography standardization process, NIST. https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf. Accessed 13 Feb 2023"},{"key":"16_CR18","unstructured":"Bai, S., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P. et al.: CRYSTALS-dilithium algorithm specifications and supporting documentation (Version 3.1). 08 Feb 2021. https:\/\/pq-crystals.org\/dilithium\/data\/dilithium-specification-round3-20210208.pdf. Accessed 13 Feb 2023"},{"key":"16_CR19","unstructured":"Fouque, P.-A., Hoffstein, J., Kirchner, P., Lyubashevsky, V., Pornin, T., Prest, T., et al.: Falcon: fast-Fourier lattice-based compact signatures over NTRU specification v1.2, 10 Jan 2020. https:\/\/falcon-sign.info\/falcon.pdf. Accessed 13 Feb 2023"},{"key":"16_CR20","unstructured":"Aumasson, J.-P., Bernstein, D.J., Beullens, W., Dobraunig, C., Eichlseder, M., Fluhrer, S., et al.: SPHINCS+ submission to the NIST post-quantum project, v.3.1., 10 June 2022. https:\/\/sphincs.org\/data\/sphincs+-r3.1-specification.pdf. Accessed 13 Feb 2023"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"McGrew, D., Curcio, M., Fluhrer, S.: RFC 8554, Leighton-Micali hash-based signatures. IETF (2019). https:\/\/doi.org\/10.17487\/RFC8554","DOI":"10.17487\/RFC8554"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Huelsing, A., Butin, D., Gazdag, S., Rijneveld, J., Mohaisen, A.: RFC8391, XMSS: eXtended Merkle signature scheme. IETF (2018). https:\/\/doi.org\/10.17487\/RFC8391","DOI":"10.17487\/RFC8391"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Mockapetris, P.: RFC 1034, Domain names - concepts and facilities. IETF (1987). https:\/\/doi.org\/10.17487\/RFC1034","DOI":"10.17487\/RFC1034"},{"key":"16_CR24","unstructured":"Day in the life of the internet traces, DNS-OARC. https:\/\/www.dns-oarc.net\/oarc\/data\/catalog. Accessed 13 Feb 2023"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Barker, W., Polk, W., Souppaya, M.: Getting ready for post-quantum cryptography: exploring challenges associated with adopting and using post-quantum cryptographic algorithms, NIST cybersecurity white paper. 25 April 2021. https:\/\/doi.org\/10.6028\/NIST.CSWP.04282021","DOI":"10.6028\/NIST.CSWP.04282021"},{"key":"16_CR26","unstructured":"Driscoll, F.: Terminology for post-quantum traditional hybrid schemes. https:\/\/datatracker.ietf.org\/doc\/draft-driscoll-pqt-hybrid-terminology. Accessed 13 Feb 2023. Work in progress"},{"key":"16_CR27","unstructured":"Champine, L.: Streaming Merkle proofs within binary numeral trees. In: Cryptology ePrint Archive, Paper 2021\/038. https:\/\/eprint.iacr.org\/2021\/038. Accessed 13 Feb 2023"},{"key":"16_CR28","unstructured":"Crosby, S., Wallach, D.: Efficient data structures for tamper-evident logging. In: Proceedings of the 18th USENIX Security Symposium, pp. 317\u2013334. USENIX Association (2009). https:\/\/dl.acm.org\/doi\/abs\/10.5555\/1855768.1855788"},{"key":"16_CR29","unstructured":"Todd, P.: Merkle mountain ranges. https:\/\/github.com\/opentimestamps\/opentimestamps-server\/blob\/master\/doc\/merkle-mountain-range.md. Accessed 13 Feb 2023"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Kiffer, L., Luu, L., Zamani, M.: FlyClient: super-light clients for cryptocurrencies. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 928\u2013946. IEEE (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00049","DOI":"10.1109\/SP40000.2020.00049"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"J Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_24"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-44618-9_16","volume-title":"Security and Cryptography for Networks","author":"L Reyzin","year":"2016","unstructured":"Reyzin, L., Yakoubov, S.: Efficient asynchronous accumulators for distributed PKI. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 292\u2013309. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_16"},{"key":"16_CR33","unstructured":"Kuszmaul, J.: Verkle trees. https:\/\/math.mit.edu\/research\/highschool\/primes\/materials\/2018\/Kuszmaul.pdf. Accessed 13 Feb 2023"},{"key":"16_CR34","unstructured":"Buterik, V.: Verkle trees (2022). https:\/\/vitalik.ca\/general\/2021\/06\/18\/verkle.html. Accessed 13 Feb 2023"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-90456-2_16","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2021","unstructured":"Peikert, C., Pepin, Z., Sharp, C.: Vector and functional commitments from lattices. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 480\u2013511. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_16"},{"key":"16_CR37","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. In: Cryptology ePrint Archive, Paper (2018). https:\/\/eprint.iacr.org\/2018\/046. Accessed 13 Feb 2023"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"16_CR39","doi-asserted-by":"publisher","unstructured":"Khaburzaniya, I., Chalkias, K., Lewi, K., Malvai, H.: Aggregating and thresholdizing hash-based signatures using STARKs. In: Proceedings of the 2022 ACM Asia Conference on Computer and Communications Security, pp. 393\u2013407. ACM, New York (2022). https:\/\/doi.org\/10.1145\/3488932.3524128","DOI":"10.1145\/3488932.3524128"},{"key":"16_CR40","doi-asserted-by":"publisher","unstructured":"Goyal, R., Vaikuntanathan, V.: Locally verifiable signature and\u00a0key aggregation. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, LNCS, vol. 13508, pp. 761\u2013791. Springer , Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_26","DOI":"10.1007\/978-3-031-15979-4_26"},{"key":"16_CR41","unstructured":"Li, F., Yi, K., Hadjieleftheriou, M., Kollios, G.: Proof-infused streams: Enabling authentication of sliding window queries on streams. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 147\u2013158. VLDB Endowment (2007). https:\/\/dl.acm.org\/doi\/10.5555\/1325851.1325871"},{"key":"16_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-38348-9_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 353\u2013370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_22"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45708-9_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Stern","year":"2002","unstructured":"Stern, J., Pointcheval, D., Malone-Lee, J., Smart, N.P.: Flaws in applying proof methodologies to signature schemes. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 93\u2013110. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_7"},{"key":"16_CR44","doi-asserted-by":"publisher","unstructured":"Chase, M., Kohlweiss, M., Lysyanskaya, A., Meiklejohn, S.: Malleable signatures: new definitions and delegatable anonymous credentials. In: 2014 IEEE 27th Computer Security Foundations Symposium, pp. 199\u2013213. IEEE (2014). https:\/\/doi.org\/10.1109\/CSF.2014.22","DOI":"10.1109\/CSF.2014.22"},{"issue":"2","key":"16_CR45","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00145-014-9182-0","volume":"28","author":"JH Ahn","year":"2014","unstructured":"Ahn, J.H., Boneh, D., Camenisch, J., Hohenberger, S., Shelat, A., Waters, B.: Computing on authenticated data. J. Cryptol. 28(2), 351\u2013395 (2014). https:\/\/doi.org\/10.1007\/s00145-014-9182-0","journal-title":"J. Cryptol."},{"key":"16_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-34961-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"N Attrapadung","year":"2012","unstructured":"Attrapadung, N., Libert, B., Peters, T.: Computing on authenticated data: new privacy definitions and constructions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 367\u2013385. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_23"},{"key":"16_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-11212-1_18","volume-title":"Computer Security - ESORICS 2014","author":"C Decker","year":"2014","unstructured":"Decker, C., Wattenhofer, R.: Bitcoin transaction malleability and MtGox. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8713, pp. 313\u2013326. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11212-1_18"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Sikeridis, D., Kampanakis, P., Devetsikiotis, M.: Post-quantum authentication in TLS 1.3: a performance study. In: Network and Distributed Systems Security (NDSS) Symposium 2020. The Internet Society (2020). https:\/\/dx.doi.org\/10.14722\/ndss.2020.24203","DOI":"10.14722\/ndss.2020.24203"},{"key":"16_CR49","doi-asserted-by":"crossref","unstructured":"Sikeridis, D., Huntley, S., Ott, D., Devetsikiotis, M.: Intermediate certificate suppression in post-quantum TLS: an approximate membership querying approach. In: CoNEXT \u201922: Proceedings of the 18th International Conference on Emerging Networking EXperiments and Technologies, pp. 35\u201342. ACM (2022). https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3555050.3569127","DOI":"10.1145\/3555050.3569127"},{"key":"16_CR50","doi-asserted-by":"crossref","unstructured":"Kudinov, M., H\u00fclsing, A., Ronen, E., Yogev, E.: SPHINCS+C: compressing Sphincs+ with (almost) no cost. In: Cryptology ePrint Archive, Paper 2022\/778. https:\/\/eprint.iacr.org\/2022\/778. Accessed 13 Feb 2023","DOI":"10.1109\/SP46215.2023.10179381"},{"key":"16_CR51","unstructured":"Baldimtsi, F., Chalkias, K., Chatzigiannis, P., Kelkar, M.: Truncator: time-space tradeoff of cryptographic primitives. In: Cryptology ePrint Archive, Paper 2022\/1581. https:\/\/eprint.iacr.org\/2022\/1581. Accessed 13 Feb 2023"},{"key":"16_CR52","unstructured":"Draft call for additional digital signature schemes for the post-quantum cryptography standardization process, NIST (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf. Accessed 13 Feb 2023s"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30872-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T21:08:47Z","timestamp":1702242527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30872-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308710","9783031308727"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30872-7_16","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 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"24 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ct-rsa-2023.eecs.oregonstate.edu\/","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":"76","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":"26","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":"34% - 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":"6","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)"}}]}}