{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:55:19Z","timestamp":1742982919557,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904012"},{"type":"electronic","value":"9783030904029"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90402-9_21","type":"book-chapter","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:03:09Z","timestamp":1635811389000},"page":"376-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Turn-Based Communication Channels"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Brunetta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Larangeira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bei","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Alwen, J., Tackmann, B.: Moderately hard functions: definition, instantiations, and applications. In: TCC (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_17","DOI":"10.1007\/978-3-319-70500-2_17"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Azar, P.D., Goldwasser, S., Park, S.: How to incentivize data-driven collaboration among competing parties. In: ITCS (2016). https:\/\/doi.org\/10.1145\/2840728.2840758","DOI":"10.1145\/2840728.2840758"},{"key":"21_CR3","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: time and relative delays in simulation. Technical Report 537 (2020)"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Bentov, I., Gabizon, A., Mizrahi, A.: Cryptocurrencies without proof of work. In: FC (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_10","DOI":"10.1007\/978-3-662-53357-4_10"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: ITCS (2016). https:\/\/doi.org\/10.1145\/2840728.2840745","DOI":"10.1145\/2840728.2840745"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: CRYPTO, vol. 10991 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: CRYPTO (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_20","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: CRYPTO (2000)","DOI":"10.1007\/3-540-44598-6_15"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. J. ACM 51(6) (2004). https:\/\/doi.org\/10.1145\/1039488.1039489","DOI":"10.1145\/1039488.1039489"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10","DOI":"10.1007\/978-3-662-46803-6_10"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00145-007-0567-1","volume":"20","author":"YT Kalai","year":"2007","unstructured":"Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent composition of secure protocols in the timing model. J. Cryptol. 20(4), 431\u2013492 (2007). https:\/\/doi.org\/10.1007\/s00145-007-0567-1","journal-title":"J. Cryptol."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to modern cryptography (2014)","DOI":"10.1201\/b17668"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: TCC. https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"21_CR14","unstructured":"Katz, J., Miller, A., Shi, E.: Pseudonymous broadcast and secure computation from cryptographic puzzles. Cryptology ePrint Archive, Report 2014\/857 (2014). https:\/\/eprint.iacr.org\/2014\/857"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: CRYPTO, vol. 10401 (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"21_CR16","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015\/366 (2015). https:\/\/eprint.iacr.org\/2015\/366"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: CRYPTO (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_3","DOI":"10.1007\/978-3-642-22792-9_3"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: CRYPTO (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22","DOI":"10.1007\/978-3-030-26948-7_22"},{"key":"21_CR19","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, Massachusetts Institute of Technology (1996)"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Scafuro, A., Siniscalchi, L., Visconti, I.: Publicly verifiable proofs from blockchains. In: PKC (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_13","DOI":"10.1007\/978-3-030-17253-4_13"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: EUROCRYPT (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13","DOI":"10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90402-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:04:34Z","timestamp":1635811474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90402-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904012","9783030904029"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90402-9_21","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":"2 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"5 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/provsec2021.scau.edu.cn\/index\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","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":"21","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":"31% - 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":"4","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)"}}]}}