{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T18:11:15Z","timestamp":1765303875069,"version":"3.41.2"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031385568"},{"type":"electronic","value":"9783031385575"}],"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-38557-5_21","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"646-677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Two-Round Stateless Deterministic Two-Party Schnorr Signatures from\u00a0Pseudorandom Correlation Functions"],"prefix":"10.1007","author":[{"given":"Yashvanth","family":"Kondi","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[]},{"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-84242-0_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"H K\u0131l\u0131n\u00e7 Alper","year":"2021","unstructured":"K\u0131l\u0131n\u00e7 Alper, H., Burdges, J.: Two-round trip schnorr multi-signatures via delinearized witnesses. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 157\u2013188. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_7"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-70936-7_8","volume-title":"Theory of Cryptography","author":"Y Aumann","year":"2007","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 137\u2013156. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_8"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, 22\u201326 May 2022, pp. 2554\u20132572. IEEE (2022)","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Novaes, F.R., Takahashi, A., Tibouchi, M., Yarom, Y.: LadderLeak: breaking ECDSA with less than one bit of nonce leakage. In: ACM CCS 2020, November 2020","DOI":"10.1145\/3372297.3417268"},{"key":"21_CR5","unstructured":"Barwood, G.: Digital signatures using elliptic curves, message 32f519ad. 19609226@news.dial.pipex.com posted to sci.crypt., (1997)"},{"key":"21_CR6","unstructured":"Barker, E.: Recommendation for key management: Part 1 - general. Technical Report NIST Special Publication (SP) 800\u201357, Part 1, Rev. 5, National Institute of Standards and Technology, Gaithersburg, MD (2020)"},{"key":"21_CR7","doi-asserted-by":"crossref","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, May 2018","DOI":"10.1109\/SP.2018.00020"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st FOCS, November (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Brandenburger, M., Cachin, C., Lorenz, M., Kapitza, R.: Rollback and forking detection for trusted execution environments using lightweight collective memory. In: DSN 2017 (2017)","DOI":"10.1109\/DSN.2017.45"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o, L.T.A.N., Davidson, M.: NISTIR 8214B, Notes on Threshold EdDSA\/Schnorr Signatures (2022). https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214b\/draft","DOI":"10.6028\/NIST.IR.8214B.ipd"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B-Y :. High-speed high-security signatures. In CHES 2011, September\/October (2011)","DOI":"10.1007\/978-3-642-23951-9_9"},{"issue":"6","key":"21_CR12","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10207-021-00539-6","volume":"20","author":"C Bonte","year":"2021","unstructured":"Bonte, C., Smart, N.P., Tanguy, T.: Thresholdizing hasheddsa: MPC to the rescue. Int. J. Inf. Sec. 20(6), 879\u2013894 (2021)","journal-title":"Int. J. Inf. Sec."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: ACM CCS 2020, November 2020","DOI":"10.1145\/3372297.3423367"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-77883-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., Reichle, M.: Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 247\u2013277. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Drijvers, M., et al.: On the security of two-round multi-signatures. In: 2019 IEEE Symposium on Security and Privacy, May 2019","DOI":"10.1109\/SP.2019.00050"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"Y Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120\u2013127. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_8"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-53015-3_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky Encryption and Its Applications. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part III. LNCS, vol. 9816, pp. 93\u2013122. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-030-59013-0_32","volume-title":"Computer Security \u2013 ESORICS 2020","author":"A Dalskov","year":"2020","unstructured":"Dalskov, A., Orlandi, C., Keller, M., Shrishak, K., Shulman, H.: Securing DNSSEC keys via threshold ECDSA from generic MPC. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020, Part II. LNCS, vol. 12309, pp. 654\u2013673. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_32"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Everspaugh, A., Zhai, Y., Jellinek, R., Ristenpart, T., Swift, M.: Not-so-random numbers in virtualized Linux and the whirlwind RNG. In: 2014 IEEE Symposium on Security and Privacy, May 2014","DOI":"10.1109\/SP.2014.42"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: ACM CCS 2018, October 2018","DOI":"10.1145\/3243734.3243859"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 116\u2013129. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_8"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2006","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptology 20(1), 51\u201383 (2006). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"J. Cryptology"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-84242-0_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"F Garillot","year":"2021","unstructured":"Garillot, F., Kondi, Y., Mohassel, P., Nikolaenko, V.: Threshold Schnorr with stateless deterministic signing from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_6"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-47721-7_11","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"O Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 171\u2013185. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_11"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Heninger, N.: RSA, DH and DSA in the Wild. In: Bos, J., Stam, M. (eds.), Computational Cryptography, chapter 6, pp. 140\u2013181. Cambridge University Press (2022)","DOI":"10.1017\/9781108854207.008"},{"issue":"3","key":"21_CR27","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N., Smart, N.P.: Lattice attacks on digital signature schemes. Des. Codes Cryptogr. 23(3), 283\u2013290 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: ACM CCS 2013, November 2013","DOI":"10.1145\/2508859.2516662"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Kumari, R., Alimomeni, M., Safavi-Naini, R.: Performance analysis of Linux RNG in virtualized environments. In: ACM Workshop on Cloud Computing Security Workshop - CCSW 2015, New York, USA (2015)","DOI":"10.1145\/2808425.2808434"},{"issue":"October","key":"21_CR31","first-page":"21","volume":"2020","author":"C Komlo","year":"2020","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized Schnorr threshold signatures. SAC 2020(October), 21\u201323 (2020)","journal-title":"SAC"},{"key":"21_CR32","unstructured":"Lindell, Y.: Simple three-round multiparty schnorr signing with full simulatability. Cryptology ePrint Archive, Report 2022\/374 (2022). http:\/\/eprint.iacr.org\/2022\/374"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: ACM CCS 2018, October 2018","DOI":"10.1145\/3243734.3243788"},{"key":"21_CR34","unstructured":"Matetic, S., et al.: ROTE: rollback protection for trusted execution. In: USENIX Security 2017, August 2017"},{"key":"21_CR35","unstructured":"De Micheli, G., Heninger, N.: Recovering cryptographic keys from partial information, by example. Cryptology ePrint Archive, Report 2020\/1506 (2020). https:\/\/eprint.iacr.org\/2020\/1506"},{"issue":"9","key":"21_CR36","doi-asserted-by":"publisher","first-page":"2139","DOI":"10.1007\/s10623-019-00608-x","volume":"87","author":"G Maxwell","year":"2019","unstructured":"Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple schnorr multi-signatures with applications to bitcoin. Des. Codes Cryptography 87(9), 2139\u20132164 (2019)","journal-title":"Des. Codes Cryptography"},{"key":"21_CR37","unstructured":"Nicolosi, A., Krohn, M.N., Dodis, Y., Mazieres, D.: Proactive two-party signatures for user authentication. In: NDSS 2003, February 2003"},{"key":"21_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Nick","year":"2021","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round Schnorr multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 189\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: schnorr multi-signatures with verifiably deterministic nonces. In: ACM CCS 2020, November 2020","DOI":"10.1145\/3372297.3417236"},{"key":"21_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-030-77870-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Orlandi","year":"2021","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of Paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24"},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522\u2013526. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Parno, B., Lorch, J.R., Douceur, J.R., Mickens, J.W., McCune, J.M.: Memoir: practical state continuity for protected modules. In: 2011 IEEE Symposium on Security and Privacy, May 2011","DOI":"10.1109\/SP.2011.38"},{"key":"21_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387\u2013398. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_33"},{"key":"21_CR44","unstructured":"Roy, L.: SoftSpokenOT: communication-computation tradeoffs in OT extension. In: CRYPTO 2022 (2022)"},{"key":"21_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-030-84252-9_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"L Roy","year":"2021","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 687\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_23"},{"issue":"3","key":"21_CR46","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptology 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J. Cryptology"},{"key":"21_CR47","unstructured":"Strackx, R., Piessens, F.: Ariadne: a minimal approach to state continuity. In: USENIX Security 2016, August 2016"},{"key":"21_CR48","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., Strobl, R.: Provably secure distributed Schnorr signatures and a $$(t, n)$$ threshold scheme for implicit certificates. In: ACISP 01, July 2001","DOI":"10.1007\/3-540-47719-5_33"},{"key":"21_CR49","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Alaoui, Y.T.: Distributing any elliptic curve based protocol. In: 17th IMA International Conference on Cryptography and Coding, December 2019","DOI":"10.1007\/978-3-030-35199-1_17"},{"key":"21_CR50","unstructured":"Wigley, J.: Removing need for RNG in signatures, message 5gov5d\\$pad@wapping.ecs.soton.ac.uk posted to sci.crypt (1997). https:\/\/groups.google.com\/group\/sci.crypt\/msg\/a6da45bcc8939a89"},{"key":"21_CR51","unstructured":"Wuille, P., Nick, J., Ruffing, T.: BIP 340: Schnorr signatures for secp256k1. https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0340.mediawiki"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38557-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:28Z","timestamp":1753567348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38557-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385568","9783031385575"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38557-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, 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":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.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":"479","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":"124","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":"26% - 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":"15","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)"}}]}}