12/28/2023 0 Comments Current media meta message1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, Nov. K.Nyberg, R.Rueppel, ”A new signature scheme based on the DSA giving message recovery”, Proc. Standard, FIPS Pub XX: Digital Signature Standard (DSS), (1991). National Institute of Standards and Technology, Federal Information Process. H.-J.Knobloch, ”A remark on the size of ElGamal-type digital signatures”, EISS Report 94/1, European Institute for System Security (EISS), University of Karlsruhe, (1994), 5 pages.Ĭ.H.Lim, E-mail to the authors, August 20, (1994). P.Horster, H.Petersen, ”Classification of blind signature schemes and examples of hidden and weak blind signatures”, Technical Report TR-94-1, University of Technology Chemnitz-Zwickau, Presented at the Rump Session of Eurocrypt '94, Perugia, Italy, (1994), 6 pages. P.Horster, H.Petersen, ”Generalized ElGamal-signatures” (in German), Sicherheit in Informationssystemen, Proceedings of SIS '94, Zurich, March 10–11, 1994, Verlag der Fachvereine Zürich, (1994), pp. P.Horster, M.Michels, H.Petersen, ”Meta-Message recovery and Meta-Blind signature schemes based on the discrete logarithm problem and their applications”, (Full version), Technical Report TR-94-9, University of Technology Chemnitz-Zwickau, June, (1994), 22 pages. 2nd ACM conference on Computer and Communications security, Fairfax, Virginia, Nov. P.Horster, M.Michels, H.Petersen, ”Meta-ElGamal signature schemes”, Proc. P.Horster, M.Michels, H.Petersen, ”Meta signature schemes giving message recovery based on the discrete logarithm problem”, Proc. P.Horster, M.Michels, H.Petersen, ”Generalized ElGamal signature schemes for one message block”, Proc. P.Horster, M.Michels, H.Petersen, ”Authenticated encryption schemes with low communication costs”, Electronics Letters, Vol. Eurocrypt '91, Berlin: Springer Verlag, (1992), pp. P.Horster, H.-J.Knobloch, ”Discrete Logarithm based protocols”, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. Eurocrypt '89, Berlin: Springer Verlag, (1990), pp. 490–497.Ĭ.G.Günther, ”An identity based key exchange protocol”, Lecture Notes in Computer Science 434, Advances in Cryptology: Proc. Eurocrypt '91, Berlin: Springer Verlag, (1991), pp. M.Girault, ”Self-Certified Public Keys”, Lecture Notes in Computer Science 547, Advances in Cryptology: Proc. T.ElGamal, ”A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, Vol. T.ElGamal, ”Cryptography and logarithms over finite fields”, Stanford University, CA., UMI Order No. W.Diffie, M.Hellman,”New directions in cryptography”, IEEE Transactions on Information Theory, Vol. Eurocrypt '87, Berlin: Springer Verlag, (1988), pp. 199–203.ĭ.Chaum, J.H.Evertse, J.van deGraaf, ”Demonstrating possession of a discrete logarithms and some generalizations”, Lecture Notes in Computer Science 304, Advances in Cryptology: Proc. Crypto '82, New York: Plenum Press, (1983), pp. Chaum, ”Blind signatures for untraceable payments”, Advances in Cryptology: Proc. J.L.Camenisch, J.-M.Piveteau, M.A.Stadler, ”Blind signature schemes based on the discrete logarithm problem”, Preprint, presented at the Rump session of Eurocrypt '94, (1994), 5 pages.ĭ. Crypto '94, Berlin: Springer Verlag, (1994), pp. M.Burmester, ”On the risk of opening distributed keys”, Lecture Notes in Computer Science 839, Advances in Cryptology: Proc. Eurocrypt '90, Berlin: Springer Verlag, (1991), pp. 38–46.Į.F.Brickell, K.S.McCurley, ”An Interactive Identification scheme based on discrete logarithms and factoring”, Lecture Notes in Computer Science 473, Advances in Cryptology: Proc. This process is experimental and the keywords may be updated as the learning algorithm improves.į.Bauspieß, H.-J.Knobloch, ”How to keep authenticity alive in a computer network”, Lecture Notes in Computer Science 434, Advances in Cryptology: Proc. These keywords were added by machine and not by the authors. Again, we can extract highly efficient variants. Then we give interesting applications of the Meta-Message recovery and Meta-Blind signature schemes like authentic encryption schemes, key distribution protocols and authentication schemes. They can be recommended for practical use. From our Meta-scheme we get various variants from which some are more efficient than the already known ones. In this paper we present the Meta-blind signature schemes which have been developed from the ElGamal based blind signature scheme and the message recovery blind signature scheme discovered recently. Most of them can be embedded into a Meta-ElGamal and Meta-Message recovery scheme. There have been several approaches in the past to obtain signature schemes with appendix and signature schemes giving message recovery based on the discrete logarithm problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |