首页 | 本学科首页   官方微博 | 高级检索  
     


Quantifying knowledge complexity
Authors:O Goldreich  E Petrank
Affiliation:(1) Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel, e-mail: oded@wisdom.weizmann.ac.il, IL;(2) IBM - Haifa Research Laboratories, MATAM, Haifa, Israel, e-mail: erez@cs.princeton.edu, IL
Abstract:One of the many contributions of the paper of Goldwasser, Micali and Rackoff is the introduction of the notion of knowledge complexity. Knowledge complexity zero (also known as zero-knowledge) has received most of the attention of the authors and all the attention of their followers. In this paper, we present several alternative definitions of knowledge complexity and investigate the relations between them. Received: July 22, 1997.
Keywords:, Zero-Knowledge, Interactive Proofs, Knowledge Complexity, Randomness,
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号