K. Nyberg and R. A. Ruepple, Message recovery for signature schemes based on the discrete logarithm problem, Advances in cryptology --EUROCRYPT'94, Lecture Notes in Computer Science 950, pp.182--193, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Authentication of Concast Communication - Al-Ibrahim, Ghodosi, Pieprzyk (Correct)
....level. It is worth noting that these assumptions can be substituted with standard cryptographic techniques for achieving privacy and authenticity. 3. 2 Signature Scheme We employ a variant of ElGamal type digital signature, which is a slightly modified version of a signature that has been used in [15]. Let p; q be large primes such that qj(p Gamma 1) and let g 2 Z p = GF (p) be an element of order q. Let H( be an appropriate hash function that hashes messages of arbitrary length into an element of Z q . Also let x i 2 Z q be the secret key and y i = g (mod p) be the public key ....
K. Nyberg and R. Rueppel, "Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem," Designs, Codes and Cryptography, vol. 7, pp. 61--81, 1996. Also, Advances in Cryptology - Proceedings of EUROCRYPT '94 Vol. 950 LNCS, pp. 182-193.
An Authenticated Encryption Scheme without Block Encryption.. - Lee, Kim, Park (2002) (Correct)
....message. ######## 2000 # f x# ####21 ,#9L # ae #### ,####. 1 One way to implement such a scheme is first to sign a message and then to encrypt it. Nyberg and Rueppel suggested an authenticated encryption scheme of this type as an application of their message recovery signature scheme [4]. Other schemes try to reduce the computation and communication costs by combining encryption and signature. This type of schemes, which we call combined schemes, include the Horster Michels Petersen scheme [5] and the Lee Chang scheme [6] Recently proposed signcryption schemes [1, 2, 3, 7] ....
....5, we describe a modification of our scheme for a special case. We conclude in Section 6. 2 Related Work 2. 1 Horster Michels Petersen Scheme We first describe the Horster Michels Petersen authenticated encryption scheme [5] which is based on the Nyberg Rueppel message recovery signature scheme [4]. From now on, Alice is the sender and Bob is the recipient. ffl Initial Setting p : a large prime q : a large prime such that q j p Gamma 1 g 2 Z p : an element of Z p of order q xA 2 Z q : Alice s private key y A = g xA mod p : Alice s public key xB 2 Z q : ....
[Article contains additional citation context not shown here]
Nyberg, K. and Rueppel, R. A., "Message recovery for signature schemes based on the discrete logarithm problem," Eurocrypt '94, LNCS Vol.950, pp.182--193, Springer-Verlag, 1995.
A Scheme for obtaining a Warrant Message from the delegated.. - Lal, Awasthi (2003) (Correct)
....512 and g denotes a generator for Z p . Each user selects a secret key x u # Z q and computes a public key y u = g x u mod p, where Before introducing our proposed scheme it is necessary to introduce a following two related works. i.e. Kim et al. scheme [4] and Nyberg and Reuppel s scheme [9] Nyberg Reuppel s Signature Scheme [9] Signature Generation) To sign a message M # Z p the signer selects a random number k # Z q and computes R = M .g mod p, and S = R x k mod q where x is the secret key of signer.The pair (R, S) is the signature on the message M . Message recovery ....
.... . Each user selects a secret key x u # Z q and computes a public key y u = g x u mod p, where Before introducing our proposed scheme it is necessary to introduce a following two related works. i.e. Kim et al. scheme [4] and Nyberg and Reuppel s scheme [9] Nyberg Reuppel s Signature Scheme [9] (Signature Generation) To sign a message M # Z p the signer selects a random number k # Z q and computes R = M .g mod p, and S = R x k mod q where x is the secret key of signer.The pair (R, S) is the signature on the message M . Message recovery Verification) To verify the ....
[Article contains additional citation context not shown here]
Nyberg K., Rueppel R.,[1994] "Message recovery for signature schemes based on discrete logarithm problems," Pre-proceeding of Eurocrypt'94. pp 175-190.
Digital Signcryption or How to Achieve Cost(Signature &.. - Zheng (1997) (9 citations) (Correct)
....s) is Alice s signature on ,r, by checking whether fiaasa( y. r s rood p is satisfied. Since its publication in 1985, ElGinhal signature lt;k received extensive scrutiny by the research community. In addition, it tttk bccn generalized and adapted to numerous different forms (see for instmtcc [23, 4, 18, 20] and especially [11] where an exhaustive survey of some 13000 E1GamM based signatures has bccn carried out. Two notable variants of E1Gamal signature arc Schnorr signa ture [23] and DSS or Digital Signature Standard [18] With DSS, g is an integer in [1, p 1] with order q modulo p, where q ....
....p from r, s, g, p and y, and then check whether hash(k, m) is identical to r. To illustrate how to shorten E1Gamal bsc(t signatures, now we consider DSS. It should bc stressed that many other E1Gamal buscd signature chcmcs, in par titular those defined on a sub group of order q (scc for example [11, 20]) can bc shortened in the same way and arc dl equally good candidates for signcryption. Table i shows two shortened versions of DSS, whi( h arc denoted by SDSS1 and SDSS2 respectively. Hcrc arc a few remarks on the table: 1) the first letter S in the name of a scheme stands for shortened , ....
Nyberg, K., Rueppel, R.: Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography 7 (1996) 61 81.
An Efficient ID-based Digital Signature with Message.. - Tso, Gu, Okamoto.. (2006) (Correct)
No context found.
K. Nyberg and R. A. Ruepple, Message recovery for signature schemes based on the discrete logarithm problem, Advances in cryptology --EUROCRYPT'94, Lecture Notes in Computer Science 950, pp.182--193, 1995.
Optimal Asymmetric Encryption and Signature Paddings - Chevallier-Mames, al. (2005) (Correct)
No context found.
K. Nyberg and R. A. Rueppel. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. In Eurocrypt '94, LNCS 950, pages 182--193. Springer-Verlag, Berlin, 1995.
On the Security of the Lee-Chang Group - Signature Scheme And (Correct)
No context found.
Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology --- EUROCRYPT '94, LNCS 950, pp. 182--193. Springer-Verlag, 1995.
GOST 34.10 - A Brief Overview of Russia's DSA - Michels, Naccache, Petersen (1996) (Correct)
No context found.
K.Nyberg, R.A.Rueppel, "Message Recovery for SignatureSchemes Based on the Discrete Logarithm", Pre-proceedings of Eurocrypt'94,Perugia, Italy, (1994), pp. 175--190, to appear in Lecture Notes in Computer Sciences, Springer Verlag. Markus Michels, David Naccache, and Holger Petersen
Optimal Asymmetric Encryption and Signature Paddings - Chevallier-Mames, al. (2005) (Correct)
No context found.
K. Nyberg and R. A. Rueppel. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. In Eurocrypt '94, LNCS 950, pages 182--193. Springer-Verlag, Berlin, 1995.
On the Security of the Lee-Chang Group - Signature Scheme And (Correct)
No context found.
Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology --- EUROCRYPT '94, LNCS 950, pp. 182--193. Springer-Verlag, 1995.
GOST 34.10 - A Brief Overview of Russia's DSA - Michels, Naccache, Petersen (1996) (Correct)
No context found.
K.Nyberg, R.A.Rueppel, "Message Recovery for SignatureSchemes Based on the Discrete Logarithm", Pre-proceedings of Eurocrypt'94,Perugia, Italy, (1994), pp. 175--190, to appear in Lecture Notes in Computer Sciences, Springer Verlag. Markus Michels, David Naccache, and Holger Petersen
Efficient Group Signatures without Trapdoors - Ateniese, de Medeiros (2002) (1 citation) (Correct)
No context found.
K. Nyberg and R. A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology: Proceedings of EUROCRYPT'94, 1994.
On the Security of the Lee-Chang Group Signature Scheme and its.. - Joye, al. (1999) (2 citations) (Correct)
No context found.
Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology --- EUROCRYPT '94, LNCS 950, pp. 182--193. Springer-Verlag, 1995.
GOST 34.10 - A Brief Overview of Russia's DSA - Michels, Naccache, Petersen (1996) (Correct)
No context found.
K.Nyberg, R.A.Rueppel, "Message Recovery for SignatureSchemes Based on the Discrete Logarithm", Pre-proceedings of Eurocrypt'94,Perugia, Italy, (1994), pp. 175--190, to appear in Lecture Notes in Computer Sciences, Springer Verlag. Markus Michels, David Naccache, and Holger Petersen
Cryptanalysis of Chang et al.'s Signature Scheme with Message.. - Zhang (2004) (Correct)
No context found.
K. Nyberg and R.A. Rueppel, Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem, Proc. of Eurocrypt94, Springer-Verlag, LNCS 950, pp.182C193, 1995.
On the Security of the Lee-Chang Group Signature Scheme and.. - Joye, Lee, Hwang (1999) (2 citations) (Correct)
No context found.
Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology --- EUROCRYPT '94, LNCS 950, pp. 182--193. Springer-Verlag, 1995.
Automatic Event-Stream Notarization Using Digital Signatures - Schneier, Kelsey (1997) (1 citation) (Correct)
No context found.
K. Nyberg and R. Rueppel, \Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem," Advances in Cryptology | EUROCRYPT '94, Springer-Verlag, 1995, pp. 182-193. 14
GOST 34.10 - A Brief Overview of Russia's DSA - Michels, Naccache, Petersen (1996) (Correct)
No context found.
K.Nyberg, R.A.Rueppel, "Message Recovery for SignatureSchemes Based on the Discrete Logarithm", Pre-proceedings of Eurocrypt'94,Perugia, Italy, (1994), pp. 175--190, to appear in Lecture Notes in Computer Sciences, Springer Verlag. Markus Michels, David Naccache, and Holger Petersen
Security Analysis of Several Group Signature Schemes - Wang (2003) (1 citation) (Correct)
No context found.
K. Nyberg and R.A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 1996, 7(1-2): 61-81.
GOST 34.10 - A Brief Overview of Russia's DSA - Michels, Naccache, Petersen (1996) (Correct)
No context found.
K.Nyberg, R.A.Rueppel, "Message Recovery for SignatureSchemes Based on the Discrete Logarithm", Pre-proceedings of Eurocrypt'94,Perugia, Italy, (1994), pp. 175--190, to appear in Lecture Notes in Computer Sciences, Springer Verlag. Markus Michels, David Naccache, and Holger Petersen
On the Security of the Lee-Chang Group Signature Scheme and.. - Joye, Lee, Hwang (1999) (2 citations) (Correct)
No context found.
Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology --- EUROCRYPT '94, LNCS 950, pp. 182--193. Springer-Verlag, 1995.
Efficient Group Signatures without Trapdoors - Ateniese, de Medeiros (2002) (1 citation) (Correct)
No context found.
K. Nyberg and R. A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology: Proceedings of EUROCRYPT'94, 1994.
On the Security of the Lee-Chang Group Signature Scheme and.. - Joye, Lee, Hwang (1999) (2 citations) (Correct)
No context found.
Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology --- EUROCRYPT '94, LNCS 950, pp. 182--193. Springer-Verlag, 1995.
Short Signatures from the Weil Pairing - Boneh, Lynn, Shacham (2001) (159 citations) (Correct)
No context found.
K. Nyberg and R. Rueppel. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. Design Codes and Cryptography, 7:61-81, 1996.
Efficient Identity Based Signature Schemes Based on Pairings - Hess (2002) (11 citations) (Correct)
No context found.
K. Nyberg and R. A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 7(1/2), 61-81, 1996.
First 50 documents Next 50
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