{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:29:06Z","timestamp":1740137346089,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T00:00:00Z","timestamp":1564531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T00:00:00Z","timestamp":1564531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Johannes Kepler University Linz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10207-019-00458-7","type":"journal-article","created":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T14:03:01Z","timestamp":1564581781000},"page":"401-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Disposable dynamic accumulators: toward practical privacy-preserving mobile eIDs with scalable revocation"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-6409","authenticated-orcid":false,"given":"Michael","family":"H\u00f6lzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4675-0539","authenticated-orcid":false,"given":"Michael","family":"Roland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omid","family":"Mir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1566-4646","authenticated-orcid":false,"given":"Ren\u00e9","family":"Mayrhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,31]]},"reference":[{"key":"458_CR1","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., Camenisch, J., Dubovitskaya, M., Lysyanskaya, A., Reyzin, L., Samelin, K., Yakoubov, S.: Accumulators with applications to anonymity-preserving revocation. In: IEEE European Symposium on Security and Privacy, EuroS&P (2017)","DOI":"10.1109\/EuroSP.2017.13"},{"key":"458_CR2","doi-asserted-by":"crossref","unstructured":"Baric, N., Pfitzmann, B: Collision-free accumulators and fail-stop signature schemes without trees. In: Proc. EUROCRYPT \u201997, LNCS, vol. 1233, pp 480\u2013494. Springer, Berlin (1997)","DOI":"10.1007\/3-540-69053-0_33"},{"key":"458_CR3","doi-asserted-by":"crossref","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Proc. EUROCRYPT \u201993, pp. 274\u2013285. Springer, New York (1993)","DOI":"10.1007\/3-540-48285-7_24"},{"issue":"7","key":"458_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"458_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS \u201904, pp. 168\u2013177. ACM (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"458_CR6","doi-asserted-by":"crossref","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS \u201904, pp. 132\u2013145. ACM (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"458_CR7","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. In: Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society, WPES \u201907, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"458_CR8","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Lescuyer, R., Patey, A.: Efficient and strongly secure dynamic domain-specific pseudonymous signatures for ID documents. In: Financial Cryptography and Data Security, LNCS, vol. 8437, pp. 255\u2013272. Springer (2014)","DOI":"10.1007\/978-3-662-45472-5_16"},{"key":"458_CR9","first-page":"457","volume-title":"Hierarchical identities from group signatures and pseudonymous signatures","author":"J Bringer","year":"2016","unstructured":"Bringer, J., Chabanne, H., Lescuyer, R., Patey, A.: Hierarchical identities from group signatures and pseudonymous signatures, pp. 457\u2013469. Springer, Berlin (2016)"},{"key":"458_CR10","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Hajny, J.: Scalable revocation scheme for anonymous credentials based on N-times unlinkable proofs. In: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, WPES \u201916, pp 123\u2013133. ACM (2016)","DOI":"10.1145\/2994620.2994625"},{"key":"458_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Public Key Cryptography\u2014PKC 2009, LNCS, vol. 5443, pp. 481\u2013500. Springer (2009)","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"458_CR12","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Advances in Cryptology\u2014CRYPTO 2002, LNCS, vol. 2442, pp. 61\u201376. Springer (2002)","DOI":"10.1007\/3-540-45708-9_5"},{"key":"458_CR13","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Advances in Cryptology\u2014CRYPTO \u201997, LNCS, vol. 1294, pp. 410\u2013424. Springer (1997)","DOI":"10.1007\/BFb0052252"},{"key":"458_CR14","doi-asserted-by":"crossref","unstructured":"Chaum, D., Van Heyst, E.: Group signatures. In: Advances in Cryptology\u2014EUROCRYPT\u201991, LNCS, vol. 547, pp. 257\u2013265. Springer (1991)","DOI":"10.1007\/3-540-46416-6_22"},{"key":"458_CR15","unstructured":"de\u00a0Meer, H., Liedel, M., P\u00f6hls, H.C., Posegga, J., Samelin, K.: Indistinguishability of one-way accumulators. Technical report, MIP-1210, Faculty of Computer Science and Mathematics, University of Passau (2012)"},{"key":"458_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-45811-5_29","volume-title":"Information Security","author":"MT Goodrich","year":"2002","unstructured":"Goodrich, M.T., Tamassia, R., Hasi\u0107, J.: An efficient dynamic and distributed cryptographic accumulator. Information Security. LNCS, vol. 2433, pp. 372\u2013388. Springer, Berlin (2002)"},{"issue":"3","key":"458_CR17","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/JSAC.2011.110309","volume":"29","author":"J Haas","year":"2011","unstructured":"Haas, J., Hu, Y.-C., Laberteaux, K.: Efficient certificate revocation list organization and distribution. IEEE J. Sel. Areas Commun. 29(3), 595\u2013604 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"458_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1108\/IJPCC-09-2015-0032","volume":"11","author":"M H\u00f6lzl","year":"2015","unstructured":"H\u00f6lzl, M., Asnake, E., Mayrhofer, R., Roland, M.: A password-authenticated secure channel for app to java card applet communication. Int. J. Pervasive Comput. Commun. 11, 374\u2013397 (2015)","journal-title":"Int. J. Pervasive Comput. Commun."},{"key":"458_CR19","doi-asserted-by":"crossref","unstructured":"H\u00f6lzl, M., Mayrhofer, R., Roland, M.: Requirements for an open ecosystem for embedded tamper resistant hardware on mobile devices. In: Proc. MoMM 2013, International Conference on Advances in Mobile Computing & Multimedia, pp. 249\u2013252. ACM (2013)","DOI":"10.1145\/2536853.2536947"},{"key":"458_CR20","doi-asserted-by":"crossref","unstructured":"H\u00f6lzl, M., Roland, M., Mir, O., Mayrhofer, R.: Bridging the gap in privacy-preserving revocation: practical and scalable revocation for a privacy-aware mobile eID. In: Proceedings of SAC 2018: Symposium on Applied Computing, Pau, France, 04. ACM (2018)","DOI":"10.1145\/3167132.3167303"},{"key":"458_CR21","doi-asserted-by":"crossref","unstructured":"Kumar, V., Li, H., Park, J.-M.J., Bian, K., Yang, Y.: Group signatures with probabilistic revocation: a computationally-scalable approach for providing privacy-preserving authentication. In: Proc. of the 22nd Conference on Computer and Communications Security. ACM (2015)","DOI":"10.1145\/2810103.2813602"},{"key":"458_CR22","doi-asserted-by":"crossref","unstructured":"Lapon, J., Kohlweiss, M., Decker, B.D., Naessens, V.: Analysis of revocation strategies for anonymous idemix credentials. In: Communications and Multimedia Security, LNCS, vol. 7025, pp. 3\u201317. Springer (2011)","DOI":"10.1007\/978-3-642-24712-5_1"},{"key":"458_CR23","doi-asserted-by":"crossref","unstructured":"Libert, B., Vergnaud, D.: Group signatures with verifier-local revocation and backward unlinkability in the standard model. In: Cryptology and Network Security, LNCS, vol. 5888, pp. 498\u2013517. Springer (2009)","DOI":"10.1007\/978-3-642-10433-6_34"},{"key":"458_CR24","doi-asserted-by":"crossref","unstructured":"Lueks, W., Alp\u00e1r, G., Hoepman, J.-H., Vullers, P.: Fast revocation of attribute-based credentials for both users and verifiers. In: ICT Systems Security and Privacy Protection, LNCS, vol. 455, pp. 463\u2013478. Springer (2015)","DOI":"10.1007\/978-3-319-18467-8_31"},{"key":"458_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)"},{"key":"458_CR26","doi-asserted-by":"crossref","unstructured":"Nakanishi, T., Funabiki, N.: Verifier-local revocation group signature schemes with backward unlinkability from bilinear maps. In: Advances in Cryptology\u2014ASIACRYPT 2005, LNCS, vol. 4266, pp. 533\u2013548. Springer (2005)","DOI":"10.1007\/11593447_29"},{"key":"458_CR27","doi-asserted-by":"crossref","unstructured":"Nakanishi, T., Funabiki, N.: A short verifier-local revocation group signature scheme with backward unlinkability. In: Advances in Information and Computer Security, LNCS, vol. 4266, pp. 17\u201332. Springer (2006)","DOI":"10.1007\/11908739_2"},{"key":"458_CR28","doi-asserted-by":"crossref","unstructured":"Nakanishi, T., Funabiki, N.: A short anonymously revocable group signature scheme from decision linear assumption. In: Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS \u201908, pp. 337\u2013340. ACM (2008)","DOI":"10.1145\/1368310.1368359"},{"issue":"8","key":"458_CR29","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1109\/JSAC.2007.071006","volume":"25","author":"M Raya","year":"2007","unstructured":"Raya, M., Papadimitratos, P., Aad, I., Jungels, D., Hubaux, J.P.: Eviction of misbehaving and faulty nodes in vehicular networks. IEEE J. Sel. Areas Commun. 25(8), 1557\u20131568 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"7","key":"458_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00502-013-0157-x","volume":"130","author":"M Roland","year":"2013","unstructured":"Roland, M., Langer, J.: Comparison of the usability and security of NFC\u2019s different operating modes in mobile devices. e & i Elektrotechnik und Informationstechnik 130(7), 201\u2013206 (2013)","journal-title":"e & i Elektrotechnik und Informationstechnik"},{"key":"458_CR31","doi-asserted-by":"crossref","unstructured":"Sander, T., Ta-Shma, A., Yung, M.: Blind, auditable membership proofs. In: Financial Cryptography, LNCS, vol. 1962, pp. 53\u201371. Springer, Berlin (2000)","DOI":"10.1007\/3-540-45472-1_5"},{"issue":"9","key":"458_CR32","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1109\/TPDS.2010.14","volume":"21","author":"J Sun","year":"2010","unstructured":"Sun, J., Zhang, C., Zhang, Y., Fang, Y.: An identity-based security system for user privacy in vehicular ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 21(9), 1227\u20131239 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"458_CR33","doi-asserted-by":"crossref","unstructured":"Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: Blacklistable anonymous credentials: blocking misbehaving users without ttps. In: Proc. of the 14th ACM Conference on Computer and Communications Security, pp. 72\u201381. ACM (2007)","DOI":"10.1145\/1315245.1315256"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-019-00458-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-019-00458-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-019-00458-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T23:42:23Z","timestamp":1596066143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-019-00458-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,31]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["458"],"URL":"https:\/\/doi.org\/10.1007\/s10207-019-00458-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2019,7,31]]},"assertion":[{"value":"31 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}