{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:07:32Z","timestamp":1778789252207,"version":"3.51.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319709710","type":"print"},{"value":"9783319709727","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-70972-7_1","type":"book-chapter","created":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T08:57:55Z","timestamp":1513933075000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["An Efficient Self-blindable Attribute-Based Credential Scheme"],"prefix":"10.1007","author":[{"given":"Sietse","family":"Ringers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Verheul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaap-Henk","family":"Hoepman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Camenisch, J., de Medeiros, B.: Untraceable RFID tags via insubvertible encryption. In: Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS 2005), pp. 92\u2013101. ACM, New York (2005)","DOI":"10.1145\/1102120.1102134"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11832072_8","volume-title":"Security and Cryptography for Networks","author":"MH Au","year":"2006","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 111\u2013125. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832072_8"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., Lysyanskaya, A.: Anonymous credentials light. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security (CCS 2013), pp. 1087\u20131098. ACM, New York (2013)","DOI":"10.1145\/2508859.2516687"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-42045-0_5","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"F Baldimtsi","year":"2013","unstructured":"Baldimtsi, F., Lysyanskaya, A.: On the security of one-witness blind signature schemes. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 82\u201399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_5"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-69453-5_20","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"A Barki","year":"2016","unstructured":"Barki, A., Brunet, S., Desmoulins, N., Traor\u00e9, J.: Improved algebraic MACs and practical keyed-verification anonymous credentials. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 360\u2013380. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_20"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17455-1_2","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J-L Beuchat","year":"2010","unstructured":"Beuchat, J.-L., Gonz\u00e1lez-D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over Barreto\u2013Naehrig curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 21\u201339. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17455-1_2"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS 2012), pp. 326\u2013349. ACM, New York (2012)","DOI":"10.1145\/2090236.2090263"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"1_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5931.001.0001","volume-title":"Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy","author":"S Brands","year":"2000","unstructured":"Brands, S.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge (2000)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-72540-4_14","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Camenisch","year":"2007","unstructured":"Camenisch, J., Hohenberger, S., Pedersen, M.\u00d8.: Batch verification of short signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 246\u2013263. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_14"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93\u2013118. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., MacKenzie, P.: Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 354\u2013372. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_24"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"I Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445\u2013456. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_36"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-00862-7_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"AL Ferrara","year":"2009","unstructured":"Ferrara, A.L., Green, M., Hohenberger, S., Pedersen, M.\u00d8.: Practical short signature batch verification. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 309\u2013324. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_21"},{"key":"1_CR18","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). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"1_CR19","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. Cryptology ePrint Archive, Report 2014\/944 (2014). https:\/\/eprint.iacr.org\/2014\/944"},{"issue":"16","key":"1_CR20","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discrete Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-37288-9_5","volume-title":"Smart Card Research and Advanced Applications","author":"J Hajny","year":"2013","unstructured":"Hajny, J., Malina, L.: Unlinkable attribute-based credentials with practical revocation on smart-cards. In: Mangard, S. (ed.) CARDIS 2012. LNCS, vol. 7771, pp. 62\u201376. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37288-9_5"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-662-45472-5_17","volume-title":"Financial Cryptography and Data Security","author":"L Hanzlik","year":"2014","unstructured":"Hanzlik, L., Kluczniak, K.: A short paper on how to improve U-Prove using self-blindable certificates. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 273\u2013282. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_17"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-24018-3_13","volume-title":"Information Security Theory and Practice","author":"J-H Hoepman","year":"2015","unstructured":"Hoepman, J.-H., Lueks, W., Ringers, S.: On linkability and malleability in self-blindable credentials. In: Akram, R.N., Jajodia, S. (eds.) WISTP 2015. LNCS, vol. 9311, pp. 203\u2013218. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24018-3_13"},{"key":"1_CR24","unstructured":"IBM Research Z\u00fcrich Security Team: Specification of the identity mixer cryptographic library, version 2.3.0. Technical report, IBM Research, Z\u00fcrich, February 2012. https:\/\/tinyurl.com\/idemix-spec"},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"AK Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. J. Cryptol. 14(4), 255\u2013293 (2001)","journal-title":"J. Cryptol."},{"key":"1_CR26","unstructured":"Lysyanskaya, A.: Pseudonym systems. Master\u2019s thesis, Massachusetts Institute of Technology (1999). https:\/\/groups.csail.mit.edu\/cis\/theses\/anna-sm.pdf"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H., Adams, C. (eds.) SAC 1999. LNCS, vol. 1758, pp. 184\u2013199. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46513-8_14"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6"},{"key":"1_CR29","unstructured":"Paquin, C., Zaverucha, G.: U-Prove cryptographic specification v1.1 (revision 3), December 2013. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=166969. Released under the Open Specification Promise"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Ringers, S., Verheul, E., Hoepman, J.H.: An efficient self-blindable attribute-based credential scheme. Cryptology ePrint Archive, Report 2017\/115 (2017). https:\/\/eprint.iacr.org\/2017\/115","DOI":"10.1007\/978-3-319-70972-7_1"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-662-54970-4_20","volume-title":"Financial Cryptography and Data Security","author":"E Verheul","year":"2017","unstructured":"Verheul, E., Ringers, S., Hoepman, J.-H.: The self-blindable U-Prove scheme from FC\u201914 is forgeable (short paper). In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 339\u2013345. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_20"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-45682-1_31","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"ER Verheul","year":"2001","unstructured":"Verheul, E.R.: Self-blindable credential certificates from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 533\u2013551. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_31"},{"key":"1_CR34","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-37282-7_5","volume-title":"Policies and Research in Identity Management","author":"P Vullers","year":"2013","unstructured":"Vullers, P., Alp\u00e1r, G.: Efficient selective disclosure on smart cards using Idemix. In: Fischer-H\u00fcbner, S., de Leeuw, E., Mitchell, C. (eds.) IDMAN 2013. IAICT, vol. 396, pp. 53\u201367. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37282-7_5"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-18178-8_8","volume-title":"Information Security","author":"C Wachsmann","year":"2011","unstructured":"Wachsmann, C., Chen, L., Dietrich, K., L\u00f6hr, H., Sadeghi, A.-R., Winter, J.: Lightweight anonymous authentication with TLS and DAA for embedded mobile devices. In: Burmester, M., Tsudik, G., Magliveras, S., Ili\u0107, I. (eds.) ISC 2010. LNCS, vol. 6531, pp. 84\u201398. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18178-8_8"},{"key":"1_CR36","unstructured":"Wei, V.K., Yuen, T.H.: More short signatures without random oracles. IACR Cryptology ePrint Archive 2005, 463 (2005). http:\/\/eprint.iacr.org\/2005\/463"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70972-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T17:03:21Z","timestamp":1681405401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-70972-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319709710","9783319709727"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70972-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}