{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T18:13:17Z","timestamp":1785262397287,"version":"3.55.0"},"publisher-location":"Boston, MA","reference-count":30,"publisher":"Springer US","isbn-type":[{"value":"9780387334059","type":"print"},{"value":"9780387334066","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/0-387-33406-8_3","type":"book-chapter","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T08:55:55Z","timestamp":1153731355000},"page":"25-37","source":"Crossref","is-referenced-by-count":23,"title":["A General Certification Framework with Applications to Privacy-Enhancing Certificate Infrastructures"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dieter","family":"Sommer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roger","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bangerter, E., Camenisch, J., and Lysyanskaya, A. A cryptographic framework for the controlled release of certified data. In Twelfth International Workshop on Security Protocols 2004 (2004), LNCS, Springer Verlag."},{"key":"3_CR2","unstructured":"Boudot, F. Efficient proofs that a committed number lies in an interval. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431\u2013444."},{"key":"3_CR3","first-page":"318","volume":"1233","author":"S. Brands","year":"1997","unstructured":"Brands, S. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT\u2019 97 (1997), vol. 1233 of LNCS, Springer Verlag, pp. 318\u2013333.","journal-title":"EUROCRYPT\u2019 97"},{"key":"3_CR4","volume-title":"Rethinking Public Key Infrastructure and Digital Certificates\u2014 Building in Privacy","author":"S. Brands","year":"1999","unstructured":"Brands, S. Rethinking Public Key Infrastructure and Digital Certificates\u2014 Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands, 1999."},{"key":"3_CR5","unstructured":"Brickell, E., Camenisch, J., and Chen, L. Direct anonymous attestation. In ACM CCS\u2019 04, ACM Press, pp. 132\u2013145."},{"key":"3_CR6","unstructured":"Camenisch, J., and Damg\u00e5rd, I. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In ASIACRYPT 2000, vol. 1976 of LNCS, Springer Verlag, pp. 331\u2013345."},{"key":"3_CR7","first-page":"274","volume":"2576","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., and Lysyanskaya, A. A signature scheme with efficient protocols. In Third Conference on Security in Communication Networks (2002), vol. 2576 of LNCS, Springer Verlag, pp. 274\u2013295.","journal-title":"Third Conference on Security in Communication Networks"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Lysyanskaya, A. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, Springer Verlag.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"3_CR9","unstructured":"Camenisch, J., and Michels, M. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT\u2019 99, vol. 1592 of LNCS, Springer Verlag, pp. 107\u2013122."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume":"1666","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., and Michels, M. Separability and efficiency for generic group signature schemes. In CRYPTO\u2019 99 (1999), vol. 1666 of LNCS, Springer Verlag, pp. 413\u2013430.","journal-title":"CRYPTO\u2019 99"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Shoup, V. Practical verifiable encryption and decryption of discrete logarithms. In CRYPTO 2003, LNCS.","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"3_CR12","unstructured":"Camenisch, J., and Sommer, D. Tech. Rep. Research Report RZ 3646, IBM Zurich Research Laboratory, 2006."},{"key":"3_CR13","unstructured":"Camenisch, J., Sommer, D., and Zimmermann, R. A general certification framework with applications to privacy-enhancing certificate infrastructures. Tech. Rep. 3629, IBM Zurich Research Laboratory, November 2005."},{"key":"3_CR14","volume-title":"Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem","author":"J. L. Camenisch","year":"1998","unstructured":"Camenisch, J. L. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Z\u00fcrich, 1998. Diss. ETH No. 12520, Hartung Gorre Verlag, Konstanz."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BFb0054154","volume":"1403","author":"A. Chan","year":"1998","unstructured":"Chan, A., Frankel, Y., and Tsiounis, Y. Easy come \u2014 easy go divisible cash. In EUROCRYPT\u2019 98 (1998), vol. 1403 of LNCS, Springer Verlag, pp. 561\u2013575.","journal-title":"EUROCRYPT\u2019 98"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 2 (Feb. 1981), 84\u201388.","journal-title":"Communications of the ACM"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Chaum, D. Blind signature systems. In CRYPTO\u2019 83, Plenum Press, p. 153.","DOI":"10.1007\/978-1-4684-4730-9_14"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Chaum, D., and Pedersen, T. P. Wallet databases with observers. In CRYPTO\u2019 92, vol. 740 of LNCS, Springer-Verlag, pp. 89\u2013105.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"3_CR19","first-page":"257","volume":"547","author":"D. Chaum","year":"1991","unstructured":"Chaum, D., and van Heyst, E. Group signatures. In EUROCRYPT\u2019 91 (1991), vol. 547 of LNCS, Springer-Verlag, pp. 257\u2013265.","journal-title":"EUROCRYPT\u2019 91"},{"key":"3_CR20","first-page":"174","volume":"839","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., and Schoenmakers, B. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO\u2019 94 (1994), vol. 839 of LNCS, Springer Verlag, pp. 174\u2013187.","journal-title":"CRYPTO\u2019 94"},{"key":"3_CR21","unstructured":"Damg\u00e5rd, I. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431\u2013444."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., and Fujisaki, E. An integer commitment scheme based on groups with hidden order. In ASIACRYPT 2002, vol. 2501 of LNCS, Springer.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Fiat, A., and Shamir, A. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO\u2019 86, vol. 263 of LNCS, Springer Verlag, pp. 186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"3_CR24","unstructured":"Fujisaki, E., and Okamoto, T. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO\u2019 97, vol. 1294 of LNCS, Springer Verlag, pp. 16\u201330."},{"key":"3_CR25","unstructured":"Kiayias, A., Tsiounis, Y., and Yung, M. Traceable signatures. In EUROCRYPT, vol. 3027 of LNCS, Springer, pp. 571\u2013589."},{"key":"3_CR26","unstructured":"Kilian, J., and Petrank, E. Identity escrow. Theory of Cryptography Library, Record Nr. 97-11, http:\/\/theory.lcs.mit.edu\/~tcryptol, Aug. 1997."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Pedersen, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO\u2019 91, vol. 576 of LNCS, Springer Verlag, pp. 129\u2013140.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"3_CR28","unstructured":"PRIME project. www.prime-project.eu.org."},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., and Adleman, L. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 2 (Feb. 1978), 120\u2013126.","journal-title":"Communications of the ACM"},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"Schnorr, C. P. Efficient signature generation for smart cards. Journal of Cryptology 4, 3 (1991), 239\u2013252.","journal-title":"Journal of Cryptology"}],"container-title":["IFIP International Federation for Information Processing","Security and Privacy in Dynamic Environments"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-33406-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T17:53:13Z","timestamp":1558374793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-33406-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780387334059","9780387334066"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/0-387-33406-8_3","relation":{},"ISSN":["1571-5736"],"issn-type":[{"value":"1571-5736","type":"print"}],"subject":[],"published":{"date-parts":[[2006]]}}}