Zero-Knowledge Proof for the Independent Set Problem

Pino CABALLERO-GIL

doi:10.1093/ietfec/e88-a.5.1301

Zero-Knowledge Proof for the Independent Set Problem

Pino CABALLERO-GIL

Full Text Views

0

Share
Cite this

Summary :

An efficient computational Zero-Knowledge Proof of Knowledge whose security relies on the NP-completeness of the Independent Set Problem is presented here. The proposed algorithm is constructed from a bit commitment scheme based on the hardness of the Discrete Logarithm Problem, which guarantees the fulfillment of soundness, completeness and computational zero-knowledge properties, and allows avoiding the use of the Graph Isomorphism Problem, which is present in every known Zero-Knowledge Proofs for the Independent Set Problem.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.5 pp.1301-1302

Publication Date: 2005/05/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.5.1301

Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Pino CABALLERO-GIL, "Zero-Knowledge Proof for the Independent Set Problem" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 5, pp. 1301-1302, May 2005, doi: 10.1093/ietfec/e88-a.5.1301.
Abstract: An efficient computational Zero-Knowledge Proof of Knowledge whose security relies on the NP-completeness of the Independent Set Problem is presented here. The proposed algorithm is constructed from a bit commitment scheme based on the hardness of the Discrete Logarithm Problem, which guarantees the fulfillment of soundness, completeness and computational zero-knowledge properties, and allows avoiding the use of the Graph Isomorphism Problem, which is present in every known Zero-Knowledge Proofs for the Independent Set Problem.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1301/_p

Copy

@ARTICLE{e88-a_5_1301,
author={Pino CABALLERO-GIL, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Zero-Knowledge Proof for the Independent Set Problem},
year={2005},
volume={E88-A},
number={5},
pages={1301-1302},
abstract={An efficient computational Zero-Knowledge Proof of Knowledge whose security relies on the NP-completeness of the Independent Set Problem is presented here. The proposed algorithm is constructed from a bit commitment scheme based on the hardness of the Discrete Logarithm Problem, which guarantees the fulfillment of soundness, completeness and computational zero-knowledge properties, and allows avoiding the use of the Graph Isomorphism Problem, which is present in every known Zero-Knowledge Proofs for the Independent Set Problem.},
keywords={},
doi={10.1093/ietfec/e88-a.5.1301},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Zero-Knowledge Proof for the Independent Set Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1301
EP - 1302
AU - Pino CABALLERO-GIL
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1301
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - An efficient computational Zero-Knowledge Proof of Knowledge whose security relies on the NP-completeness of the Independent Set Problem is presented here. The proposed algorithm is constructed from a bit commitment scheme based on the hardness of the Discrete Logarithm Problem, which guarantees the fulfillment of soundness, completeness and computational zero-knowledge properties, and allows avoiding the use of the Graph Isomorphism Problem, which is present in every known Zero-Knowledge Proofs for the Independent Set Problem.
ER -