@inproceedings{12748c5049d145098d9535f5bff9d680,
title = "Authentication of concast communication",
abstract = "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.",
author = "Mohamed Al-Ibrahim and Hossein Ghodosi and Josef Pieprzyk",
year = "2002",
language = "English",
isbn = "9783540002635",
volume = "2551",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "185--198",
editor = "Alfred Menezes and Palash Sarkar",
booktitle = "Progress in Cryptology - INDOCRYPT 2002",
address = "United States",
note = "3rd International Conference on Cryptology in India, INDOCRYPT 2002 ; Conference date: 16-12-2002 Through 18-12-2002",
}