{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T06:43:48Z","timestamp":1769237028886,"version":"3.49.0"},"publisher-location":"Cham","reference-count":78,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229688","type":"print"},{"value":"9783031229695","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22969-5_17","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"487-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Short-lived Zero-Knowledge Proofs and\u00a0Signatures"],"prefix":"10.1007","author":[{"given":"Arasu","family":"Arun","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Bonneau","sequence":"additional","affiliation":[]},{"given":"Jeremy","family":"Clark","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"The digital signature standard: communications of the ACM 35(7), 36\u201340 (1992)","DOI":"10.1145\/129902.129904"},{"key":"17_CR2","unstructured":"Drand Randomness Beacon. drand.love (2021)"},{"key":"17_CR3","unstructured":"ElectionGuard. https:\/\/github.com\/microsoft\/electionguard (2021)"},{"key":"17_CR4","unstructured":"NIST Randomness Beacon Version 2.0. https:\/\/beacon.nist.gov\/home (2021)"},{"key":"17_CR5","unstructured":"Adida, B.: Helios: Web-based Open-audit Voting. In: USENIX Security (2008)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Ganesh, C., Mohassel, P.: Non-interactive zero-knowledge proofs for composite statements. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Arun, A., Bonneau, J., Clark, J.: Short-lived zero-knowledge proofs and signatures. Cryptology ePrint Archive, Paper 2022\/190 (2022)","DOI":"10.1007\/978-3-031-22969-5_17"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Indistinguishable Proofs of Work or Knowledge. In: Eurocrypt (2016)","DOI":"10.1007\/978-3-662-53890-6_30"},{"key":"17_CR9","unstructured":"Barker, E., Dang, Q.: Recommendation for Key Management. NIST Special Publication 800\u2013857 (2015)"},{"key":"17_CR10","unstructured":"Beck, G., Choudhuri, A.R., Green, M., Jain, A., Tiwari, P.R.: Time-deniable signatures. Cryptology ePrint Archive, Paper 2022\/1018 (2022)"},{"key":"17_CR11","unstructured":"Bell, S., et al.: STAR-Vote: a secure, transparent, auditable, and reliable voting system. In: JETS (2013)"},{"key":"17_CR12","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/46 (2018)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"17_CR14","unstructured":"Benaloh, J.: Ballot casting assurance via voter-initiated poll station auditing. In: EVT (2007)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: CRYPTO (2000)","DOI":"10.1007\/3-540-44598-6_15"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. Cryptology ePrint Archive, Report 2018\/712 (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Eurocrypt (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"17_CR20","unstructured":"Bonneau, J., Clark, J., Goldfeder, S.: On Bitcoin as a public randomness source. Cryptology ePrint Archive, Report 2015\/1015 (2015)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Borisov, N., Goldberg, I., Brewer, E.: Off-the-record communication, or, why not to use PGP. In: ACM WPES (2004)","DOI":"10.1145\/1029179.1029200"},{"key":"17_CR22","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: IEEE Security & Privacy (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., Visconti, I.: Improved OR Composition of Sigma-Protocols. In: TCC (2016)","DOI":"10.1007\/978-3-662-49896-5_3"},{"key":"17_CR26","unstructured":"Clark, J., Hengartner, U.: On the use of financial data as a random beacon. In: EVT\/WOTE (2010)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Clark, J., van Oorschot, P.C., Ruoti, S., Seamons, K., Zappala, D.: SoK: securing email: a stakeholder-based analysis. In: Financial Cryptography (2021)","DOI":"10.1007\/978-3-662-64322-8_18"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Cohen, B., Pietrzak, K.: Simple Proofs of Sequential Work. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-78375-8_15"},{"key":"17_CR29","unstructured":"Cohen, B., Pietrzak, K.: The Chia network blockchain (2019)"},{"key":"17_CR30","unstructured":"Colburn, M.: Short-lived signatures. Master\u2019s thesis, Concordia University (2018)"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., Reichle, M.: Efficient range proofs with transparent setup from bounded integer commitments. In: Eurocrypt (2021)","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"17_CR32","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO (1994)"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Yum, D.H.: Time capsule signature. In: Financial Cryptography (2005)","DOI":"10.1007\/11507840_6"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Durumeric, Z., et al.: Neither snow nor rain nor MITM: an empirical analysis of email delivery security. In: ACM CCS (2015)","DOI":"10.1145\/2815675.2815695"},{"key":"17_CR35","unstructured":"Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Mail. In: CRYPTO (1992)"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-45727-3_5"},{"key":"17_CR37","unstructured":"Feo, L.D., Masson, S., Petit, C., Sanso, A.: Verifiable Delay Functions from Supersingular Isogenies and Pairings. Cryptology ePrint Archive, Report 2019\/166 (2019)"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Ferradi, H., G\u00e9raud, R., Naccache, D.: slow motion zero knowledge identifying with colliding commitments. In: ICISC (2015)","DOI":"10.1007\/978-3-319-38898-4_22"},{"key":"17_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"17_CR40","unstructured":"Foundation, E.: Ethereum 2.0 Beacon Chain (2020)"},{"key":"17_CR41","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019)"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"17_CR43","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. JACM 38(3) (1991)","DOI":"10.1145\/116825.116852"},{"key":"17_CR44","unstructured":"Goyal, V., Raizes, J., Soni, P.: Time-traveling simulators using blockchains and their applications. Cryptology ePrint Archive, Paper 2022\/035 (2022)"},{"key":"17_CR45","unstructured":"Green, M.: Ok Google: please publish your DKIM secret keys (November 2020)"},{"key":"17_CR46","doi-asserted-by":"crossref","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Eurocrypt (2010)","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"17_CR47","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: CRYPTO (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"17_CR48","doi-asserted-by":"crossref","unstructured":"Halderman, J.A., Waters, B.: Harvesting verifiable challenges from oblivious online sources. In: CCS (2007)","DOI":"10.1145\/1315245.1315287"},{"key":"17_CR49","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Eurocrypt (1996)","DOI":"10.1007\/3-540-68339-9_13"},{"key":"17_CR50","unstructured":"Jaques, S., Montgomery, H., Roy, A.: Time-release cryptography from minimal circuit assumptions. Cryptology ePrint Archive, Report 2020\/755 (2020)"},{"key":"17_CR51","doi-asserted-by":"crossref","unstructured":"Johnson, D., Menezes, A., Vanstone, S.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1(1) (2001)","DOI":"10.1007\/s102070100002"},{"key":"17_CR52","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS (2000)"},{"key":"17_CR53","doi-asserted-by":"crossref","unstructured":"Kucherawy, M., Crocker, D., Hansen, T.: DomainKeys identified mail (DKIM) signatures. RFC 6376 (2011)","DOI":"10.17487\/rfc6376"},{"key":"17_CR54","doi-asserted-by":"crossref","unstructured":"Landerreche, E., Stevens, M., Schaffner, C.: Non-interactive cryptographic timestamping based on verifiable delay functions. In: Financial Cryptography (2020)","DOI":"10.1007\/978-3-030-51280-4_29"},{"issue":"4","key":"17_CR55","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1504\/IJACT.2017.089354","volume":"3","author":"AK Lenstra","year":"2017","unstructured":"Lenstra, A.K., Wesolowski, B.: Trustworthy public randomness with sloth, unicorn, and trx. Int. J. Appl. Crypto. 3(4), 330\u2013343 (2017)","journal-title":"Int. J. Appl. Crypto."},{"key":"17_CR56","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Publicly verifiable proofs of sequential work. In: ITCS (2013)","DOI":"10.1145\/2422436.2422479"},{"key":"17_CR57","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: homomorphic time-lock puzzles and applications. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26948-7_22"},{"key":"17_CR58","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"17_CR59","doi-asserted-by":"crossref","unstructured":"Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: CRYPTO (2006)","DOI":"10.1007\/11818175_22"},{"key":"17_CR60","unstructured":"Neff, C.A.: Practical high certainty intent verification for encrypted votes. Tech. rep, VoteHere Whitepaper (2004)"},{"key":"17_CR61","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Eurocrypt (1998)","DOI":"10.1007\/BFb0054135"},{"key":"17_CR62","unstructured":"Ozdemir, A., Wahby, R., Whitehat, B., Boneh, D.: Scaling verifiable computation using efficient set accumulators. In: USENIX Security (2020)"},{"key":"17_CR63","doi-asserted-by":"crossref","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: CRYPTO (2003)","DOI":"10.1007\/978-3-540-45146-4_19"},{"key":"17_CR64","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS (2018)"},{"key":"17_CR65","doi-asserted-by":"crossref","unstructured":"Rabin, M.: Transaction protection by Beacons. J. Comput. Syst. Sci. 27(2) (1983)","DOI":"10.1016\/0022-0000(83)90042-9"},{"key":"17_CR66","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Tech. Rep. TR-684, MIT (1996)"},{"key":"17_CR67","unstructured":"Rivest, R.L.: Description of the LCS35 time capsule crypto-puzzle. https:\/\/people.csail.mit.edu\/rivest\/lcs35-puzzle-description.txt (1999)"},{"key":"17_CR68","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2) (1978)","DOI":"10.1145\/359340.359342"},{"key":"17_CR69","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Asiacrypt (2001)","DOI":"10.1007\/3-540-45682-1_32"},{"issue":"3","key":"17_CR70","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. Crypto. 4(3), 161\u2013174 (1991)","journal-title":"J. Crypto."},{"key":"17_CR71","doi-asserted-by":"crossref","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"17_CR72","unstructured":"Specter, M.A., Park, S., Green, M.: KeyForge: non-attributable email from forward-forgeable signatures. In: USENIX Security (2021)"},{"key":"17_CR73","doi-asserted-by":"crossref","unstructured":"Syta, E., et al.: Scalable bias-resistant distributed randomness. In: IEEE Security & Privacy (2017)","DOI":"10.1109\/SP.2017.45"},{"key":"17_CR74","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge (2021)","DOI":"10.1561\/9781638281252"},{"key":"17_CR75","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A.K., Bhat, A., Malavolta, G., D\u00f6ttling, N., Kate, A., Schr\u00f6der, D.: Verifiable timed signatures made practical. In: ACM CCS (2020)","DOI":"10.1145\/3372297.3417263"},{"key":"17_CR76","unstructured":"Wesolowski, B.: A proof of time or knowledge. https:\/\/hal.archives-ouvertes.fr\/hal-03380471"},{"key":"17_CR77","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Eurocrypt (2019)","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"17_CR78","unstructured":"\u00d6zt\u00fcrk, E.: Modular multiplication algorithm suitable for low-latency circuit implementations. Cryptology ePrint Archive, Paper 2019\/826 (2019)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22969-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:56Z","timestamp":1769216576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22969-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229688","9783031229695"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22969-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"27% - 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":"10","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"}]}}