CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Off-Line Electronic Payment Scheme based on Publicly Verifiable Secret Sharing

Published on December 2011 by Mustapha Hedabou
journal_cover_thumbnail

Network Security and Cryptography
Foundation of Computer Science USA
NSC - Number 2
December 2011
Authors: Mustapha Hedabou
1b5bcd2e-51de-4bbb-a6f0-1e8007e2b9bb

Mustapha Hedabou . An Off-Line Electronic Payment Scheme based on Publicly Verifiable Secret Sharing. Network Security and Cryptography. NSC, 2 (December 2011), 15-19.

@article{
author = { Mustapha Hedabou },
title = { An Off-Line Electronic Payment Scheme based on Publicly Verifiable Secret Sharing },
journal = { Network Security and Cryptography },
issue_date = { December 2011 },
volume = { NSC },
number = { 2 },
month = { December },
year = { 2011 },
issn = 0975-8887,
pages = { 15-19 },
numpages = 5,
url = { /specialissues/nsc/number2/4329-spe022t/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Network Security and Cryptography
%A Mustapha Hedabou
%T An Off-Line Electronic Payment Scheme based on Publicly Verifiable Secret Sharing
%J Network Security and Cryptography
%@ 0975-8887
%V NSC
%N 2
%P 15-19
%D 2011
%I International Journal of Computer Applications
Abstract

In this paper, we introduce a new efficient technique allowing to render an off-line e-cash system traceable without need to a trusted party. The main idea is the use of the publicly verifiable secret sharing technique in order to revoke the anonymity of double spending users. The anonymity of honest users is still provided. Security analysis shows that the proposed technique does not undermine the security requirements of a traceable off-line e-cash scheme, including anonymity. A concrete construction of a traceable off-line e-cash system based on a particular blind signature scheme combined with the proposed technique is also given.

References
  1. H. ABELSON, R. ANDERSON, S. BELLOVIN, J. BENALOH, M. BLAZE, W. DIFFIE, J. GILMORE, P. NEUMANN, R. RIVEST, J. SCHILLER, AND B. SCHNEIER. The risks of key recovery, key escrow, and trusted third-party encryption. Online, available at http://www.cdt.org/crypto/risks98, 1998.
  2. M. AU, W. SUSILO, Y. MU. Practical anonymous divisible e-cash from bounded accumulators. In: Proceedings of Financial Cryptography and Data Security, Lecture Notes in Computer Science 5143. Springer-Verlag, pp. 287-301, 2008 .
  3. D. BONEH, M. FRANKLIN. Identity based encryption from the Weil pairing. In: Journal of Computing, Vol. 32(3), pp. 586-615, 2003.
  4. P. BRICKELL, P. GEMMEL, AND D. KRAVITZ. Extensions to anonymous cash and the making of anonymous change. In: Proceedings of The 6th ACM-SIAM, pp. 457-466, 1995.
  5. J.C. CHA AND J.H. CHEON. An identity-based signature from gap Diffie-Hellman groups. In: Public Key Cryptography-PKC 2003, LNCS 2139, pp. 18-30, Springer-Verlag, 2003.
  6. D. CHAUM. Blind signatures for untraceable payments. In: Advances in Cryptology-CRYPTO 82, New York: Plemum Press, pp. 199-203.
  7. D. CHAUM, A. FIAT, AND M. NAOR. Untraceable electronic cash. In: Advances in Cryptology-CRYPTO 88, Lecture Notes in Computer Science, 403, Springer Verlag, 1988, pp. 319327.
  8. P. FIELDMAN. A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science, 1987: pp. 427-437.
  9. Y. FRANKEL, Y. TSIOUNIS, M. YOUNG. Fair Off-Line e-cash Made Easy. In: Asiacrypt98, volume 1514 of LNCS, pages 257-270. Springer-Verlag, 1998.
  10. C. FUN. Awnership-attached unblinding of blind signatures for untraceable electronic cash. In: Information Science, 176(3), pp. 263-284, 2006.
  11. M. GAUD, J. TRAORE. On the Anonymity of Fair Off-Line e-Cash Systems. In:Financial Crypto 2003, LNCS 2742, pp. 34-50, 2003.
  12. D. KGLER AND H. VOGT. Fair Tracing without Trustees. In: Financial Crypto 2001, LNCS 2339, pp. 136-148, 2002.
  13. C. POPESCU. A Fair Off-line Electronic Cash System Based on Elliptic Curve Discrete Logarithm Problem. In: Studies in Informatics and Control, Volume 14, No. 4, 2005, pp. 291-298.
  14. A. SHAMIR. How to share a secret. In: Communications of the ACM, 22(11): pp. 612-613, 1979.
  15. M. STADLER. Public verifiable secret sharing. In: EUROCRYPT, LNCS 1996, 1070: pp. 190-199.
  16. M. STADLER, J. M. PIVETEAU AND J. CAMENISCH. Fair blind signatures. In: Advances in Cryptology - EUROCRYPT 95, LNCS 921,Springer-Verlag, pp. 209-219, 1995.
  17. F. ZHANG AND K. KIM. ID-based blind signature and ring signature from pairings. In: Asiacrpt2002, LNCS 2501, pp. 533-547, Springer-Verlag, 2002.
  18. F. ZHANG AND K. KIM. Efficient ID-based blind signature and proxy signature from bilinear pairings. In: ACISP 2003. LNCS, vol. 2727, pp. 312-323. Springer, Heidelberg (2003)
Index Terms

Computer Science
Information Sciences

Keywords

E-cash Threshold secret sharing