Cryptology ePrint Archive: Report 2022/377

(Commit-and-Prove) Predictable Arguments with Privacy

Hamidreza Khoshakhlagh

Abstract: Predictable arguments introduced by Faonio, Nielsen and Venturi (PKC17) are private-coin argument systems where the answer of the prover can be predicted in advance by the verifier. In this work, we study predictable arguments with additional privacy properties. While the authors in [PKC17] showed compilers for transforming PAs into PAs with zero-knowledge property, they left the construction of witness indistinguishable predictable arguments (WI-PA) in the plain model as an open problem. In this work, we first propose more efficient constructions of zero-knowledge predictable arguments (ZK-PA) based on trapdoor smooth projective hash functions (TSPHFs). Next, we consider the problem of WI-PA construction in the plain model and show how to transform PA into WI-PA using non-interactive witness-indistinguishable proofs. As a relaxation of predictable arguments, we additionally put forth a new notion of predictability called Commit-and-Prove Predictable Argument (CPPA), where except the first (reusable) message of the prover, all the prover’s responses can be predicted. We construct an efficient zero-knowledge CPPA in the non-programmable random oracle model for the class of all polynomial-size circuits. Finally, following the connection between predictable arguments and witness encryption, we show an application of CPPAs with privacy properties to the design of witness encryption schemes, where in addition to standard properties, we also require some level of privacy for the decryptors who own a valid witness for the statement used during the encryption process.

Category / Keywords: cryptographic protocols / predictable arguments, zero-knowledge, witness indistinguishability, witness encryption

Original Publication (with minor differences): ACNS 2022

Date: received 22 Mar 2022

Contact author: hamidreza at cs au dk

Available format(s): PDF | BibTeX Citation

Version: 20220328:143127 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]