{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:34:20Z","timestamp":1742945660868,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904586"},{"type":"electronic","value":"9783030904593"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90459-3_19","type":"book-chapter","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T21:34:31Z","timestamp":1636148071000},"page":"558-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Expected Polynomial Runtime in Cryptography"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kloo\u00df","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA, pp. 106\u2013115. IEEE Computer Society (2001). doi: 10.1109\/SFCS.2001.959885. https:\/\/doi.org\/10.1109\/SFCS.2001.959885","DOI":"10.1109\/SFCS.2001.959885"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703427975","volume":"33","author":"B Barak","year":"2004","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. SIAM J. Comput. 33(4), 738\u2013818 (2004)","journal-title":"SIAM J. Comput."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: Average-case complexity. Found. Trends Theoretical Comput. Sci. 2(1) (2006). doi: 10.1561\/04000000049:34 AM 10\/21\/2021","DOI":"10.1561\/0400000004"},{"key":"19_CR4","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography (2020). https:\/\/toc.cryptobook.us\/. Version 0.5"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-662-46494-6_4","volume-title":"Theory of Cryptography","author":"K-M Chung","year":"2015","unstructured":"Chung, K.-M., Lui, E., Pass, R.: From Weak to Strong Zero-Knowledge and Applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 66\u201392. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_4"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-34129-8_16","volume-title":"Information and Communications Security","author":"N Ding","year":"2012","unstructured":"Ding, N., Gu, D.: On Constant-Round Precise Zero-Knowledge. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 178\u2013190. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34129-8_16"},{"issue":"6","key":"19_CR8","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/950620.950623","volume":"50","author":"C Dwork","year":"2003","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. J. ACM 50(6), 852\u2013921 (2003)","journal-title":"J. ACM"},{"key":"19_CR9","unstructured":"Feige, U.: Alternative models for zero-knowledge interactive proofs. Ph.D. thesis, Weizmann Institute of Science (1990)"},{"key":"19_CR10","first-page":"610","volume":"2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. IACR Cryptol. ePrint Arch. 2010, 610 (2010)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O Goldreich","year":"1993","unstructured":"Goldreich, O.: A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptology 6(1), 21\u201353 (1993). https:\/\/doi.org\/10.1007\/BF02620230","journal-title":"Journal of Cryptology"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-22670-0_29","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Average case complexity, revisited. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 422\u2013450. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_29"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-22670-0_21","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Notes on levin\u2019s theory of average-case complexity. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 233\u2013247. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_21"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-009-9050-5","volume":"23","author":"O Goldreich","year":"2010","unstructured":"Goldreich, O.: On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits. J. Cryptology 23(1), 1\u201336 (2010)","journal-title":"J. Cryptology"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00208001","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology 9(3), 167\u2013189 (1996). https:\/\/doi.org\/10.1007\/BF00208001","journal-title":"Journal of Cryptology"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In: FOCS, pp. 174\u2013187. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"19_CR17","unstructured":"Halevi, S., Micali, S.: More on proofs of knowledge. IACR Cryptol. ePrint Arch., 1998:15 (1998). http:\/\/eprint.iacr.org\/1998\/015"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00145-012-9127-4","volume":"26","author":"D Hofheinz","year":"2013","unstructured":"Hofheinz, D., Unruh, D., M\u00fcller-Quade, J.: Polynomial runtime and composability. J. Cryptology 26(3), 375\u2013441 (2013)","journal-title":"J. Cryptology"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00145-007-9004-8","volume":"21","author":"J Katz","year":"2008","unstructured":"Katz, J., Lindell, Y.: Handling expected polynomial-time strategies in simulation-based security proofs. J. Cryptology 21(3), 303\u2013349 (2008)","journal-title":"J. Cryptology"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC, pp. 560\u2013569. ACM (2001)","DOI":"10.1145\/380752.380851"},{"key":"19_CR21","unstructured":"Kloo\u00df, M.: On (expected polynomial) runtime in cryptography. IACR Cryptol. ePrint Arch., p. 809 (2020). https:\/\/eprint.iacr.org\/2020\/809"},{"key":"19_CR22","first-page":"1187","volume":"2020","author":"D Lanzenberger","year":"2020","unstructured":"Lanzenberger, D., Maurer, U.: Coupling of random systems. IACR Cryptol. ePrint Arch. 2020, 1187 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"LA Levin","year":"1986","unstructured":"Levin, L.A.: Average case complete problems. SIAM J. Comput. 15(1), 285\u2013286 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"19_CR24","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s00145-012-9132-7","volume":"26","author":"Y Lindell","year":"2013","unstructured":"Lindell, Y.: A note on constant-round zero-knowledge proofs of knowledge. J. Cryptol. 26(4), 638\u2013654 (2013)","journal-title":"J. Cryptol."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: STOC, pp. 306\u2013315. ACM (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On Cryptographic Assumptions and Challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6"},{"key":"19_CR27","unstructured":"Pass, R.: A precise computational approach to knowledge. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (2006)"},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00145-012-9137-2","volume":"27","author":"R Pass","year":"2014","unstructured":"Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Concurrent zero knowledge, revisited. J. Cryptology 27(1), 45\u201366 (2014)","journal-title":"J. Cryptology"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-24638-1_11","volume-title":"Theory of Cryptography","author":"A Rosen","year":"2004","unstructured":"Rosen, A.: A Note on Constant-Round Zero-Knowledge Proofs for NP. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 191\u2013202. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_11"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90459-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:04:31Z","timestamp":1730765071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90459-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904586","9783030904593"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90459-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Raleigh, NC","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"66","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":"41% - 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":"4","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":"16","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)"}}]}}