A language-dependent cryptographic primitive

Toshiya Itoh; Yuji Ohta; Hiroki Shizuya

doi:10.1007/s001459900018

A language-dependent cryptographic primitive

Toshiya Itoh, Yuji Ohta, Hiroki Shizuya

IEHE - Institute of Liberal Arts and Sciences

Tokyo Institute of Technology

Research output: Contribution to journal › Article › peer-review

33 Citations (Scopus)

Abstract

In this paper we provide a new cryptographic primitive that generalizes several existing zero-knowledge proofs and show that if a language L induces the primitive, then there exists a perfect zero-knowledge proof for L. In addition, we present several kinds of languages inducing the primitive, some of which are not known to have a perfect zero-knowledge proof.

Original language	English
Pages (from-to)	37-49
Number of pages	13
Journal	Journal of Cryptology
Volume	10
Issue number	1
DOIs	https://doi.org/10.1007/s001459900018
Publication status	Published - 1997

Keywords

Bit commitments
Language membership
Proofs of knowledge
Zero-knowledge proofs

Access to Document

10.1007/s001459900018

Cite this

@article{c61e8a411f094634b3c277247b5561a8,

title = "A language-dependent cryptographic primitive",

abstract = "In this paper we provide a new cryptographic primitive that generalizes several existing zero-knowledge proofs and show that if a language L induces the primitive, then there exists a perfect zero-knowledge proof for L. In addition, we present several kinds of languages inducing the primitive, some of which are not known to have a perfect zero-knowledge proof.",

keywords = "Bit commitments, Language membership, Proofs of knowledge, Zero-knowledge proofs",

author = "Toshiya Itoh and Yuji Ohta and Hiroki Shizuya",

year = "1997",

doi = "10.1007/s001459900018",

language = "English",

volume = "10",

pages = "37--49",

journal = "Journal of Cryptology",

issn = "0933-2790",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - A language-dependent cryptographic primitive

AU - Itoh, Toshiya

AU - Ohta, Yuji

AU - Shizuya, Hiroki

PY - 1997

Y1 - 1997

N2 - In this paper we provide a new cryptographic primitive that generalizes several existing zero-knowledge proofs and show that if a language L induces the primitive, then there exists a perfect zero-knowledge proof for L. In addition, we present several kinds of languages inducing the primitive, some of which are not known to have a perfect zero-knowledge proof.

AB - In this paper we provide a new cryptographic primitive that generalizes several existing zero-knowledge proofs and show that if a language L induces the primitive, then there exists a perfect zero-knowledge proof for L. In addition, we present several kinds of languages inducing the primitive, some of which are not known to have a perfect zero-knowledge proof.

KW - Bit commitments

KW - Language membership

KW - Proofs of knowledge

KW - Zero-knowledge proofs

UR - http://www.scopus.com/inward/record.url?scp=17744378427&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17744378427&partnerID=8YFLogxK

U2 - 10.1007/s001459900018

DO - 10.1007/s001459900018

M3 - Article

AN - SCOPUS:17744378427

SN - 0933-2790

VL - 10

SP - 37

EP - 49

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 1

ER -

A language-dependent cryptographic primitive

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this