A Note on Transformations of Interactive Proofs that Preserve the Prover's Complexity

スポンサーリンク

概要

• 論文の詳細を見る
• 2004-01-01

著者

• Hada Satoshi

  Ibm Tokyo Research Laboratory

関連論文

• Zero-Knowledge and Correlation Intractability(Information Security)
• A Note on Transformations of Interactive Proofs that Preserve the Prover's Complexity (Fundamental) (Cryptography and Information Security)
• A Formal Treatment of Non-repudiation Protocols(Information Security)
• A Note on Transformations of Interactive Proofs that Preserve the Prover's Complexity

スポンサーリンク