{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:32:44Z","timestamp":1755999164965,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031354854"},{"type":"electronic","value":"9783031354861"}],"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-35486-1_25","type":"book-chapter","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T13:02:10Z","timestamp":1686747730000},"page":"580-605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reusable, Instant and\u00a0Private Payment Guarantees for\u00a0Cryptocurrencies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1648-0665","authenticated-orcid":false,"given":"Akash","family":"Madhusudan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1507-6927","authenticated-orcid":false,"given":"Mahdi","family":"Sedaghat","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7987-1519","authenticated-orcid":false,"given":"Samarth","family":"Tiwari","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2636-4406","authenticated-orcid":false,"given":"Kelong","family":"Cong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2005-9651","authenticated-orcid":false,"given":"Bart","family":"Preneel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aumayr, L., Abbaszadeh, K., Maffei, M.: Thora: Atomic and privacy-preserving multi-channel updates. IACR Cryptol. ePrint Arch. 317 (2022). https:\/\/eprint.iacr.org\/2022\/317","DOI":"10.1145\/3548606.3560556"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-030-51280-4_15","volume-title":"Financial Cryptography and Data Security","author":"Z Avarikioti","year":"2020","unstructured":"Avarikioti, Z., Heimbach, L., Wang, Y., Wattenhofer, R.: ride the lightning: the game theory of payment channels. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 264\u2013283. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_15"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"25_CR4","unstructured":"Avarikioti, Z., Pietrzak, K., Salem, I., Schmid, S., Tiwari, S., Yeo, M.: HIDE & SEEK: privacy-preserving rebalancing on payment channel networks. Cryptology ePrint Archive, Report 2021\/1401 (2021). https:\/\/eprint.iacr.org\/2021\/1401"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-46447-2_5","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"F Baldimtsi","year":"2015","unstructured":"Baldimtsi, F., Chase, M., Fuchsbauer, G., Kohlweiss, M.: Anonymous transferable E-cash. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 101\u2013124. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_5"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-030-75248-4_20","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"B Bauer","year":"2021","unstructured":"Bauer, B., Fuchsbauer, G., Qian, C.: Transferable E-cash: a cleaner model and the first practical instantiation. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 559\u2013590. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_20"},{"key":"25_CR7","unstructured":"Benmeleh, Y.: Blockchain firm starkware valued at \\$2 billion in funding round (2021). https:\/\/www.bloomberg.com"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0314-9","journal-title":"J. Cryptol."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-48329-2_26","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"S Brands","year":"1994","unstructured":"Brands, S.: Untraceable off-line cash in wallet with observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302\u2013318. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_26"},{"key":"25_CR10","doi-asserted-by":"publisher","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, pp. 315\u2013334. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"25_CR11","unstructured":"Buterin, V.: An incomplete guide to rollups (2021). https:\/\/vitalik.ca\/general\/2021\/01\/05\/rollup.html"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11426639_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J Camenisch","year":"2005","unstructured":"Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact E-cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 302\u2013321. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_18"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-14577-3_9","volume-title":"Financial Cryptography and Data Security","author":"S Canard","year":"2010","unstructured":"Canard, S., Gouget, A.: Multiple denominations in E-cash with compact transaction data. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 82\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_9"},{"key":"25_CR14","first-page":"199","volume-title":"CRYPTO 1982","author":"D Chaum","year":"1982","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO 1982, pp. 199\u2013203. Plenum Press, New York (1982)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"AA Joseph","year":"2013","unstructured":"Joseph, A.A., et al.: Charm: a framework for rapidly prototyping cryptosystems. J. Cryptograph. Eng. 3, 111\u201312 (2013). https:\/\/doi.org\/10.1007\/s13389-013-0057-3","journal-title":"J. Cryptograph. Eng."},{"key":"25_CR16","unstructured":"Crites, E., Kohlweiss, M., Preneel, B., Sedaghat, M., Slamanig, D.: Threshold structure-preserving signatures. Cryptology ePrint Archive, Paper 2022\/839 (2022). https:\/\/eprint.iacr.org\/2022\/839"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Eckey, L., Faust, S., Malinowski, D.: Perun: virtual payment hubs over cryptocurrencies. In: 2019 IEEE Symposium on Security and Privacy, pp. 106\u2013123. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/SP.2019.00020","DOI":"10.1109\/SP.2019.00020"},{"key":"25_CR19","unstructured":"Electric Coin Company: Explaining viewing keys. https:\/\/electriccoin.co\/blog\/explaining-viewing-keys\/. Accessed 13 Feb 2023"},{"key":"25_CR20","unstructured":"Ethereum.org: Layer 2 rollups (2021). https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/layer-2-rollups\/"},{"key":"25_CR21","unstructured":"ethos.dev: The beacon chain ethereum 2.0 explainer you need to read first. https:\/\/ethos.dev\/beacon-chain. Accessed 13 Feb 2023"},{"key":"25_CR22","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":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0034855","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"Y Frankel","year":"1996","unstructured":"Frankel, Y., Tsiounis, Y., Yung, M.: \u201cIndirect discourse proofs\u2019\u2019: achieving efficient fair off-line e-cash. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 286\u2013300. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034855"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-51280-4_12","volume-title":"Financial Cryptography and Data Security","author":"L Gudgeon","year":"2020","unstructured":"Gudgeon, L., Moreno-Sanchez, P., Roos, S., McCorry, P., Gervais, A.: SoK: layer-two blockchain protocols. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 201\u2013226. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_12"},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Herold, G., Hoffmann, M., Kloo\u00df, M., R\u00e0fols, C., Rupp, A.: New techniques for structural batch verification in bilinear groups with applications to Groth-Sahai proofs. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1547\u20131564. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134068","DOI":"10.1145\/3133956.3134068"},{"key":"25_CR27","unstructured":"Hill, K.: How target figured out a teen girl was pregnant before her father did. https:\/\/www.forbes.com\/sites\/kashmirhill\/2012\/02\/16\/how-target-figured-out-a-teen-girl-was-pregnant-before-her-father-did\/?sh=53d927356668. Accessed 30 Aug 2022"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Madhusudan, A., Sedaghat, M., Tiwari, S., Cong, K., Preneel, B.: Reusable, instant and private payment guarantees for cryptocurrencies. Cryptology ePrint Archive, Paper 2023\/583 (2023). https:\/\/eprint.iacr.org\/2023\/583","DOI":"10.1007\/978-3-031-35486-1_25"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Mavroudis, V., W\u00fcst, K., Dhar, A., Kostiainen, K., Capkun, S.: Snappy: fast on-chain payments with practical collaterals. In: NDSS 2020. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.24049"},{"key":"25_CR30","unstructured":"Network, Raiden: What is the raiden network (2019). https:\/\/raiden.network\/101.html"},{"key":"25_CR31","doi-asserted-by":"publisher","unstructured":"Ng, L.K.L., Chow, S.S.M., Wong, D.P.H., Woo, A.P.Y.: LDSP: shopping with cryptocurrency privately and quickly under leadership. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pp. 261\u2013271 (2021). https:\/\/doi.org\/10.1109\/ICDCS51616.2021.00033","DOI":"10.1109\/ICDCS51616.2021.00033"},{"key":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"25_CR33","unstructured":"Poon, J., Dryja, T.: The Bitcoin lightning network: scalable off-chain instant payments (2016). https:\/\/lightning.network\/lightning-network-paper.pdf"},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239\u2013252. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22"},{"key":"25_CR35","doi-asserted-by":"publisher","unstructured":"Zabka, P., Foerster, K.T., Schmid, S., Decker, C.: A centrality analysis of the lightning network (2022). https:\/\/doi.org\/10.48550\/ARXIV.2201.07746, https:\/\/arxiv.org\/abs\/2201.07746","DOI":"10.48550\/ARXIV.2201.07746"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35486-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T23:03:48Z","timestamp":1687215828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35486-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031354854","9783031354861"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35486-1_25","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":"15 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"5 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2023","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":"acisp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qut.edu.au\/about\/faculty-of-science\/school-of-computer-science\/acisp","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":"87","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":"27","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":"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":"3.5","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)"}}]}}