{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T12:35:23Z","timestamp":1789821323546,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540266563","type":"print"},{"value":"9783540316800","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11507840_12","type":"book-chapter","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T12:35:59Z","timestamp":1279197359000},"page":"93-108","source":"Crossref","is-referenced-by-count":20,"title":["A Privacy-Protecting Coupon System"],"prefix":"10.1007","author":[{"given":"Liqun","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Enzmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Steiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 431. Springer, Heidelberg (2000)"},{"key":"12_CR2","unstructured":"Brands, S.: An efficient off-line electronic cash system based on the representation problem. CWI Report, CS-R9323, Centrum voor Wiskunde en Informatica, CWI (1993)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Brands, S.: Rethinking Public Key Infrastructure and Digital Certificates \u2013 Building in Privacy. PhD thesis, Eindhoven Institute of Technology, The Netherlands (1999)","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., Chaum, D., Crep\u00e9au, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences\u00a037 (1988)","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1030083.1030103","volume-title":"Proc. 11th ACM Conference on Computer and Communications Security","author":"E. Brickell","year":"2004","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proc. 11th ACM Conference on Computer and Communications Security, pp. 132\u2013145. ACM Press, New York (2004)"},{"key":"12_CR6","unstructured":"Camenisch, J.: Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Z\u00fcrich, Switzerland (1998)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-30598-9_9","volume-title":"Security in Communication Networks","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Groth, J.: Group signatures: better efficiency and new theoretical aspects. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 120\u2013133. Springer, Heidelberg (2005)"},{"key":"12_CR8","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. 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.\u00a02045, p. 93. Springer, Heidelberg (2001)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Separability and efficiency for generic group signature schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 413. Springer, Heidelberg (1999)"},{"key":"12_CR11","volume-title":"Smart Card 2000, Proceedings","author":"D. Chaum","year":"1989","unstructured":"Chaum, D.: Privacy protected payments: Unconditional payer and\/or payee untraceability. In: Smart Card 2000, Proceedings, North-Holland, Amsterdam (1989)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-61581-4","volume-title":"Cryptography: Policy and Algorithms","author":"L. Chen","year":"1996","unstructured":"Chen, L.: Access with pseudonyms. In: Dawson, E.P., Goli\u0107, J.D. (eds.) Cryptography: Policy and Algorithms 1995. LNCS, vol.\u00a01029. Springer, Heidelberg (1996)"},{"key":"12_CR13","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":"12_CR14","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":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-27809-2_4","volume-title":"Financial Cryptography","author":"M. Enzmann","year":"2004","unstructured":"Enzmann, M., Fischlin, M., Schneider, M.: A privacy-friendly loyalty system based on discrete logarithms over elliptic curves. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 24\u201338. Springer, Heidelberg (2004)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Feinberg, F., Krishna, A., Zhang, Z.: Do we care what others get? A behaviorist approach to targeted promotions. Journal of Marketing Research\u00a039(3) (August 2002)","DOI":"10.1509\/jmkr.39.3.277.19108"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-48329-2_25","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"N. Ferguson","year":"1994","unstructured":"Ferguson, N.: Extensions of single term coins. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 292\u2013301. Springer, Heidelberg (1994)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Hoffman, D., Novak, T., Peralta, M.: Building consumer trust online. Communications of the ACM\u00a042(4) (April 1999)","DOI":"10.1145\/299157.299175"},{"key":"12_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-44566-8_52","volume-title":"User Modeling 2001","author":"A. Kobsa","year":"2001","unstructured":"Kobsa, A.: Tailoring privacy to users\u2019s needs. In: Bauer, M., Gmytrasiewicz, P.J., Vassileva, J. (eds.) UM 2001. LNCS (LNAI), vol.\u00a02109, p. 303. Springer, Heidelberg (2001)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Macintosh, G., Lockshin, L.: Retail relationships and store loyalty: A multi-level perspective. International Journal of Research in Marketing\u00a014(5) (December 1997)","DOI":"10.1016\/S0167-8116(97)00030-X"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BFb0055472","volume-title":"Financial Cryptography","author":"D. Maher","year":"1998","unstructured":"Maher, D.: A platform for privately defined currencies, loyalty credits, and play money. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 43\u201356. Springer, Heidelberg (1998)"},{"key":"12_CR23","volume-title":"Handbook on Electronic Commerce","author":"G. O\u2019Connor","year":"2000","unstructured":"O\u2019Connor, G., O\u2019Keefe, R.: The Internet as a new marketplace: Implications for consumer behaviour and marketing management. In: Handbook on Electronic Commerce. Springer, Heidelberg (2000)"},{"key":"12_CR24","volume-title":"5th International Conference on Electronic Commerce (ICEC 2003)","author":"A. Odlyzko","year":"2003","unstructured":"Odlyzko, A.: Privacy, Economics, and Price Discrimination on the Internet. In: 5th International Conference on Electronic Commerce (ICEC 2003). ACM Press, New York (2003)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/0-387-34805-0_43","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"T. Okamoto","year":"1990","unstructured":"Okamoto, T., Ohta, K.: Disposable zero-knowledge authentications and their applications to untraceable electronic cash. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 481\u2013496. Springer, Heidelberg (1990)"},{"key":"12_CR26","unstructured":"Pear, R.: Electronic cards replace coupons for food stamps. New York Times, June 23 (2004)"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-27809-2_21","volume-title":"Financial Cryptography","author":"P. Persiano","year":"2004","unstructured":"Persiano, P., Visconti, I.: An efficient and usable multi-show non-transferable anonymous credential system. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 196\u2013211. Springer, Heidelberg (2004)"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"de Santis, A., di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: IEEE Symposium on Foundations of Computer Science (FOCS) (November 1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Shaffer, G., Zhang, Z.: Competitivec coupon marketing. Marketing Science\u00a014(4) (1995)","DOI":"10.1287\/mksc.14.4.395"},{"key":"12_CR30","unstructured":"Shapiro, C., Varian, H.: Information Rules. Harvard Business School Press (1999)"},{"key":"12_CR31","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 - ASIACRYPT 2001","author":"E. Verheul","year":"2001","unstructured":"Verheul, E.: Self-blindable credential certificates from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, p. 533. Springer, Heidelberg (2001)"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-44463-7_22","volume-title":"Electronic Commerce and Web Technologies","author":"A. Wibowo","year":"2000","unstructured":"Wibowo, A., Lam, K., Tan, G.: Loyalty program scheme for anonymous payment systems. In: Bauknecht, K., Madria, S.K., Pernul, G. (eds.) EC-Web 2000. LNCS, vol.\u00a01875, p. 253. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11507840_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:38Z","timestamp":1605643418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11507840_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266563","9783540316800"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11507840_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}