{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:39Z","timestamp":1772240679887,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030299583","type":"print"},{"value":"9783030299590","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":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-29959-0_35","type":"book-chapter","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:04:10Z","timestamp":1568502250000},"page":"726-746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["A Lattice-Based Linkable Ring Signature Supporting Stealth Addresses"],"prefix":"10.1007","author":[{"given":"Zhen","family":"Liu","sequence":"first","affiliation":[]},{"given":"Khoa","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Guomin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11774716_9","volume":"2006","author":"MH Au","year":"2006","unstructured":"Au, M.H., Chow, S.S.M., Susilo, W., Tsang, P.P.: Short linkable ring signatures revisited. EuroPKI 2006, 101\u2013115 (2006). https:\/\/doi.org\/10.1007\/11774716_9","journal-title":"EuroPKI"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11941378\\_26","volume":"2006","author":"MH Au","year":"2006","unstructured":"Au, M.H., Liu, J.K., Susilo, W., Yuen, T.H.: Constant-size id-based linkable and revocable-iff-linked ring signature. INDOCRYPT 2006, 364\u2013378 (2006). https:\/\/doi.org\/10.1007\/11941378_26","journal-title":"INDOCRYPT"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.10.031","volume":"469","author":"MH Au","year":"2013","unstructured":"Au, M.H., Liu, J.K., Susilo, W., Yuen, T.H.: Secure id-based linkable and revocable-iff-linked ring signature with constant-size construction. Theor. Comput. Sci. 469, 1\u201314 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.031","journal-title":"Theor. Comput. Sci."},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-98113-0\\_20","volume":"2018","author":"C Baum","year":"2018","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More efficient commitments from structured lattice assumptions. SCN 2018, 368\u2013385 (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20","journal-title":"SCN"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-030-01950-1\\_18","volume":"2018","author":"C Baum","year":"2018","unstructured":"Baum, C., Lin, H., Oechsner, S.: Towards practical lattice-based one-time linkable ring signatures. ICICS 2018, 303\u2013322 (2018). https:\/\/doi.org\/10.1007\/978-3-030-01950-1_18","journal-title":"ICICS"},{"key":"35_CR6","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 \u2014 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). https:\/\/doi.org\/10.1007\/3-540-45682-1_33"},{"key":"35_CR7","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: CRYSTALS - kyber: a CCA-secure module-lattice-based KEM. In: EuroS&P 2018. pp. 353\u2013367 (2018). DOI: https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3390\/cryptography2040035","volume":"2","author":"X Boyen","year":"2018","unstructured":"Boyen, X., Haines, T.: Forward-secure linkable ring signatures from bilinear maps. Cryptography 2(4), 35 (2018). https:\/\/doi.org\/10.3390\/cryptography2040035","journal-title":"Cryptography"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-01446-9\\_12","volume":"2018","author":"P Branco","year":"2018","unstructured":"Branco, P., Mateus, P.: A code-based linkable ring signature scheme. ProvSec 2018, 203\u2013219 (2018). https:\/\/doi.org\/10.1007\/978-3-030-01446-9_12","journal-title":"ProvSec"},{"key":"35_CR10","unstructured":"CoinMarketCap: Top 100 cryptocurrencies by market capitalization. https:\/\/coinmarketcap.com. Accessed 27 Apr 2019"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.5220\/0006270005590566","volume":"2017","author":"NT Courtois","year":"2017","unstructured":"Courtois, N.T., Mercer, R.: Stealth address and key management techniques in blockchain systems. ICISSP 2017, 559\u2013566 (2017). https:\/\/doi.org\/10.5220\/0006270005590566","journal-title":"ICISSP"},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"238","DOI":"10.13154\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L., et al.: Crystals-dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"35_CR13","first-page":"773","volume":"2018","author":"MF Esgin","year":"2018","unstructured":"Esgin, M.F., Steinfeld, R., Sakzad, A., Liu, J.K., Liu, D.: Short lattice-based one-out-of-many proofs and applications to ring signatures. IACR Cryptol. ePrint Arch. 2018, 773 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-19074-2\\_25","volume":"2011","author":"E Fujisaki","year":"2011","unstructured":"Fujisaki, E.: Sub-linear size traceable ring signatures without random oracles. CT-RSA 2011, 393\u2013415 (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_25","journal-title":"CT-RSA"},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1587\/transfun.E95.A.151","volume":"95\u2013A","author":"E Fujisaki","year":"2012","unstructured":"Fujisaki, E.: Sub-linear size traceable ring signatures without random oracles. IEICE Trans. 95\u2013A(1), 151\u2013166 (2012). https:\/\/doi.org\/10.1587\/transfun.E95.A.151","journal-title":"IEICE Trans."},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-71677-8\\_13","volume":"2007","author":"E Fujisaki","year":"2007","unstructured":"Fujisaki, E., Suzuki, K.: Traceable ring signature. PKC 2007, 181\u2013200 (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_13","journal-title":"PKC"},{"issue":"3","key":"35_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehle, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"35_CR18","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":"Beno\u00eet 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: EUROCRYPT 2016 Part II. pp. 1\u201331 (2016). DOI: https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1"},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TKDE.2013.17","volume":"26","author":"JK Liu","year":"2014","unstructured":"Liu, J.K., Au, M.H., Susilo, W., Zhou, J.: Linkable ring signature with unconditional anonymity. IEEE Trans. Knowl. Data Eng. 26(1), 157\u2013165 (2014). https:\/\/doi.org\/10.1109\/TKDE.2013.17","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-27800-9\\_28","volume":"2004","author":"JK Liu","year":"2004","unstructured":"Liu, J.K., Wei, V.K., Wong, D.S.: Linkable spontaneous anonymous group signature for ad hoc groups (extended abstract). ACISP 2004, 325\u2013335 (2004). https:\/\/doi.org\/10.1007\/978-3-540-27800-9_28","journal-title":"ACISP"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Liu, Z., Yang, G., Wong, D.S., Nguyen, K., Wang, H.: Key-insulated and privacy-preserving signature scheme with publicly derived public key. EuroS&P 2019, to appear https:\/\/eprint.iacr.org\/2018\/956","DOI":"10.1109\/EuroSP.2019.00025"},{"key":"35_CR22","first-page":"857","volume":"2018","author":"X Lu","year":"2018","unstructured":"Lu, X., Au, M.H., Zhang, Z.: Raptor: a practical lattice-based (linkable) ring signature. IACR Cryptol. ePrint Archive 2018, 857 (2018). https:\/\/eprint.iacr.org\/2018\/857","journal-title":"IACR Cryptol. ePrint Archive"},{"key":"35_CR23","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-78381-9_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Vadim Lyubashevsky","year":"2018","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: EUROCRYPT 2018 Part I. pp. 204\u2013224 (2018). DOI: 10.1007\/978-3-319-78381-9\\_8"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5195\/LEDGER.2016.34","volume":"1","author":"S Noether","year":"2016","unstructured":"Noether, S., Mackenzie, A.: Ring confidential transactions. Ledger 1, 1\u201318 (2016)","journal-title":"Ledger"},{"key":"35_CR25","unstructured":"van Saberhagen, N.: Cryptonote v 2.0 (2013). https:\/\/cryptonote.org\/whitepaper.pdf"},{"key":"35_CR26","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-319-66399-9_25","volume-title":"Computer Security \u2013 ESORICS 2017","author":"Shi-Feng Sun","year":"2017","unstructured":"Sun, S., 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: ESORICS 2017 Part II. pp. 456\u2013474 (2017). DOI: https:\/\/doi.org\/10.1007\/978-3-319-66399-9_25"},{"key":"35_CR27","unstructured":"Todd, P.: Stealth addresses. https:\/\/lists.linuxfoundation.org\/pipermail\/bitcoin-dev\/2014-January\/004020.html"},{"key":"35_CR28","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-319-93638-3_32","volume-title":"Information Security and Privacy","author":"Wilson Abel Alberto Torres","year":"2018","unstructured":"Torres, W.A.A., et al.: Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0). In: ACISP 2018. pp. 558\u2013576 (2018). DOI: https:\/\/doi.org\/10.1007\/978-3-319-93638-3_32"},{"key":"35_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-31979-5\\_5","volume":"2005","author":"PP Tsang","year":"2005","unstructured":"Tsang, P.P., Wei, V.K.: Short linkable ring signatures for e-voting, e-cash and attestation. ISPEC 2005, 48\u201360 (2005). https:\/\/doi.org\/10.1007\/978-3-540-31979-5_5","journal-title":"ISPEC"},{"key":"35_CR30","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-30556-9\\_30","volume":"2004","author":"PP Tsang","year":"2004","unstructured":"Tsang, P.P., Wei, V.K., Chan, T.K., Au, M.H., Liu, J.K., Wong, D.S.: Separable linkable threshold ring signatures. INDOCRYPT 2004, 384\u2013398 (2004). https:\/\/doi.org\/10.1007\/978-3-540-30556-9_30","journal-title":"INDOCRYPT"},{"issue":"4","key":"35_CR31","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1093\/comjnl\/bxs115","volume":"56","author":"TH Yuen","year":"2013","unstructured":"Yuen, T.H., Liu, J.K., Au, M.H., Susilo, W., Zhou, J.: Efficient linkable and\/or threshold ring signature without random oracles. Comput. J. 56(4), 407\u2013421 (2013). https:\/\/doi.org\/10.1093\/comjnl\/bxs115","journal-title":"Comput. J."},{"key":"35_CR32","first-page":"716","volume":"2017","author":"H Zhang","year":"2017","unstructured":"Zhang, H., Zhang, F., Tian, H., Au, M.H.: Anonymous post-quantum cryptocash. IACR Cryptol. ePrint Archive 2017, 716 (2017). http:\/\/eprint.iacr.org\/2017\/716","journal-title":"IACR Cryptol. ePrint Archive"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29959-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:09:07Z","timestamp":1726358947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29959-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299583","9783030299590"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29959-0_35","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":"15 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.laas.fr\/esorics\/","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":"344","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":"67","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":"19% - 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,2","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":"11","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}