Constant-Space Zero-Knowledge Proofs Systems with One-Way Quantum Verifiers : Preliminary Report

スポンサーリンク

概要

• 論文の詳細を見る

• We discuss the notion of quantum zero-knowledge proof systems whose memory-limited verifiersreceive a stream of classical input symbols. We model such verifiers as one-way quantum finite automata working on input strings. Our proof systems require the recognition zero-knowledge property of Dwork and Stockmeyer [JACM, 1992]. Here, we report a preliminary set of fundamental properties of such proof systems. With the use of one-way quantum finite automata as verifiers, all proofs of the properties do not rely on any unproven complexity-theoretical assumptions.

• 一般社団法人電子情報通信学会の論文
• 2013-10-11

著者

• VILLAGRA Marcos

  Department of Information Science, University of Fukui

• YAMAKAKI Tomoyuki

  Department of Information Science, University of Fukui

関連論文

• Constant-Space Zero-Knowledge Proofs Systems with One-Way Quantum Verifiers : Preliminary Report

スポンサーリンク