On digital signature schemes
Authors: N. Inassaridze, M. Joglidze
Affiliation: A.Razmadze Mathematical Institute of Tbilisi State University, Tamarashvili Str. 6, Tbilisi 0177, Georgia & Georgian Technical University & Tbilisi Centre for Mathematical Sciences 2University of Georgia, Kostava Str.77a, Tbilisi 0171, Georgia
ABSTRACT. Digital signature schemes are fundamental cryptographic primitives, useful as a stand-alone application, and as a building block in the design of secure protocols and other cryptographic objects. In this article, we give general overview of basic notions of digital signature schemes and discuss the multiple-time digital signature scheme given in [8]
References:
J.N.E.Bos and D.Chaum, Provably unforgeable signature, Advances in Cryptology – Crypto’92, LNCS, 740 (1993), 1-14
T.ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, Advances in Cryptology – CRYPTO ’84, LNCS 196, Springer (1985), 10-18.
P.Erdös, P.Frankl, and Z.Furedi, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics, 51 (1985), 79-89
S.Goldwasser, S.Micali and R.Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM J. Comput. 17(2) (1988), 281-308
D.Johnson and A.Menezes, The elliptic curve digital signature algorithm (ECDSA), Technical Report CORR 99-34, University of Waterloo, 1999. Available at http://www.cacr.math.uwaterloo.ca.
L.Lamport, Constructing digital signatures from a one way function, Technical Report SRICSL-98, SRI International Computer Science Laboratory, 1979
R.C.Merkle, A certified digital signature. Advances in Cryptology – CRYPTO ’89 Proceedings, LNCS 435, Springer (1989), 218-238
J.Pieprzyk, H.Wang and C.Xing, Multiple-time signature schemes against adaptive Chosen Message Attacks, In: Matsui, M., Zuccherato, R. (eds.) SAC 2003. LNCS 3006 (2004), 88-100.
M.O.Rabin. Digitalized signatures, Foundations of Secure Communication, Academic Press (1978), 155-168.
L.Reyzin and N.Reyzin, Better than BiBa: Short one-time signatures with fast signing and verifying, Information Security and Privacy (ACISP02), LNCS 2384, 144-153
R.L.Rivest, A.Shamir and L.Adleman, A method for obtaining digital signatures and publickey cryptosystems, Communications of the ACM, 21(2) (1978), 20-126
J.Rompel, One-way functions are necessary and sufficient for secure signatures, Proceedings of ACM STOC’90 (1990), 387-394
Menu