Communication Complexity of Perfect ZKIP for a Promise Problem (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We define the communication complexity of a perfect zero-knowledge interactive proof (ZKIP) as the expected number of bits communicated to achieve the given error probabilities (of both the completeness and the soundness). While the round complexity of ZKIPs has been studied greatly, no progress has been made for the communication complexity of those. This paper shows a perfect ZKIP whose communication complexity is 11 / 12 of that of the standard perfect ZKIP for a specific class of Quadratic Residuosity.
- 社団法人電子情報通信学会の論文
- 1993-01-25
著者
-
Satoh Takashi
Tokyo Institute Of Technology
-
Satoh Takashi
The Faculty Of Engineering Tokyo Institute Of Technology
-
Kurosawa Kaoru
the Faculty of Engineering, Tokyo Institute of Technology
-
Kurosawa Kaoru
The Faculty Of Engineering Tokyo Institute Of Technology
関連論文
- B-6-57 Collecting and distributing context for a ubiquitous service
- B-7-9 Context distribution network for ubiquitous services
- Communication Complexity of Perfect ZKIP for a Promise Problem (Special Section on Cryptography and Information Security)
- Information Theoretic Approach to Privacy for Multi-party protocols (Special Section on Cryptography and Information Security)
- ICONE11-36528 DEVELOPMENT OF ADVANCED CONCEPT FOR SHORTENING CONSTRUCTION PERIOD OF ABWR PLANT (PART2)
- Towards Secure and Fast Hash Functions (Special Section on Cryptography and Information Security)
- Towards Secure and Fast Hash Functions
- 5Move Statistical Zero Knowledge (Special Section on Cryptography and Information Security)
- Highly Nonlinear Vector Boolean Functions (Special Section on Discrete Mathematics and Its Applications)
- Generalization of Higher Order SAC to Vector Output Boolean Functions (Special Section on Cryptography and Information Security)