M.de Soete, J.-J.Quisquater, K.Vedder, "A signature with shared verification scheme", Lecture Notes in Computer Science 435, Advances in Cryptology: Proc. Crypto '89, Berlin: Springer Verlag, (1990), pp. 253--262.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generalized Signature Schemes With (t,n) Shared.. - Horster, Michels.. (1994) (Correct)
....recouvrement de signature. 1. Introduction A digital signature scheme with (t; n) shared verification allows any t or more verifiers out of n verifiers to check the validity of a signature, but t Gamma 1 or less verifiers can t check the signature. So far, just de Soete, Quisquater and Vedder [SoQV89] and Harn [Harn93] presented solutions to this problem. In this paper we show how to generalize the solution due to Harn by the MetaElGamal signature scheme and the Meta Message recovery schemes [HMP294, HMP594] These schemes are generalizations of the ElGamal signature scheme [ElGa84] and the ....
M.de Soete, J.-J.Quisquater, K.Vedder, "A signature with shared verification scheme", Lecture Notes in Computer Science 435, Advances in Cryptology: Proc. Crypto '89, Berlin: Springer Verlag, (1990), pp. 253--262.
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (Correct)
.... concurrency of all verifiers is important, such that no verifier can gain an advantage of the knowledge of the authentic message before the other group members know its validity (e.g. tenders, bits) So far, there have been only proposals for the second concept by de Soete, Quisquater and Vedder [SoQV89], Harn [Harn93] as well as Lim and Lee [LiLe96] The first scheme is based on geometry and not resistant against dishonest verifiers. Harn s scheme was broken by Lee and Chang [LeCh95] Then, two modifications have been proposed by Harn [Harn95] one of which was also insecure and has been ....
M.de Soete, J.J.Quisquater, K.Vedder, "A signature with shared verification scheme", LNCS 435, Advances in Cryptology: Proc. Crypto'89, Springer, (1990), pp. 253 -- 262. This article was processed using the L a T E X macro package with LLNCS style
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (Correct)
.... of all verifiers is important, such that no verifier can gain an advantage of the knowledge of the authentic message before the other group members know its validity (e.g. tenders, bits) So far, there have been proposals only for the second concept due to de Soete, Quisquater and Vedder [SoQV89], due to Harn [Harn93] and due to Lim and Lee [LiLe96] The first scheme is based on geometry and is quite inefficient. Harn s scheme was broken by Lee and Chang [LeCh95] Then, two modifications have been proposed by Harn [Harn95] one of which is also insecure and has been improved [HoMP95] and ....
M.de Soete, J.J.Quisquater, K.Vedder, "A signature with shared verification scheme", Lecture Notes in Computer Science 435, Advances in Cryptology: Proc. Crypto'89, Springer Verlag, (1990), pp. 253 -- 262. This article was processed using the L A T E X macro package with LLNCS style
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