Abstract
The blind digital signature protocols play important role in e-commerce applications. In this paper the new blind digital signature scheme with 384-bit signature length is proposed. The latter is achieved by using finite subgroup of the multiplicative group of the finite ring of residues modulo n, where n is a product of two large primes. It is shown that proposed signature satisfies unlinkability and unforgeability properties.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chaum, D.: Blind signature for untraceable payments. In: Advances in Cryptology (CRYPTO 1982), pp. 199–203. Plenum Press, New York (1983)
Tahat, N.M.F., Shatnawi, S.M.A., Ismail, E.S.: A New Partially Blind Signature Based on Factoring and Discrete Logarithms. J. of Mathematics and Statistics 4(2), 124–129 (2008)
Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, p. 780. CRC Press, Boca Raton (1997)
Boldyreva, A.: Efficient Threshold Signature, Multisignature and Blind Signature Schemes Based on the Gap-Diffi-Hellman-Group Signature Scheme. LNCS, vol. 2139, pp. 31–46, Springer, Heidelberg (2003)
Camenisch, J.L., Piveteau, J.-M., Stadler, M.A.: Blind Signatures Based on the Discrete Logarithm Problem. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 428–432. Springer, Heidelberg (1995)
Moldovyan, N.A., Moldovyan, A.A.: Blind Collective Signature Protocol Based on Discrete Logarithm Problem. J. of Network Security 11(2), 106–113 (2010)
Moldovyan, N.A.: Blind Signature Protocols from Digital Signature Standards. Int. J. of Network Security 13(1), 22–30 (2011)
Takagi, T.: A fast RSA-type public-key primitive modulo pkq using hensel lifting. IEICE Transactions E87-A(1), 94–101 (2004)
Moldovyan, N.A.: An approach to shorten digital signature length. Computer Science Journal of Moldova 14(3(42), 390–396 (2006)
Moldovyan, N.A.: Short Signatures from Difficulty of Factorization Problem. Int. J. of Network Security 8(1), 90–95 (2009)
Moldovyan, N.A.: Fast Signatures Based on Non-Cyclic Finite Groups. Quasigroups and Related Systems 18, 83–94 (2010)
Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology 13, 361–396 (2000)
Koblitz, N., Menezes, A.J.: Another Look at Provable Security. J. Cryptology 20, 3–38 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moldovyan, A., Moldovyan, N., Novikova, E. (2012). Blind 384-bit Digital Signature Scheme. In: Kotenko, I., Skormin, V. (eds) Computer Network Security. MMM-ACNS 2012. Lecture Notes in Computer Science, vol 7531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33704-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-33704-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33703-1
Online ISBN: 978-3-642-33704-8
eBook Packages: Computer ScienceComputer Science (R0)