A privacy-protecting coupon system

Lecture Notes in Computer Science

Volumn 3570, Issue , 2005, Pages 93-108

  Chen, Liqun ^a   Enzmann, Matthias ^b   Sadeghi, Ahmad Reza ^c   Schneider, Markus ^b   Steiner, Michael ^d  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

^b FRAUNHOFER GESELLSCHAFT   (Germany)

^c RUHR UNIVERSITY BOCHUM   (Germany)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; KNOWLEDGE ENGINEERING;

PRIVACY-PROTECTING COUPON SYSTEM; TUPLE; VENDORS;

DATA PRIVACY;

EID: 26444541889     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11507840_12     Document Type: Conference Paper

References (32)

1. F. Boudot. Efficient proofs that a commited number lies in an interval. Adv. in Cryptology EUROCRYPT 2000, LNCS 1807. Springer, 2000.
2. S. Brands. An efficient off-line electronic cash system based on the representation problem. CWI Report, CS-R9323, Centrum voor Wiskunde en Informatica (CWI), 1993.
3. S. Brands. Rethinking Public Key Infrastructure and Digital Certificates - Building in Privacy. PhD thesis, Eindhoven Institute of Technology, The Netherlands, 1999.
4. G. Brassard, D. Chaum, C. Crepéau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37, 1988.
5. E. Brickell, J. Camenisch, L. Chen. Direct anonymous attestation. Proc. 11th ACM Conference on Computer and Communications Security, pages 132-145, ACM press, 2004.
6. J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zürich, Switzerland, 1998.
7. J. Camenisch, J. Groth. Group signatures: better efficiency and new theoretical aspects. Forth Int. Conf. on Security in Communication Networks - SCN 2004, LNCS 3352, Springer, 2005.
8. J. Camenisch, A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. EUROCRYPT '01, LNCS 2045. Springer, 2001.
9. J. Camenisch, A. Lysyanskaya. A signature scheme with efficient protocols. Third Conference on Security in Communication Networks - SCN'02, LNCS 2576. Springer, 2002.
10. J. Camenisch, M. Michels. Separability and efficiency for generic group signature schemes. Adv. in Cryptology - CRYPTO '99, LNCS 1666. Springer Verlag, 1999.
11. D. Chaum. Privacy protected payments: Unconditional payer and/or payee untraceability. Smart Card 2000, Proceedings. North Holland, 1989.
12. L. Chen. Access with pseudonyms. Cryptography: Policy and Algorithms, International Conference, Brisbane, Australia, July, 1995, Proceedings, LNCS 1029. Springer, 1996.
13. R. Cramer, I. Damgård, B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. Adv. in Cryptology - CRYPTO '94, LNCS 839. Springer, 1994.
14. I. Damgård, E. Fujisaki. A statistically hiding integer commitment scheme based on groups with hidden order. Adv. in Cryptology - ASIACRYPT '02, LNCS 2501. Springer, 2002.
15. M. Enzmann, M. Fischlin, M. Schneider. A privacy-friendly loyalty system based on discrete logarithms over elliptic curves. Financial Cryptography, LNCS 3110, Feb. 2004.
16. F. Feinberg, A. Krishna, Z. Zhang. Do we care what others get? A behaviorist approach to targeted promotions. Journal of Marketing Research, 39(3), Aug. 2002.
17. N. Ferguson. Extensions of single term coins. Adv. in Cryptology - CRYPTO '93, LNCS 773. Springer, 1993.
18. E. Fujisaki, T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. Adv. in Cryptology - CRYPTO '97, LNCS 1294. Springer, 1997.
19. D. Huffman, T. Novak, M. Peralta. Building consumer trust online. Communications of the ACM, 42(4), Apr. 1999.
20. A. Kobsa. Tailoring privacy to users's needs. User Modeling 2001 (UM 2001), LNAI2109. Springer, 2001.
21. G. Macintosh, L. Lockshin. Retail relationships and store loyalty: A multi-level perspective. International Journal of Research in Marketing, 14(5), Dec. 1997.
22. D. Maher. A platform for privately defined currencies, loyalty credits, and play money. Financial Cryptography, LNCS 1465. Springer, 1998.
23. G. O'Connor, R. O'Keefe. The Internet as a new marketplace: Implications for consumer behaviour and marketing management. Handbook on Electronic Commerce. Springer, 2000.
24. A. Odlyzko. Privacy, Economics, and Price Discrimination on the Internet. 5th International Conference on Electronic Commerce (ICEC 2003). ACM Press, 2003.
25. T. Okamoto, K. Ohta. Disposable zero-knowledge authentications and their applications to untraceable electronic cash. Adv. in Cryptology - CRYPTO '89, LNCS 435. Springer, 1990.
26. R. Pear. Electronic cards replace coupons for food stamps. New York Times, June 23, 2004.
27. P. Persiano, I. Visconti. An efficient and usable multi-show non-transferable anonymous credential system. Financial Cryptography, LNCS 3110. Springer, Feb. 2004.
28. A. de Santis, G. di Crescenzo, G. Persiano, M. Yung. On monotone formula closure of SZK. In IEEE Symposium on Foundations of Computer Science (FOCS), November 1994.
29. G. Shaffer, Z. Zhang. Competitivec coupon marketing. Marketing Science, 14(4), 1995.
30. C. Shapiro, H. Varian. Information Rules. Harvard Business School Press, 1999.
31. E. Verheul. Self-blindable credential certificates from the weil pairing. Adv. in Cryptology ASIACRYPT '01, LNCS 2248. Springer-Verlag, 2001.
32. A. Wibowo, K. Lam, G. Tan. Loyalty program scheme for anonymous payment systems. Electronic Commerce and Web Technologies, LNCS 1875. Springer, 2000.