Strong Identification Based on a Hard-on-Average Problem

Pino CABALLERO-GIL

doi:10.1093/ietfec/e88-a.5.1117

Strong Identification Based on a Hard-on-Average Problem

Pino CABALLERO-GIL

Full Text Views

0

Share
Cite this

Summary :

The aim of this work is to investigate the possibility of designing zero-knowledge identification schemes based on hard-on-average problems. It includes a new two-party identification protocol whose security relies on a discrete mathematics problem classified as DistNP-Complete under the average-case analysis, the so-called Distributional Matrix Representability Problem. Thanks to the use of the search version of the mentioned problem, the zero-knowledge property is formally proved by black-box simulation, and consequently the security of the proposed scheme is actually guaranteed. Furthermore, with the proposal of a new zero-knowledge proof based on a problem never used before for this purpose, the set of tools for designing cryptographic applications is enlarged.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.5 pp.1117-1121

Publication Date: 2005/05/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.5.1117

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

Category

Cite this

Copy

Pino CABALLERO-GIL, "Strong Identification Based on a Hard-on-Average Problem" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 5, pp. 1117-1121, May 2005, doi: 10.1093/ietfec/e88-a.5.1117.
Abstract: The aim of this work is to investigate the possibility of designing zero-knowledge identification schemes based on hard-on-average problems. It includes a new two-party identification protocol whose security relies on a discrete mathematics problem classified as DistNP-Complete under the average-case analysis, the so-called Distributional Matrix Representability Problem. Thanks to the use of the search version of the mentioned problem, the zero-knowledge property is formally proved by black-box simulation, and consequently the security of the proposed scheme is actually guaranteed. Furthermore, with the proposal of a new zero-knowledge proof based on a problem never used before for this purpose, the set of tools for designing cryptographic applications is enlarged.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1117/_p

Copy

@ARTICLE{e88-a_5_1117,
author={Pino CABALLERO-GIL, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Strong Identification Based on a Hard-on-Average Problem},
year={2005},
volume={E88-A},
number={5},
pages={1117-1121},
abstract={The aim of this work is to investigate the possibility of designing zero-knowledge identification schemes based on hard-on-average problems. It includes a new two-party identification protocol whose security relies on a discrete mathematics problem classified as DistNP-Complete under the average-case analysis, the so-called Distributional Matrix Representability Problem. Thanks to the use of the search version of the mentioned problem, the zero-knowledge property is formally proved by black-box simulation, and consequently the security of the proposed scheme is actually guaranteed. Furthermore, with the proposal of a new zero-knowledge proof based on a problem never used before for this purpose, the set of tools for designing cryptographic applications is enlarged.},
keywords={},
doi={10.1093/ietfec/e88-a.5.1117},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Strong Identification Based on a Hard-on-Average Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1117
EP - 1121
AU - Pino CABALLERO-GIL
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1117
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - The aim of this work is to investigate the possibility of designing zero-knowledge identification schemes based on hard-on-average problems. It includes a new two-party identification protocol whose security relies on a discrete mathematics problem classified as DistNP-Complete under the average-case analysis, the so-called Distributional Matrix Representability Problem. Thanks to the use of the search version of the mentioned problem, the zero-knowledge property is formally proved by black-box simulation, and consequently the security of the proposed scheme is actually guaranteed. Furthermore, with the proposal of a new zero-knowledge proof based on a problem never used before for this purpose, the set of tools for designing cryptographic applications is enlarged.
ER -