{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:29:40Z","timestamp":1766269780763,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031061554"},{"type":"electronic","value":"9783031061561"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06156-1_20","type":"book-chapter","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T20:29:39Z","timestamp":1654720179000},"page":"243-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards a\u00a0Broadcast Time-Lock Based Token Exchange Protocol"],"prefix":"10.1007","author":[{"given":"Fadi","family":"Barb\u00e0ra","sequence":"first","affiliation":[]},{"given":"Nadir","family":"Murru","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Schifanella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ali, I.M., Caprolu, M., Di Pietro, R.: Foundations, properties, and security applications of puzzles: a survey. arXiv:1904.10164 [cs], April 2020","DOI":"10.1145\/3396374"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: Proceedings of Security and Privacy-1998 IEEE Symposium on Security and Privacy, Oakland, CA, USA, 3\u20136 May 1998, pp. 86\u201399. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/SECPRI.1998.674826","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"20_CR3","unstructured":"Back, A., et al.: Enabling blockchain innovations with pegged sidechains. Whitepaper, p. 25 (2014)"},{"key":"20_CR4","unstructured":"Bellare, M., Goldwasser, S.: Encapsulated key escrow. Technical report, Massachusetts Institute of Technology (1996)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ffa.2016.01.011","volume":"39","author":"E Bellini","year":"2016","unstructured":"Bellini, E., Murru, N.: An efficient and secure RSA-like cryptosystem exploiting R\u00e9dei rational functions over conics. Finite Fields Appl. 39, 179\u2013194 (2016). https:\/\/doi.org\/10.1016\/j.ffa.2016.01.011","journal-title":"Finite Fields Appl."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology\u2013CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology\u2014CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15"},{"key":"20_CR8","unstructured":"Borkowski, M., McDonald, D., Ritzer, C., Schulte, S.: Towards atomic cross-chain token transfers: state of the art and open questions within tast. Distributed Systems Group TU Wien (Technische Universit at Wien), report (2018)"},{"key":"20_CR9","unstructured":"Buterin, V.: Chain interoperability. R3 Research Paper (2016)"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Herlihy, M.: Atomic cross-chain swaps. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp. 245\u2013254. ACM, Egham United Kingdom, July 2018. https:\/\/doi.org\/10.1145\/3212734.3212736","DOI":"10.1145\/3212734.3212736"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Jaques, S., Montgomery, H., Roy, A.: Time-release cryptography from minimal circuit assumptions. Technical report, 755 (2020)","DOI":"10.1007\/978-3-030-92518-5_26"},{"key":"20_CR12","unstructured":"Kwon, J., Buchman, E.: Cosmos whitepaper. https:\/\/cosmos.network\/cosmos-whitepaper.pdf"},{"key":"20_CR13","unstructured":"m52go: Bisq whitepaper (2021). https:\/\/github.com\/bisq-network\/bisq-docs\/blob\/c3dc52fa62aa2bdfb5162cb6d7b147dcdc916055\/exchange\/whitepaper.adoc, original-date: 2017\u201309-06T18:19:27Z"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Moreno-Sanchez, P., Schneidewind, C., Kate, A., Maffei, M.: Anonymous multi-hop locks for blockchain scalability and interoperability. In: 26th Annual Network and Distributed System Security Symposium, NDSS 2019, San Diego, California, USA, 24\u201327 February 2019. The Internet Society (2019). https:\/\/www.ndss-symposium.org\/ndss-paper\/anonymous-multi-hop-locks-for-blockchain-scalability-and-interoperability\/","DOI":"10.14722\/ndss.2019.23330"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-26948-7_22","volume-title":"Advances in Cryptology\u2013CRYPTO 2019","author":"G Malavolta","year":"2019","unstructured":"Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 620\u2013649. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_22"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.33166\/AETiC.2019.01.005","volume":"3","author":"MH Miraz","year":"2019","unstructured":"Miraz, M.H., Donald, D.C.: Atomic cross-chain swaps: development, trajectory and potential of non-monetary digital token swap facilities. Ann. Emerg. Technol. Comput. 3(1), 42\u201350 (2019). https:\/\/doi.org\/10.33166\/AETiC.2019.01.005","journal-title":"Ann. Emerg. Technol. Comput."},{"key":"20_CR17","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Whitepaper, p. 9 (2008)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Nisslmueller, U., Foerster, K.T., Schmid, S., Decker, C.: Toward active and passive confidentiality attacks on cryptocurrency off-chain networks [cs], February 2020. arXiv:2003.00003","DOI":"10.5220\/0009429200070014"},{"key":"20_CR19","unstructured":"Nolan, T.: Alt chains and atomic transfers. https:\/\/bitcointalk.org\/index.php?topic=193281.msg2224949#msg2224949"},{"key":"20_CR20","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"20_CR21","unstructured":"Poelstra, A.: On stake and consensus. Technical report, March 2015"},{"key":"20_CR22","unstructured":"Poon, J.: Plasma: scalable autonomous smart contracts (2017)"},{"key":"20_CR23","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release Crypto. Technical report (1996)"},{"key":"20_CR24","unstructured":"Rusty, R.: lightningnetwork\/lightning-rfc September 2019. https:\/\/github.com\/lightningnetwork\/lightning-rfc\/blob\/3508e4e85d26240ae7492c3d2e02770cdc360fe9\/02-peer-protocol.md, original-date: 2016\u201311-14T19:21:45Z"},{"key":"20_CR25","unstructured":"Werner, S.M., Perez, D., Gudgeon, L., Klages-Mundt, A., Harz, D., Knottenbelt, W.J.: SoK: decentralized finance (DEFI). CoRR abs\/2101.08778 (2021). https:\/\/arxiv.org\/abs\/2101.08778"},{"issue":"4","key":"20_CR26","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s00145-020-09364-x","volume":"33","author":"B Wesolowski","year":"2020","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. J. Cryptol. 33(4), 2113\u20132147 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09364-x","journal-title":"J. Cryptol."},{"key":"20_CR27","unstructured":"Wood, D.G.: Polkadot: vision for a heterogeneous multi-chain framework. Whitepaper (2016)"},{"key":"20_CR28","unstructured":"Xu, J., Vavryk, N., Paruch, K., Cousaert, S., et al.: Sok: Automated market maker (AMM) based decentralized exchanges (DEXs). Technical report (2021)"},{"key":"20_CR29","unstructured":"Zamyatin, A., et al.: SoK: communication across distributed ledgers. ePrint IACR, p. 17 (2018)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2021: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06156-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:18:35Z","timestamp":1675797515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06156-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031061554","9783031061561"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06156-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"30 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.euro-par.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","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":"39","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":"29% - 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":"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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}