{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T10:26:15Z","timestamp":1773138375379,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642372872","type":"print"},{"value":"9783642372889","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37288-9_5","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T08:37:43Z","timestamp":1362472663000},"page":"62-76","source":"Crossref","is-referenced-by-count":23,"title":["Unlinkable Attribute-Based Credentials with Practical Revocation on Smart-Cards"],"prefix":"10.1007","author":[{"given":"Jan","family":"Hajny","sequence":"first","affiliation":[]},{"given":"Lukas","family":"Malina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/10721064_19","volume-title":"Smart Card. Research and Applications","author":"F. Bao","year":"2000","unstructured":"Bao, F.: An efficient verifiable encryption scheme for encryption of discrete logarithms. In: Quisquater, J.-J., Schneier, B. (eds.) CARDIS 2000. LNCS, vol.\u00a01820, pp. 213\u2013220. Springer, Heidelberg (2000)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1145\/1653662.1653734","volume-title":"Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009","author":"P. Bichsel","year":"2009","unstructured":"Bichsel, P., Camenisch, J., Gro\u00df, T., Shoup, V.: Anonymous credentials on a standard java card. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, pp. 600\u2013610. ACM, New York (2009)"},{"key":"5_CR3","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the rsa cryptosystem. Notices of the AMS\u00a046, 203\u2013213 (1999)","journal-title":"Notices of the AMS"},{"key":"5_CR4","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.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"5_CR5","unstructured":"Camenisch, J., et al.: Specification of the identity mixer cryptographic library, Tech. rep. (2010)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"5_CR8","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Tech. rep. (1997)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Commun. ACM\u00a028, 1030\u20131044 (1985)","journal-title":"Commun. ACM"},{"key":"5_CR10","unstructured":"Cramer, R.: Modular Design of Secure, yet Practical Cryptographic Protocols. Ph.D. thesis, University of Amsterdam (1996)"},{"key":"5_CR11","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.\u00a01751, pp. 354\u2013373. Springer, Heidelberg (2000)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - 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.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"5_CR14","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 - 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.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-32805-3_22","volume-title":"Communications and Multimedia Security","author":"J. Hajny","year":"2012","unstructured":"Hajny, J., Malina, L.: Practical revocable anonymous credentials. In: De Decker, B., Chadwick, D.W. (eds.) CMS 2012. LNCS, vol.\u00a07394, pp. 211\u2013213. Springer, Heidelberg (2012)"},{"key":"5_CR16","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-15257-3_26","volume-title":"Security and Privacy \u2013 Silver Linings in the Cloud","author":"J. Lapon","year":"2010","unstructured":"Lapon, J., Kohlweiss, M., De Decker, B., Naessens, V.: Performance analysis of accumulator-based revocation mechanisms. In: Rannenberg, K., Varadharajan, V., Weber, C. (eds.) SEC 2010. IFIP AICT, vol.\u00a0330, pp. 289\u2013301. Springer, Heidelberg (2010)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Malina, L., Hajny, J.: Accelerated Modular Arithmetic for Low-Performance Devices. In: 34th International Conference on Telecommunications and Signal Processing, pp. 131\u2013135. IEEE (2011)","DOI":"10.1109\/TSP.2011.6043757"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S1353-4858(08)70097-7","volume":"2008","author":"I. Naumann","year":"2008","unstructured":"Naumann, I., Hogben, G.: Enisa: Privacy features of eid cards. Network Security Newsletter\u00a02008, 9\u201313 (2008)","journal-title":"Network Security Newsletter"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"5_CR20","unstructured":"Paquin, C.: U-prove cryptographic specification v1.1, Tech. rep. (2011)"},{"key":"5_CR21","unstructured":"The European Commission: Safer internet programme (2012), \n                    \n                      http:\/\/ec.europa.eu\/information_society\/activities\/sip\/policy\/index_en.htm"},{"key":"5_CR22","unstructured":"The White House: National strategy for trusted identities in cyberspace (2011), \n                    \n                      http:\/\/www.whitehouse.gov\/sites\/default\/files\/rss_viewer\/NSTICstrategy_041511.pdf"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37288-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T10:33:15Z","timestamp":1557570795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37288-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642372872","9783642372889"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37288-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}