Authentication of concast communication

Mohamed Al-Ibrahim, Hossein Ghodosi, Josef Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProgress in Cryptology - INDOCRYPT 2002
Subtitle of host publicationThird International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings
EditorsAlfred Menezes, Palash Sarkar
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages185-198
Number of pages14
Volume2551
ISBN (Electronic)9783540362319
ISBN (Print)9783540002635
Publication statusPublished - 2002
Event3rd International Conference on Cryptology in India, INDOCRYPT 2002 - Hyderabad, India
Duration: 16 Dec 200218 Dec 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2551
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Conference on Cryptology in India, INDOCRYPT 2002
CountryIndia
CityHyderabad
Period16/12/0218/12/02

Fingerprint Dive into the research topics of 'Authentication of concast communication'. Together they form a unique fingerprint.

Cite this