Date: 18 Dec 2002

Authentication of Concast Communication

* Final gross prices may vary according to local VAT.

Get Access


In this paper we tackle the problem of finding an efficient signature verification scheme when the number of signatures is signi.- cantly large and the verifier is relatively weak. In particular, we tackle the problem of message authentication in many-to-one communication networks known as concast communication.

The paper presents three signature screening algorithms for a variant of ElGamal-type digital signatures. The cost for these schemes is n applications of hash functions, 2n modular multiplications, and n modular additions plus the verification of one digital signature, where n is the number of signatures.

The paper also presents a solution to the open problem of finding a fast screening signature for non-RSA digital signature schemes.