Authentication of concast communication
Al-Ibrahim, Mohamed, Ghodosi, Hossein, and Pieprzyk, Josef (2002) Authentication of concast communication. Lecture notes in computer science, 2551. pp. 185-198.
Restricted to Repository staff only
In this paper we tackle the problem of finding an efficient signature verification scheme when the number of signatures is significantly 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.
|Item Type:||Article (UNSPECIFIED)|
|Keywords:||cryptography, digital signatures, authentication|
© 2002 : This journal is available online - use hypertext links above. : The original publication is available at SpringerLink (use hypertext links above) http://www.springerlink.com
|Date Deposited:||20 Sep 2006|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080609 Information Systems Management @ 0%
01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010101 Algebra and Number Theory @ 0%
08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080610 Information Systems Organisation @ 0%