{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T10:04:28Z","timestamp":1768903468662,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030014452","type":"print"},{"value":"9783030014469","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-030-01446-9_12","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T13:46:13Z","timestamp":1538833573000},"page":"203-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A Code-Based Linkable Ring Signature Scheme"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Branco","sequence":"first","affiliation":[]},{"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,7]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-46035-7_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"M Abdalla","year":"2002","unstructured":"Abdalla, M., An, J.H., Bellare, M., Namprempre, C.: From identification to signatures via the fiat-shamir transform: minimizing assumptions for security and forward-security. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 418\u2013433. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-46035-7_28"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-45239-0_7","volume-title":"Cryptography and Coding","author":"C Aguilar-Melchor","year":"2013","unstructured":"Aguilar-Melchor, C., Bettaieb, S., Gaborit, P., Schrek, J.: A code-based undeniable signature scheme. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 99\u2013119. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45239-0_7"},{"issue":"7","key":"12_CR3","doi-asserted-by":"publisher","first-page":"4833","DOI":"10.1109\/TIT.2011.2145950","volume":"57","author":"C Aguilar Melchor","year":"2011","unstructured":"Aguilar Melchor, C., Cayrel, P.L., Gaborit, P., Laguillaumie, F.: A new efficient threshold ring signature scheme based on coding theory. IEEE Trans. Inf. Theor. 57(7), 4833\u20134842 (2011)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-55227-9_18","volume-title":"Arithmetic of Finite Fields","author":"Q Alam\u00e9lou","year":"2016","unstructured":"Alam\u00e9lou, Q., Blazy, O., Cauchie, S., Gaborit, P.: A practical group signature scheme based on rank metric. In: Duquesne, S., Petkova-Nikova, S. (eds.) WAIFI 2016. LNCS, vol. 10064, pp. 258\u2013275. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55227-9_18"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10623-016-0276-6","volume":"82","author":"Q Alam\u00e9lou","year":"2017","unstructured":"Alam\u00e9lou, Q., Blazy, O., Cauchie, S., Gaborit, P.: A code-based group signature scheme. Des. Codes Crypt. 82(1), 469\u2013493 (2017). \nhttps:\/\/doi.org\/10.1007\/s10623-016-0276-6","journal-title":"Des. Codes Crypt."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, FOCS 2014, pp. 474\u2013483. IEEE Computer Society, Washington (2014). \nhttp:\/\/dx.doi.org\/10.1109\/FOCS.2014.57","DOI":"10.1109\/FOCS.2014.57"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11774716_9","volume-title":"Public Key Infrastructure","author":"MH Au","year":"2006","unstructured":"Au, M.H., Chow, S.S.M., Susilo, W., Tsang, P.P.: Short linkable ring signatures revisited. In: Atzeni, A.S., Lioy, A. (eds.) EuroPKI 2006. LNCS, vol. 4043, pp. 101\u2013115. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11774716_9"},{"key":"12_CR8","unstructured":"Baum, C., Lin, H., Oechsner, S.: Towards practical lattice-based one-time linkable ring signatures. Cryptology ePrint Archive, Report 2018\/107 (2018). \nhttps:\/\/eprint.iacr.org\/2018\/107"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11681878_4","volume-title":"Theory of Cryptography","author":"A Bender","year":"2006","unstructured":"Bender, A., Katz, J., Morselli, R.: Ring signatures: stronger definitions, and constructions without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 60\u201379. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11681878_4"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random Oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theor. 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). \nhttps:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"R Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174\u2013187. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48658-5_19"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-10868-6_13","volume-title":"Cryptography and Coding","author":"L Dallot","year":"2009","unstructured":"Dallot, L., Vergnaud, D.: Provably secure code-based threshold ring signatures. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 222\u2013235. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10868-6_13"},{"key":"12_CR17","unstructured":"Damg\u00e5rd, I.: On $$\\sigma $$-protocols. Lecture Notes, University of Aarhus, Department for Computer Science (2002)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-48797-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"MF Ezerman","year":"2015","unstructured":"Ezerman, M.F., Lee, H.T., Ling, S., Nguyen, K., Wang, H.: A provably secure group signature scheme from code-based assumptions. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 260\u2013285. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48797-6_12"},{"issue":"10","key":"12_CR19","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"J Faugre","year":"2013","unstructured":"Faugre, J., Gauthier-Umaa, V., Otmani, A., Perret, L., Tillich, J.: A distinguisher for high-rate mceliece cryptosystems. IEEE Trans. Inf. Theor. 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR20","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 \u201986","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). \nhttps:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"12_CR21","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71677-8_13"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-34961-4_40","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"A Jain","year":"2012","unstructured":"Jain, A., Krenn, S., Pietrzak, K., Tentes, A.: Commitments and efficient zero-knowledge proofs from learning parity with noise. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 663\u2013680. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34961-4_40"},{"issue":"1","key":"12_CR23","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)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR24","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27800-9_28"},{"key":"12_CR25","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., Gavrilova, M.L., Kumar, V., Lagan\u00e0, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3481, pp. 614\u2013623. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11424826_65"},{"key":"12_CR26","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 \u2014 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). \nhttps:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"key":"12_CR27","unstructured":"van Saberhagen, N.: Cryptonote v 2.0 (2013)"},{"issue":"5","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). \nhttps:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201993","author":"J Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13\u201321. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48329-2_2"},{"key":"12_CR30","unstructured":"Torres, W.A., et al.: Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringCT v1.0). Cryptology ePrint Archive, Report 2018\/379 (2018). \nhttps:\/\/eprint.iacr.org\/2018\/379"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-31979-5_5","volume-title":"Information Security Practice and Experience","author":"PP Tsang","year":"2005","unstructured":"Tsang, P.P., Wei, V.K.: Short linkable ring signatures for e-voting, e-cash and attestation. In: Deng, R.H., Bao, F., Pang, H.H., Zhou, J. (eds.) ISPEC 2005. LNCS, vol. 3439, pp. 48\u201360. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31979-5_5"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-30556-9_30","volume-title":"Progress in Cryptology - INDOCRYPT 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. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 384\u2013398. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30556-9_30"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-70694-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"D Unruh","year":"2017","unstructured":"Unruh, D.: Post-quantum security of Fiat-Shamir. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 65\u201395. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-70694-8_3"},{"issue":"2","key":"12_CR34","first-page":"154","volume":"5","author":"D Zheng","year":"2007","unstructured":"Zheng, D., Li, X., Chen, K.: Code-based ring signature scheme. Int. J. Netw. Secur. 5(2), 154\u2013157 (2007)","journal-title":"Int. J. Netw. Secur."}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01446-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T13:53:57Z","timestamp":1538834037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01446-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030014452","9783030014469"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01446-9_12","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":"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":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"25 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ssl.informatics.uow.edu.au\/provsec2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}