Abstract
One year ago, four classes of blind signature schemes have been introduced: the hidden, the weak blind the interactive blind and the strong blind signature schemes. In this paper we present several hidden and weak blind signature schemes based on the Meta-ElGamal signature scheme and a hidden signature scheme based on the Meta-Message recovery signature scheme. All these schemes can be used in many applications like pseudonymous access control for credentials or for obtaining self-certified public keys. Therefore they can also be used for authentication and authentic key exchange schemes. Most of the new variants are very efficient, as they take advantage of the efficient variants of the Meta signature schemes.
Chapter PDF
Similar content being viewed by others
References
S. Brands, (1993), Untraceable off-line cash in wallets with observers, Lecture Notes in Computer Science 773, Advances in Cryptology: Proc. Crypto ‘83, Berlin: Springer Verlag, 1994, pp. 302–18.
J.L. Camenisch, J.-M. Piveteau, M.A. Stadler, (1994), Blind signature schemes based on the discrete logarithm problem, Preprint, Presented at Rump session of Eurocrypt ‘84, Perugia, Italy, 5 pages.
D. Chaum, (1982), Blind signatures for untraceable payments, Advances in Cryptology: Proc. Crypto ‘82, New York: Plenum, 1983, pp. 199–203.
T. ElGamal, (1984), Cryptography and logarithms over finite fields, Stanford University, CA., UMI Order No. DA 8420519, 119 pages.
L. Harn, (1994), New digital signature scheme based on discrete logarithm, Electronics Letters, vol. 30, No. 5, pp. 396–8.
P. Horster, H.-J. Knobloch, (1991), Discrete Logarithm based protocols, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt ‘81, Berlin: Springer Verlag, 1992, pp. 399–408.
P. Horster, M. Michels, H. Petersen, (1994), Meta-ElGamal signature schemes, Proc. 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, Nov. 2–4, 1994, pp. 96–107.
P.Horster, M.Michels, H.Petersen, (1994), Meta-Message recovery and Meta-blind signature schemes based on the discrete logarithm problem and their applications, Lecture Notes in Computer Science 917, Advances in Cryptology: Proc. Asiacrypt ‘84, Berlin: Springer Verlag, 1995, pp. 224–37.
P. Horster, H. Petersen, (1994), Verallgemeinerte ElGamal Signaturen, Sicherheit in Informationssystemen, Proceedings of SIS ‘84, Verlag der Fachvereine Zürich, pp. 89–106.
P. Horster, H. Petersen, (1994), Signature and authentication schemes based on the discrete logarithm (in German), Internal Report 94–9, RWTH Aachen, ISSN 0935–3232, March, 1994, 96 pages.
P. Horster, H. Petersen, (1994), Classification of blind signature schemes and examples of hidden and weak blind signatures, Rump Session of Eurocrypt ‘84, Perugia, Italy, Technical Report TR-94–1, University of Technology Chemnitz-Zwickau, 6 pages.
H.-J. Knobloch, (1994), A remark on the size of ElGamal-type digital signatures, E.I.S.S.Report 94–1, University of Karlsruhe, Germany, 5 pages.
National Institute of Standards and Technology, (1991), Federal Information Processing Standard, FIPS Pub XX: Digital Signature Standard (DSS).
K. Nyberg, R. Rueppel, (1993), A new signature scheme based on the DSA giving message recovery, 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, Nov. 3–5., 1993, pp. 58–61.
K. Nyberg, R. Rueppel, (1994), Message recovery for signature schemes based on the discrete logarithm problem, Pre-proceedings of Eurocrypt ‘84, pp. 175–90.
T. Okamoto, (1992), Provable secure and practical identification schemes and corresponding signature schemes, Lecture Notes in Computer Science 740, Advances in Cryptology: Proc. Crypto ‘82, Berlin: Springer Verlag, 1993, pp. 31–53.
C.P. Schnorr, (1989) Efficient identification and signatures for smart cards, Lecture Notes in Computer Science 435, Advances in Cryptology: Proc. Crypto ‘89, Berlin: Springer Verlag, 1990, pp. 239–51.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Horster, P., Michels, M., Petersen, H. (1995). Hidden signature schemes based on the discrete logarithm problem and related concepts. In: Posch, R. (eds) Communications and Multimedia Security. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34943-5_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-34943-5_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2908-4
Online ISBN: 978-0-387-34943-5
eBook Packages: Springer Book Archive