The week's pick
Random Articles
Reseach Article
A Tripartite Signcryption Scheme with Applications to E-Commerce
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 76 - Number 15 |
| Year of Publication: 2013 |
| Authors: Yasmine Abouelseoud |
10.5120/13323-0842
|
Yasmine Abouelseoud . A Tripartite Signcryption Scheme with Applications to E-Commerce. International Journal of Computer Applications. 76, 15 ( August 2013), 33-38. DOI=10.5120/13323-0842
Abstract
Achieving confidentiality and authentication in e-commerce transactions are among the primary security goals. In this paper, a new cryptographic scheme is proposed which guarantees the authenticity of the customer and ensures the confidentiality of the communications among the bank, the merchant and the customer. The proposed solution is the use of a tripartite signcryption scheme with low computational and communications overhead. A variant of the proposed scheme that enables a firewall to authenticate the origin of the ciphertext without disclosure of the contents of the original plaintext message is also presented.
References
- SetCo 1997. Secure Electronic Transaction Specification: Business Description.
- Y. Zheng 1997. Digital Signcryption or How to Achieve Cost (Signature and Encryption) Cost (Signature) + Cost (Encryption). Advances in Cryptology, LNCS, Vol. 1294. Springer-Verlag. pp. 165–179.
- F. Li, Y. Hu and S. Liu 2006. Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings. In Proceedings of the 2nd Chinese Conference on Trusted Computing and Information Security (CTCIS'06), China.
- S. Duan and Z. Cao 2006. Efficient and Provably Secure Multi-receiver Identity-Based Signcryption. L. Batten and R. Safavi-Naini (Eds. ), ACISP 2006. Springer-Verlag. LNCS 4058, pp. 195-206.
- J. H. Silverman 1986. The Arithmetic of Elliptic Curves. GTM 106. Springer-Verlag.
- A. Menezes, T. Okamoto and S. Vanstone 1993. Reducing Elliptic Curve Logarithm to Logarithms in a Finite Field. IEEE Transactions on Information Theory, vol. 39, pp. 1639-1646.
- G. Frey and H. Ruck 1994. A Remark Concerning m-divisibility and the Discrete Logarithm Problem in the Divisor Class Group of Curves. Mathematics of Computation. Vol. 62, pp. 865-874.
- Standards for Efficient Cryptography 2000, SEC 2: Recommended Elliptic Curves Domain Parameters, Certicom Research, Version 1. 0.
- A. Joux 2002. The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. In Proceedings of the Fifth Algorithmic Number Theory Symposium. LNCS. Springer-Verlag.
- D. Boneh and M. Franklin 2001. Identity Based Encryption from the Weil Pairing, In Advances in Cryptology- CRYPTO 2001, LNCS 2139. Springer.
- V. Miller 2004. The Weil Pairing and Its Efficient Calculation. Journal of Cryptology, vol. 17(4), pp. 235-262.
- B. Lynn 2007. On the Implementation of Pairing-Based Cryptosystems, PhD thesis, Stanford University.
- H. L. McKinley 2003. SSL and TLS: A Beginner's Guide. SANS Institute.
- Z. Boping , and S. Shiyu 2009. An Improved SET Protocol. Proceedings of the 2009 International Symposium on Information Processing (ISIP'09). Huangshan, P. R. China. pp. 267-272
Index Terms
Keywords