Multiple denominations in E-cash with compact transaction data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6052 LNCS, Issue , 2010, Pages 82-97

  Canard, Sébastien ^a   Gouget, Aline ^b  

^a ORANGE LABS   (France)

^b GEMALTO   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX ZEROS; DOUBLE DISCRETE LOGARITHM; GENERATION METHOD; MONETARY VALUE; NEW CONSTRUCTION; TRANSACTION DATA; UNFORGEABILITY;

ALGEBRA; BINARY TREES; CRYPTOGRAPHY; ELECTRONIC COMMERCE;

ECONOMICS;

EID: 77955321165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14577-3_9     Document Type: Conference Paper

References (12)

1. Au, M.H., Susilo, W., Mu, Y.: Practical anonymous divisible e-cash from bounded accumulators. In: Financial Cryptography 2008, LNCS. Springer, Heidelberg (2008) (to appear)
2. Au, M.H., Wu, Q., Susilo, W., Mu, Y.: Compact e-cash from bounded accumulator. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.4377, pp. 178-195. Springer, Heidelberg (2007)
3. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSAInversion Problems and the Security of Chaum's Blind Signature Scheme. J. Cryptology 16(3), 185-215 (2003)
4. Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.5479, pp. 425-442. Springer, Heidelberg (2010)
5. Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credential. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. 5443, vol.LNCS, pp. 481-500. Springer, Heidelberg (2009) (to appear)
6. Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.2442, pp. 61-76. Springer, Heidelberg (2002)
7. Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.3152, pp. 56-72. Springer, Heidelberg (2004)
8. Canard, S., Coisel, I., Traoŕe, J.: Complex zero-knowledge proofs of knowledge are easy to use. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol.4784, pp. 122-137. Springer, Heidelberg (2007)
9. Canard, S., Gouget, A.: Divisible e-cash systems can be truly anonymous. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.4515, pp. 482-497. Springer, Heidelberg (2007)
10. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.263, pp. 186-194. Springer, Heidelberg (1987)
11. Nakanishi, T., Sugiyama, Y.: Unlinkable divisible electronic cash. In: Okamoto, E., Pieprzyk, J.P., Seberry, J. (eds.) ISW 2000. LNCS, vol.1975, pp. 121-134. Springer, Heidelberg (2000)
12. Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.3376, pp. 275-292. Springer, Heidelberg (2005)