A language-dependent cryptographic primitive

被引：33

作者：

Itoh, T ^{[1
]}

Ohta, Y ^{[1
]}

Shizuya, H ^{[1
]}

机构：

[1] TOHOKU UNIV, EDUC CTR INFORMAT PROC, AOBA KU, SENDAI, MIYAGI 98077, JAPAN

来源：

JOURNAL OF CRYPTOLOGY | 1997年 / 10卷 / 01期

关键词：

bit commitments; zero-knowledge proofs; language membership; proofs of knowledge;

D O I：

10.1007/s001459900018

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：37 / 49

页数：13

共 21 条

[1] STATISTICAL ZERO-KNOWLEDGE LANGUAGES CAN BE RECOGNIZED IN 2 ROUNDS [J].

AIELLO, W ;

HASTAD, J .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1991, 42 (03) :327-345

[2]

Bellare M., 1990, Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, P494, DOI 10.1145/100216.100285

[3]

BELLARE M, 1990, PROCEEDINGS OF THE TWENTY SECOND ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, P482, DOI 10.1145/100216.100283

[4]

BENOR M, 1990, LECT NOTES COMPUT SC, V403, P37

[5]

Blum Manual., 1987, INT C MATHEMATICIANS, P1444

[6] DOES CO-NP HAVE SHORT INTERACTIVE PROOFS [J].

BOPPANA, RB ;

HASTAD, J ;

ZACHOS, S .

INFORMATION PROCESSING LETTERS, 1987, 25 (02) :127-132

[7]

Boyar J., 1991, Journal of Cryptology, V4, P185, DOI 10.1007/BF00196727

[8] MINIMUM DISCLOSURE PROOFS OF KNOWLEDGE [J].

BRASSARD, G ;

CHAUM, D ;

CREPEAU, C .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (02) :156-189

[9]

CHANG R, 1989, 4TH P C STRUCTR COMP, P250

[10]

FEIGE U, 1990, LECT NOTES COMPUT SC, V435, P526

← 1 2 3 →