Efficient Zero-Knowledge Identification Schemes for Smart Cards | Zendy

Mike Burmester | Zendy; Yvo Desmedt | Zendy; T. Beth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Zero-Knowledge Identification Schemes for Smart Cards

Author(s) -

Mike Burmester,

Yvo Desmedt,

T. Beth

Publication year - 1992

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/35.1.21

Subject(s) - zero knowledge proof , scheme (mathematics) , identification scheme , computer science , identification (biology) , smart card , zero (linguistics) , algebraic number , computer security , theoretical computer science , cryptography , mathematics , data mining , mathematical analysis , linguistics , philosophy , botany , measure (data warehouse) , biology

Secure identification is an important security issue to avoid computer fraud due to masquerading. This can be achieved with zero-knowledge based smart cards. We present very efficient new zero-knowledge schemes in a general algebraic setting. Particular cases of our scheme improve the performance of the Guillou-Quisquater and the Chaum-Evertsevan de Graaf schemes. Our scheme is formally proven and, overall, is more efficient than currently available schemes including the Fiat-Shamir scheme. As an application we discuss how our scheme can be used for identification, in particular as an electronic passport scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research