{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:12:16Z","timestamp":1780701136256,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662583869","type":"print"},{"value":"9783662583876","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-662-58387-6_25","type":"book-chapter","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T11:03:39Z","timestamp":1567076619000},"page":"461-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Anonymous Post-Quantum Cryptocash"],"prefix":"10.1007","author":[{"given":"Huang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haibo","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Man Ho","family":"Au","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D Aharonov","year":"2005","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP \n                      \n                        \n                      \n                      $$\\cap $$\n                     coNP. J. ACM 52(5), 749\u2013765 (2005)","journal-title":"J. ACM"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-32946-3_29","volume-title":"Financial Cryptography and Data Security","author":"S Barber","year":"2012","unstructured":"Barber, S., Boyen, X., Shi, E., Uzun, E.: Bitter to better \u2013 how to make Bitcoin a better currency. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 399\u2013414. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32946-3_29"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2001","author":"M Bellare","year":"2001","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566\u2013582. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-45682-1_33"},{"key":"25_CR5","unstructured":"Cai, J.Y., Nerurkar, A.P.: An improved worst-case to average-case connection for lattice problems. In: FOCS 1997, pp. 468\u2013477. IEEE, October 1997"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-14712-8_16","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"P-L Cayrel","year":"2010","unstructured":"Cayrel, P.-L., Lindner, R., R\u00fcckert, M., Silva, R.: A lattice-based threshold ring signature scheme. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 255\u2013272. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14712-8_16"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"25_CR8","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 \u2013 CRYPTO 1986","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). \n                      https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-71677-8_13","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"E Fujisaki","year":"2007","unstructured":"Fujisaki, E., Suzuki, K.: Traceable ring signature. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 181\u2013200. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71677-8_13"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of non-approximability of lattice problems. In: STOC 1998, pp. 1\u20139. ACM (1998)","DOI":"10.1145\/276698.276704"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-662-46803-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Groth","year":"2015","unstructured":"Groth, J., Kohlweiss, M.: One-out-of-many proofs: or how to leak a secret and spend a coin. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 253\u2013280. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46803-6_9"},{"key":"25_CR13","unstructured":"Halevi, S.: A sufficient condition for key-privacy. Cryptology ePrint Archive, Report 2005\/005 (2005)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Kumar, A., Fischer, C., Tople, S., Saxena, P.: A traceability analysis of Monero\u2019s blockchain. Cryptology ePrint Archive, Report 2017\/338 (2017)","DOI":"10.1007\/978-3-319-66399-9_9"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49896-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 1\u201331. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-27800-9_28","volume-title":"Information Security and Privacy","author":"JK Liu","year":"2004","unstructured":"Liu, J.K., Wei, V.K., Wong, D.S.: Linkable spontaneous anonymous group signature for Ad Hoc groups. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 325\u2013335. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-27800-9_28"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/11424826_65","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"JK Liu","year":"2005","unstructured":"Liu, J.K., Wong, D.S.: Linkable ring signatures: security models and new schemes. In: Gervasi, O., et al. (eds.) ICCSA 2005. LNCS, vol. 3481, pp. 614\u2013623. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11424826_65"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144\u2013155. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11787006_13"},{"key":"25_CR20","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: FOCS 2002, pp. 356\u2013365 (2002)"},{"issue":"4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16(4), 365\u2013411 (2007)","journal-title":"Comput. Complex."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Miers, I., Garman, C., Green, M., Rubin, A.D.: Zerocoin: anonymous distributed e-cash from Bitcoin. In: SP 2013, pp. 397\u2013411, May 2013","DOI":"10.1109\/SP.2013.34"},{"key":"25_CR24","unstructured":"Miller, A., M\u00f6ser, M., Lee, K., Narayanan, A.: An empirical analysis of linkability in the Monero blockchain. eprint \n                      arXiv:1704.04299\n                      \n                     (2017)"},{"key":"25_CR25","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. URL: \n                      http:\/\/www.bitcoin.org\/bitcoin.pdf\n                      \n                     (2012)"},{"key":"25_CR26","unstructured":"Noether, S.: Ring signature confidential transactions for Monero. Cryptology ePrint Archive, Report 2015\/1098 (2015)"},{"issue":"2","key":"25_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.3390\/fi5020237","volume":"5","author":"M Ober","year":"2013","unstructured":"Ober, M., Katzenbeisser, S., Hamacher, K.: Structure and anonymity of the Bitcoin transaction graph. Future Internet 5(2), 237\u2013250 (2013)","journal-title":"Future Internet"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-1-4614-4139-7_10","volume-title":"Security and Privacy in Social Networks","author":"F Reid","year":"2013","unstructured":"Reid, F., Harrigan, M.: An analysis of anonymity in the Bitcoin system. In: Altshuler, Y., Elovici, Y., Cremers, A., Aharon, N., Pentland, A. (eds.) Security and Privacy in Social Networks, pp. 197\u2013223. Springer, New York (2013). \n                      https:\/\/doi.org\/10.1007\/978-1-4614-4139-7_10"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2001","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552\u2013565. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"key":"25_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-642-39884-1_2","volume-title":"Financial Cryptography and Data Security","author":"D Ron","year":"2013","unstructured":"Ron, D., Shamir, A.: Quantitative analysis of the full Bitcoin transaction graph. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 6\u201324. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39884-1_2"},{"key":"25_CR31","unstructured":"Saberhagen, N.V.: Cryptonote v2.0 (2013). \n                      https:\/\/cryptonote.org\/whitepaper.pdf"},{"key":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/3-540-46885-4_68","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 1989","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 688\u2013689. Springer, Heidelberg (1990). \n                      https:\/\/doi.org\/10.1007\/3-540-46885-4_68"},{"issue":"3","key":"25_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-319-66399-9_25","volume-title":"Computer Security \u2013 ESORICS 2017","author":"S-F Sun","year":"2017","unstructured":"Sun, S.-F., Au, M.H., Liu, J.K., Yuen, T.H.: RingCT 2.0: a compact accumulator-based (linkable ring signature) protocol for blockchain cryptocurrency Monero. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10493, pp. 456\u2013474. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66399-9_25"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Wang, C., Wang, H.: A new ring signature scheme from NTRU lattice. In: ICCIS 2012, pp. 353\u2013356. IEEE, August 2012","DOI":"10.1109\/ICCIS.2012.31"},{"key":"25_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-25243-3_2","volume-title":"Information and Communications Security","author":"J Wang","year":"2011","unstructured":"Wang, J., Sun, B.: Ring signature schemes from lattice basis delegation. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 15\u201328. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-25243-3_2"},{"key":"25_CR38","unstructured":"Zhang, H., Zhang, F., Tian, H., Au, M.H.: Anonymous post-quantum cryptocash. Cryptology ePrint Archive, Report 2017\/716 (2017)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-58387-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T11:08:51Z","timestamp":1567076931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-58387-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783662583869","9783662583876"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-58387-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nieuwpoort","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cura\u00e7ao","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc18.ifca.ai\/index.html","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"110","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":"2","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,27","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,27","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)"}}]}}