ZERO KNOWLEDGE INTERACTIVE PROOF SYSTEM FOR MODULO OPERATIONS

被引：0

作者：

KUROSAWA, K

机构：

来源：

IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS | 1991年 / 74卷 / 08期

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents an efficient ZKIP for SAT by using the K-th reisude cryptosystem. The proposed ZKIP is generalized to a ZKIP for the following problem. Let F(i)(i = 1, 2, ..., m) be a rational function over mod K. Given {F(i)}, does there exist (x1, x2, ..., x(n)) such that F(i)(x1, x2, ..., x(n)) = 0 mod K for i = 1, 2, ..., m?

引用

页码：2124 / 2128

页数：5