{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:53:06Z","timestamp":1771602786199,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030319182","type":"print"},{"value":"9783030319199","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31919-9_18","type":"book-chapter","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T19:09:53Z","timestamp":1569438593000},"page":"303-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Chameleon Hash Time-Lock Contract for Privacy Preserving Payment Channel Networks"],"prefix":"10.1007","author":[{"given":"Bin","family":"Yu","sequence":"first","affiliation":[]},{"given":"Shabnam Kasra","family":"Kermanshahi","sequence":"additional","affiliation":[]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[]},{"given":"Surya","family":"Nepal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Moreno-Sanchez, P., Kate, A., Maffei, M., Ravi, S.: Concurrency and privacy with payment-channel networks. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 455\u2013471. ACM (2017)","DOI":"10.1145\/3133956.3134096"},{"key":"18_CR2","unstructured":"Nakamoto, S., et al.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"18_CR3","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Pap. 151, 1\u201332 (2014)","journal-title":"Ethereum Proj. Yellow Pap."},{"key":"18_CR4","unstructured":"Bitcoin transaction throughput. \nhttps:\/\/en.wikipedia.org\/wiki\/Bitcoin_scalability_problem\n\n. Accessed on 14 Feb"},{"key":"18_CR5","unstructured":"Bitcoin lightning network. \nhttps:\/\/en.wikipedia.org\/wiki\/Lightning_network\n\n. Accessed on 14 Feb 2018"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-77105-0_25","volume-title":"Internet and Network Economics","author":"A Ghosh","year":"2007","unstructured":"Ghosh, A., Mahdian, M., Reeves, D.M., Pennock, D.M., Fugger, R.: Mechanism design on trust networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 257\u2013268. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77105-0_25"},{"key":"18_CR7","unstructured":"Stellar protocol. \nwww.stellar.org\n\n. Accessed on 14 Feb 2018"},{"key":"18_CR8","unstructured":"Ripple network. \nhttps:\/\/ripple.com\/\n\n. Accessed on 14 Feb 2018"},{"key":"18_CR9","unstructured":"Fugger, R.: Money as IOUs in social trust networks & a proposal for a decentralized currency network protocol. Hypertext document, vol. 106 (2004). \nhttp:\/\/ripple.sourceforge.net"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mondal, M., Gummadi, K.P., Mislove, A., Post, A.: Canal: scaling social network-based sybil tolerance schemes. In: Proceedings of the 7th ACM European Conference on Computer Systems, pp. 309\u2013322. ACM (2012)","DOI":"10.1145\/2168836.2168867"},{"key":"18_CR11","unstructured":"Miller, A., Bentov, I., Kumaresan, R., McCorry, P.: Sprites: payment channels that go faster than lightning. arXiv preprint \narXiv:1702.05812\n\n (2017)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Moreno-Sanchez, P., Kate, A., Maffei, M.: SilentWhispers: enforcing security and privacy in credit networks. In: 24th Annual Network and Distributed System Security Symposium, NDSS (2017)","DOI":"10.14722\/ndss.2017.23448"},{"key":"18_CR13","unstructured":"Moreno-Sanchez, P., Kate, A., Maffei, M., Pecina, K.: Privacy preserving payments in credit networks. In: Network and Distributed Security Symposium (2015)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Heilman, E., Alshenibr, L., Baldimtsi, F., Scafuro, A., Goldberg, S.: TumbleBit: an untrusted bitcoin-compatible anonymous payment hub. In: Network and Distributed System Security Symposium (2017)","DOI":"10.14722\/ndss.2017.23086"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21741-3_1","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Decker","year":"2015","unstructured":"Decker, C., Wattenhofer, R.: A fast and scalable payment network with bitcoin duplex micropayment channels. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 3\u201318. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21741-3_1"},{"key":"18_CR16","unstructured":"Poon, J., Dryja, T.: The bitcoin lightning network: scalable off-chain instant payments (2016)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-40253-6_4","volume-title":"Information Security and Privacy","author":"P McCorry","year":"2016","unstructured":"McCorry, P., M\u00f6ser, M., Shahandasti, S.F., Hao, F.: Towards bitcoin payment networks. In: Liu, J.K.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9722, pp. 57\u201376. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40253-6_4"},{"key":"18_CR18","unstructured":"Gudgeon, L., Moreno-Sanchez, P., Roos, S., McCorry, P., Gervais, A.: SoK: off the chain transactions. Cryptology ePrint Archive, Report 2019\/360 (2019). \nhttps:\/\/eprint.iacr.org\/2019\/360"},{"key":"18_CR19","volume-title":"Mastering Bitcoin: Unlocking Digital Cryptocurrencies","author":"AM Antonopoulos","year":"2014","unstructured":"Antonopoulos, A.M.: Mastering Bitcoin: Unlocking Digital Cryptocurrencies. O\u2019Reilly Media Inc., Sebastopol (2014)"},{"key":"18_CR20","unstructured":"Hashed timelock contracts. \nhttps:\/\/en.bitcoin.it\/wiki\/Hashed_Timelock_Contracts\n\n. Accessed 14 Feb 2018"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Tsuchiya, P.F.: The landmark hierarchy: a new hierarchy for routing in very large networks. In: ACM SIGCOMM Computer Communication Review, vol. 18, no. 4, pp. 35\u201342. ACM (1988)","DOI":"10.1145\/52325.52329"},{"key":"18_CR22","unstructured":"Prihodko, P., Zhigulin, S., Sahno, M., Ostrovskiy, A., Osuntokun, O.: Flare: an approach to routing in lightning network. White Paper (2016)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Roos, S., Moreno-Sanchez, P., Kate, A., Goldberg, I.: Settling payments fast and private: efficient decentralized routing for path-based transactions. arXiv preprint \narXiv:1709.05748\n\n (2017)","DOI":"10.14722\/ndss.2018.23252"},{"key":"18_CR24","first-page":"10","volume":"1998","author":"H Krawczyk","year":"1998","unstructured":"Krawczyk, H., Rabin, T.: Chameleon hashing and signatures. IACR Cryptol. ePrint Arch. 1998, 10 (1998)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"18_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, vol. 19. Wiley, Hoboken (2004)"},{"key":"18_CR26","unstructured":"Cristian, F., Aghili, H., Strong, R.: Approximate clock synchronization despite omission and performance failures and processor joins. In: Proceedings of the 16th International Symposium on Fault-Tolerant Computing, pp. 218\u2013223 (1986)"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 2001 IEEE International Conference on Cluster Computing, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31919-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T15:04:44Z","timestamp":1573657484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31919-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030319182","9783030319199"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31919-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 September 2019","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":"Cairns, 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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.monash.edu\/provsec2019","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":"51","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":"18","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":"6","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":"35% - 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":"2,882","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":"2,579","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)"}}]}}