You are looking at a specific version 20190527:160617 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. 5th International Conference on Mathematics and Computing
- Keywords
- one-way functionszero knowledge proofcomputational independenceproof of computation ability
- Contact author(s)
- saby math @ gmail com,sakurai @ inf kyushu-u ac jp
- History
- 2019-05-27: last of 2 revisions
- 2019-03-29: received
- See all versions
- Short URL
- https://ia.cr/2019/323
- License
-
CC BY