---
res:
  bibo_abstract:
  - "CVRFs are PRFs that unify the properties of verifiable and constrained PRFs.
    Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy
    in 2014, it has been an open problem to construct CVRFs without using heavy machinery
    such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this
    problem by constructing a prefix-constrained verifiable PRF that does not rely
    on the aforementioned assumptions. Essentially, our construction is a verifiable
    version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage
    degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate
    values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group
    elements. These outputs can be verified using pairings since the underlying PRG
    is of degree 2.\r\nWe prove the selective security of our construction under the
    Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which
    we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness
    of recursive DDH in the generic group model assuming the hardness of the Multivariate
    Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast,
    in terms of applications, we observe that our CVRF is also an exponent (C)VRF
    in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25)
    with various applications to threshold cryptography in mind. In addition to that,
    we give further applications for prefix-CVRFs in the blockchain setting, namely,
    stake-pooling and compressible randomness beacons.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Nicholas
      foaf_name: Brandt, Nicholas
      foaf_surname: Brandt
  - foaf_Person:
      foaf_givenName: Miguel
      foaf_name: Cueto Noval, Miguel
      foaf_surname: Cueto Noval
      foaf_workInfoHomepage: http://www.librecat.org/personId=ffc563a3-f6e0-11ea-865d-e3cce03d17cc
    orcid: 0000-0002-2505-4246
  - foaf_Person:
      foaf_givenName: Christoph Ullrich
      foaf_name: Günther, Christoph Ullrich
      foaf_surname: Günther
      foaf_workInfoHomepage: http://www.librecat.org/personId=ec98511c-eb8e-11eb-b029-edd25d7271a1
  - foaf_Person:
      foaf_givenName: Akin
      foaf_name: Ünal, Akin
      foaf_surname: Ünal
      foaf_workInfoHomepage: http://www.librecat.org/personId=f6b56fb6-dc63-11ee-9dbf-f6780863a85a
    orcid: 0000-0002-8929-0221
  - foaf_Person:
      foaf_givenName: Stella
      foaf_name: Wohnig, Stella
      foaf_surname: Wohnig
  bibo_doi: 10.1007/978-3-032-12290-2_16
  bibo_volume: 16271
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  - http://id.crossref.org/issn/9783032122896
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Constrained verifiable random functions without obfuscation and friends@
...
