P. Horster, M. Michels, and H. Petersen. Meta signature schemes giving message recovery based on the discrete logarithm problem. In Proceedings of 2nd int. workshop on IT-Security, 1994. Full paper available at http://www.geocities. com/CapeCanaveral/Lab/8967/TR-94-4.ps.gz. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
PECDSA. How to build a DL-based digital signature scheme with.. - Granboulan (2002) (Correct)
....worlds. We describe PECDSA, which has all the required properties. We also describe a variant of PECDSA with partial message recovery and the same security properties. 1.3 Related work Some e#ort has been done towards an global description of DL based schemes. Horster, Michels and Petersen [13 15] defined the Meta ElGamal signature schemes. Brickell, Pointcheval, Vaudenay and Yung [6] defined the Trusted ElGamal type signature schemes of type I and II. The security proofs in this paper are directly inspired from security proofs that were published for some DL based signature schemes ....
P. Horster, M. Michels, and H. Petersen. Meta signature schemes giving message recovery based on the discrete logarithm problem. In Proceedings of 2nd int. workshop on IT-Security, 1994. Full paper available at http://www.geocities. com/CapeCanaveral/Lab/8967/TR-94-4.ps.gz.
Secure Copyright Protection Techniques for Digital Images - Herrigel, al. (1998) (17 citations) Self-citation (Petersen) (Correct)
....a random seed instead of the described method. This leads to a longer message, which is not as robust as the chosen one, if we assume that the image ID consists of, for example, 12 bytes. The shortest known signature schemes with message recovery already produce a signature 20 bytes long [NyRu94,HoMP94] i.e. their output is 80 longer than our payload. 4.3 Trading of digital images The copyright holder H and the image buyer B with distinguished nameB are involved in the trading of digital images. Suppose (x H ; yH ) is the asymmetric key pair of H and (x B ; yB ) is the asymmetric key pair ....
P. Horster, M. Michels, H. Petersen, "`Meta signature schemes giving message recovery based on the discrete logarithm problem"', Proc. 2nd Int. Workshop on IT-Security, September, 1994, pp. 82 -- 92.
Meta-Multisignature schemes based on the discrete.. - Horster, Michels.. (1994) (5 citations) Self-citation (Horster Michels Petersen) (Correct)
....problem with this property was proposed by Harn [Har194, Har294] We give a brief review of this scheme in section 2 and present two attacks and countermeasure them in section 3. Then the Meta ElGamal (MEG) signature scheme [HMP194, HMP294] and Meta Message recovery (MMR) signature scheme [HMP394] are briefly described in sections 4 and 5. After this we show in sections 6 and 7 how to generalize the modified multisignature scheme to some variants of the the MEG and MMR signature scheme and give conditions which variants can be used. The scheme in section 7 is the first multisignature ....
....loose useful structural information for the security analysis. Therefore we prefer the first notation although it contains redundancy. 5. The Meta Message recovery scheme In a similar manner the ideas of the Meta ElGamal signature scheme were applied to signature schemes giving message recovery [HMP394]. The basic Message recovery scheme For a signature giving message recovery [NyRu93] the trusted authority chooses large primes p and q, where q is a large integer factor of p Gamma 1. She also chooses an element ff 2 Z p of order q. p; q and ff are system parameters and authentically known to ....
[Article contains additional citation context not shown here]
P.Horster, M.Michels, H.Petersen, "Meta signature schemes giving message recovery based on the discrete logarithm problem", Proc. Workshop on IT-Security, Vienna, Sept. 22--23, (1994), 12 pages. 12
Overview about ElGamal related publications from 1984 - 1994 - Horster, Michels, Petersen (1994) Self-citation (Horster Michels Petersen) (Correct)
No context found.
P.Horster, M.Michels, H.Petersen, "Meta signature schemes giving message recovery based on the discrete logarithm problem and some applications", Technical Report TR-94-7, Theoretical Computer Science and Information Security, TU ChemnitzZwickau, July, (1994), 10 pages.
Overview about ElGamal related publications from 1984 - 1994 - Horster, Michels, Petersen (1994) Self-citation (Horster Michels Petersen) (Correct)
.... signatures Encryption Authentication Key exchange Message recovery 1994 by Pe te rsen 1984 1985 1986 1987 1989 1990 1991 1993 1994 1992 1988 HoP94a, HoP94b HMP94b, HMP94d NIST91 AgMV90 ElG85a ElG84a, ElG84b Har94a, Har94b Knob94 YeLa93, Boyd94, Nybe94 Simm84 HMP94l Simm93 NyR93a NyR93b,NyRu94 HMP94c, HMP94f Sch91b Schn89, Sch91a ChEG87 FiSh86 Pive93 Pinc94 BrMc91 HoKn91 HoP94c HMP94i Chau82 CaPS94 HMP94g, HMP94h Okam92 HMP94k HMP94m SuHw91 HMP94a Sary90 HMP94h, HMP94j Pete93 Pete93 Gunt89 Gira91 BaKn89 Beth88 HMP94h, HMP94j HMP94h, HMP94j Burm94 Yaco91 YaSh89 Signature schemes Subl. ....
P.Horster, M.Michels, H.Petersen, "Meta signature schemes giving message recovery based on the discrete logarithm problem", Proc. Workshop IT-Sicherheit, Vienna, Sep. 22--23, Schriftenreihe der Osterreichischen Computergesellschaft, R.Oldenbourg, Vienna, (1994), pp. 82--92.
Meta-Message Recovery and Meta-Blind signature schemes.. - Horster, Michels.. (1994) (9 citations) Self-citation (Horster Michels Petersen) (Correct)
....1 Introduction 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. Most of them can be embedded into a Meta ElGamal and Meta Message recovery scheme [HoP194, HMP294, HMP394, HMP494] The concept of blind signature schemes was introduced by Chaum in 1982 [Chau82] In a blind signature scheme an owner Alice wants to obtain a digital signature on a message chosen by herself from the notary Nancy, but Nancy shouldn t have any idea which message she signs. If she gets ....
....the Meta ElGamal scheme by the tuple (Mode; d; e; f; g) but then we loose useful structural information for the security analysis. Therefore we prefer the first notation even if it contains redundancy. 3 The Meta Message recovery scheme The Meta Message recovery scheme has been proposed in [HMP394] The basic Message recovery scheme For a signature giving message recovery [NyRu93] the trusted authority chooses large primes p and q, where q is a large integer factor of p Gamma 1. She also chooses an element ff 2 Z p of order q. p; q and ff are system parameters and authentically ....
[Article contains additional citation context not shown here]
P.Horster, M.Michels, H.Petersen, "Meta signature schemes giving message recovery based on the discrete logarithm problem", Proc. 2. Int. Workshop on IT-Security, Wien, Sep. 22.--23., (1994), 12 pages.
PECDSA. How to build a DL-based digital signature scheme with.. - Granboulan (2002) (Correct)
No context found.
P. HorsteL M. Michels and H. Petersen. Meta signature schemes giving message recovery based on the discrete logarithm problem. Proc. 2nd int. workshop on IT-Security, Vienna, Sep. 1994. Available at http://ww.geocities. c om/CapeCanaveral/Lab/8967/TR- 94-4. ps. gz.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC