Skip to main content
Conference ProceedingsOPEN ACCESS

A remark on the efficiency of identification schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 473 LNCS 493-495
DOI: 10.1007/3-540-46877-3_47
7Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The efficiency parameters of identification schemes (memory size, communication cost, computational complexity) are based on given security levels and should allow for the ‘worst-case’ probability of error (forgery). We consider instances of the schemes in [0088] and [Sch90] for which the efficiency is not as good as claimed.

Cite

CITATION STYLE

APA

Burmester, M. (1991). A remark on the efficiency of identification schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 473 LNCS, pp. 493–495). Springer Verlag. https://doi.org/10.1007/3-540-46877-3_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free