TY - GEN
T1 - (Commit-and-Prove) Predictable Arguments with Privacy
AU - Khoshakhlagh, Hamidreza
N1 - Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022/6
Y1 - 2022/6
N2 - Predictable arguments introduced by Faonio, Nielsen and Venturi [14] 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 [14] 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.
AB - Predictable arguments introduced by Faonio, Nielsen and Venturi [14] 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 [14] 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.
KW - Predictable arguments
KW - Witness encryption
KW - Witness indistinguishability
KW - Zero-knowledge
UR - http://www.scopus.com/inward/record.url?scp=85134348004&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-09234-3_27
DO - 10.1007/978-3-031-09234-3_27
M3 - Article in proceedings
AN - SCOPUS:85134348004
SN - 9783031092336
T3 - Lecture Notes in Computer Science (LNCS)
SP - 542
EP - 561
BT - Applied Cryptography and Network Security
A2 - Ateniese, Giuseppe
A2 - Venturi, Daniele
PB - Springer
T2 - 20th International Conference on Applied Cryptography and Network Security, ACNS 2022
Y2 - 20 June 2022 through 23 June 2022
ER -