Cryptology ePrint Archive: Report 2019/323
Theory and application of computationally independent one-way functions: Interactive proof of ability - Revisited
Sabyasachi Dutta and Kouichi Sakurai
Abstract: We introduce the concept of computationally independent pair of one-way functions (CI-OWF). We also provide two rich classes of examples of such functions based on standard assumptions. We revisit two-party interactive protocols for proving possession of computational power and existing two-flow challenge-response protocols. We analyze existing protocols for proof of computation power and propose a new two-flow protocol using CI-OWF based on square Diffie-Hellman problem.
Category / Keywords: cryptographic protocols / one-way functions, zero knowledge proof, computational independence, proof of computation ability
Original Publication (with minor differences): 5th International Conference on Mathematics and Computing
Date: received 24 Mar 2019, last revised 27 May 2019
Contact author: saby math at gmail com, sakurai at inf kyushu-u ac jp
Available format(s): PDF | BibTeX Citation
Version: 20190527:160617 (All versions of this report)
Short URL: ia.cr/2019/323
[ Cryptology ePrint archive ]