{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:20:17Z","timestamp":1725578417739},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200762"},{"type":"electronic","value":"9783642200779"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20077-9_17","type":"book-chapter","created":{"date-parts":[[2011,3,6]],"date-time":"2011-03-06T18:55:01Z","timestamp":1299437701000},"page":"237-250","source":"Crossref","is-referenced-by-count":0,"title":["Flexible and Time-Based Anonymous Access Restrictions"],"prefix":"10.1007","author":[{"given":"Kristof","family":"Verslype","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"De Decker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"390","volume-title":"On defining proofs of knowledge","author":"M. Bellare","year":"1992","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge, pp. 390\u2013420. Springer, Heidelberg (1992)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/62212.62222","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988","author":"M. Blum","year":"1988","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 103\u2013112. ACM, New York (1988)"},{"key":"17_CR3","first-page":"431","volume-title":"Efficient proofs that a committed number lies in an interval","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"17_CR4","unstructured":"Brands, S.: A technical overview of digital credentials (1999)"},{"key":"17_CR5","doi-asserted-by":"crossref","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":"17_CR6","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system (2002)","DOI":"10.1145\/586111.586114"},{"key":"17_CR7","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 - EUROCRYPT 2001","author":"J.L. Camenisch","year":"2001","unstructured":"Camenisch, J.L., Lysyanskaya, A.: An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clone wars: Efficient periodic n-times anonymous authentication. Cryptology ePrint Archive, Report 2006\/454 (2006)","DOI":"10.1145\/1180405.1180431"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11832072_10","volume-title":"Security and Cryptography for Networks","author":"J. Camenisch","year":"2006","unstructured":"Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Balancing accountability and privacy using e-cash (extended abstract). In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 141\u2013155. Springer, Heidelberg (2006)"},{"issue":"10","key":"17_CR10","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. ACM Commun.\u00a028(10), 1030\u20131044 (1985)","journal-title":"ACM Commun."},{"key":"17_CR11","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.B., 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":"17_CR12","doi-asserted-by":"crossref","unstructured":"Damgard, I., Dupont, K., Pedersen, M.: Unclonable group identification (2006)","DOI":"10.1007\/11761679_33"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Damgard, I., Pedersen, T., Pfitzmann, B.: Statistical secrecy and multi-bit commitments (1996)","DOI":"10.7146\/brics.v3i45.20047"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)"},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11496137_22","volume-title":"Applied Cryptography and Network Security","author":"L. Nguyen","year":"2005","unstructured":"Nguyen, L., Safavi-Naini, R.: Dynamic k-times anonymous authentication. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 318\u2013333. Springer, Heidelberg (2005)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T. Pedersen","year":"1992","unstructured":"Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology, 103\u2013112 (1991)","DOI":"10.1007\/BF00196725"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-540-30539-2_22","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"I. Teranishi","year":"2004","unstructured":"Teranishi, I., Furukawa, J., Sako, K.: k-times anonymous authentication (extended abstract). In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 308\u2013322. Springer, Heidelberg (2004)"}],"container-title":["Communications in Computer and Information Science","e-Business and Telecommunications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20077-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T03:17:03Z","timestamp":1560050223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20077-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200762","9783642200779"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20077-9_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}