Authentication of concast communication
Al-Ibrahim, Mohamed, Ghodosi, Hossein, & Pieprzyk, Josef (2002) Authentication of concast communication. Lecture Notes in Computer Science, 2551, pp. 185-198.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Progress in Cryptology — INDOCRYPT 2002 : Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Copyright Owner:||Copyright 2002 Springer-Verlag Berlin Heidelberg|
|Deposited On:||03 Jul 2014 02:37|
|Last Modified:||03 Jul 2014 02:37|
Repository Staff Only: item control page