A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications (Special lssue on Selected Papers from LA Synposium)

スポンサーリンク

概要

• 論文の詳細を見る

• We formalize a model of "demonstration of program result-correctness, "and investigate how to prove this fact against prossible adversaries, which naturally extends Blum's theory of program checking by adding zero-knowledge requirements. The zero-knowledge requirements are universal for yes and no instances alike.

• 一般社団法人電子情報通信学会の論文
• 2001-01-01

著者

• Sakurai Kouichi

  The Author Is With The Faculty Of Engineering Kyushu University

関連論文

• On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation(Special Section on Discrete Mathematics and Its Applications)
• Efficient Scalar Multiplications on Elliptic Curves with Direct Computations of Several Doublings : Special Section on Cryptography and Information Security
• Speeding Up Elliptic Scalar Multiplication Using Multidoubling(Special Section on Discrete Mathematics and Its Applications)
• A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications (Special lssue on Selected Papers from LA Synposium)

スポンサーリンク