{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:43:33Z","timestamp":1743140613741,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811952081"},{"type":"electronic","value":"9789811952098"}],"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-981-19-5209-8_5","type":"book-chapter","created":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T23:03:17Z","timestamp":1660086197000},"page":"59-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BMSC: A Novel Anonymous Trading Scheme Based on Zero-Knowledge Proof in Ethereum"],"prefix":"10.1007","author":[{"given":"Yang","family":"Li","sequence":"first","affiliation":[]},{"given":"Yinyun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Mengmeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianming","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Xiuli","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,10]]},"reference":[{"key":"5_CR1","unstructured":"Duffield, E., Diaz, D.: Dash: A Payments-Focused CryptoCurrency [EB\/OL] (2015). https:\/\/github.com\/dashpay\/dash\/wiki\/Whitepaper"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Miers, I., Garman, C., Green, M., et al.: Zerocoin: anonymous distributed E-cash from bitcoin. In: 2013 IEEE Symposium on Security and Privacy, pp. 397\u2013411. IEEE (2013)","DOI":"10.1109\/SP.2013.34"},{"key":"5_CR3","unstructured":"Nicolas Saberhagen, N.: Cryptonote v2.0 [EB\/OL] (2013). https:\/\/cryptonote.org\/whitepaper.pdf"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Garman, C., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"5_CR5","unstructured":"Biinz, B., Agrawal, S., Zamani, M., et al.: Zether: toward privacy in a smart contract world. IACR Cryptology ePrint Archive (2019)"},{"key":"5_CR6","unstructured":"Rondelet, A., Zajac, M.: ZETH: on integrating zerocash on ethereum. arXiv preprint arXiv:1904.00905 (2019)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ma, S., Deng, Y., He, D., et al.: An efficient NIZK scheme for privacy-preserving transactions over account-model blockchain. IEEE Trans. Dependable Secure Comput. 18, 641\u2013651  (2020)","DOI":"10.1109\/TDSC.2020.2969418"},{"key":"5_CR8","unstructured":"Guan, Z.: Research on privacy protection of account model blockchain system based on zero knowledge proof. Shandong University (2020)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Mailer, M., Bowe, S., Kohlweiss, M., et al.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Mailer, M., et al.: Marlin: preprocessing zkSNARKs\u00a0with universal and updatable SRS. IACR Cryptology ePrint Archive (2019)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"5_CR11","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotam, O.: PLONK: permutations over lagrange-bases for oecumenical non interactive arguments of knowledge. IACR Cryptology ePrint Archive (2019)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Bunz, B., Fisch, B., Szepieniec, A.: Transparent snarks from dark compilers. IACR Cryptology ePrint Archive (2019)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"5_CR13","unstructured":"Biinz, B., Bootle, J., Boneh, D., et al.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE (2018)"},{"key":"5_CR14","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., et al.: Scalable, transparent, and postquantum secure computational integrity. IACR Cryptology ePrint Archive (2018)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: postquantum and transparent recursive proofs from holography. IACR Cryptology ePrint Archive (2019)","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"5_CR16","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. IACR Cryptology ePrint Archive (2019)"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-5209-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:14:30Z","timestamp":1710350070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-5209-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811952081","9789811952098"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-5209-8_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2022","order":10,"name":"conference_id","label":"Conference ID","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":"261","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":"65","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":"26","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":"25% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}