A NEW BATCH IDENTIFICATION SCHEME-Reference-Cited by-同舟云学术

A NEW BATCH IDENTIFICATION SCHEME

Published:2009-09 Issue:03 Volume:01 Page:369-376
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

DEHKORDI MASSOUD HADIAN¹,ALIMORADI REZA¹²

Affiliation:

1. Department of Mathematical Sciences, Iran University of Science and Technology, Narmak, Tehran, Iran

2. Research Center of Intelligent Signal Processing, Iran

Abstract

Identification protocols have a very important role in the world of electronic communication. In an identification protocol, the prover (user) proves to the verifier (center) that it is truly the authorized user who is communicating with the center. In one round of batch identification scheme a user with several secret keys (identities) can prove itself to the verifier instead of several proofs. In this paper, the first Weil pairing will be introduced. In addition, we propose a new batch zero-knowledge identification scheme based on the Weil pairing hereafter considered the security analysis of our proposed scheme.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830909000294

Reference16 articles.

1. Identity-Based Encryption from the Weil Pairing

2. Introduction to Cryptography

3. Zero-knowledge proofs of identity

4. The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems

5. Implementing the Tate Pairing

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A new certificateless multiple key agreement scheme;Discrete Mathematics, Algorithms and Applications;2017-02

2. Certificateless identification protocols from super singular elliptic curve;Security and Communication Networks;2013-08-15