Paper 2026/1079

Witness Pseudorandom Functions for Vector Commitments and Applications

Pedro Branco, IE University

Nico Döttling, Helmholtz Center for Information Security (CISPA)

Sanjam Garg, UC Berkeley

Guru-Vamsi Policharla, Commonware

Abstract

A witness pseudorandom function (WPRF) is a PRF which has an additional mode of public evaluation. Given the public key, it can be evaluated publicly if one provides a valid NP witness for that input, while the output remains pseudorandom to anyone without such a witness. WPRFs are powerful objects, and general-purpose constructions are currently only known from assumptions that imply indistinguishability obfuscation. In this work, we construct a WPRF for a specific language related to the Libert-Yung vector commitment (TCC 2010). More specifically, public evaluation of the WPRF on an input is possible if a valid local opening for that input is provided. Our construction relies only on standard assumptions on pairing groups and is fully black-box. We further show that this primitive enables us to solve several open problems in the study of communication-efficient secure computation: - Rate-1 Laconic Oblivious Transfer. We construct a laconic oblivious transfer protocol with total communication complexity $2k+\mathsf{poly}(\lambda)$ for $k$ executions. Previously, achieving this efficiency required non-falsifiable assumptions such as evasive LWE (Wee, CRYPTO'24). - Near-optimal Laconic Private Set Intersection. We construct laconic private set intersection for which the amortized communication complexity approaches $\lambda$ bits per element in the sender's set (assuming each set element is represented by $\lambda$ bits) and is independent of the receiver's set. This is within a constant factor of the information-theoretic lower bound. - Rate-1 Batch Registration-Based Encryption. We construct a registration-based encryption scheme in which, when the encryptor sends multiple messages to multiple receivers, the ciphertext overhead is only two group elements.

@misc{cryptoeprint:2026/1079,
      author = {Rishabh Bhadauria and Pedro Branco and Nico Döttling and Sanjam Garg and Guru-Vamsi Policharla},
      title = {Witness Pseudorandom Functions for Vector Commitments and Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1079},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1079}
}