Scholarlink

In an Instance-Hiding Interactive Proof (IHIP) [BFS90], an efficient verifier with a private input x interacts with an unbounded prover to determine whether x is contained in a language \(\mathcal {L}\) . In addition to completeness and soundness, the instance-hiding property requires that the prover should not learn anything about x in the course of the interaction. Such proof systems capture natural privacy properties, and may be seen as a generalization of the influential concept of Randomized Encodings [IK00, AIK04, AIKPC15], and as a counterpart to Zero-Knowledge proofs [GMR89]. We investigate the properties and power of such instance-hiding proofs, and show the following:

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Instance-Hiding Interactive Proofs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Changrui Mu,
  • Prashant Nalini Vasudevan

摘要

In an Instance-Hiding Interactive Proof (IHIP) [BFS90], an efficient verifier with a private input x interacts with an unbounded prover to determine whether x is contained in a language \(\mathcal {L}\) . In addition to completeness and soundness, the instance-hiding property requires that the prover should not learn anything about x in the course of the interaction. Such proof systems capture natural privacy properties, and may be seen as a generalization of the influential concept of Randomized Encodings [IK00, AIK04, AIKPC15], and as a counterpart to Zero-Knowledge proofs [GMR89]. We investigate the properties and power of such instance-hiding proofs, and show the following: