Attributed metadata history
Up to 100 retained publisher events per page for 8977fa765e37f1f9935c83225362303ad9929e66965d0e7bb4a50865121056b1. Withdrawals and unavailable references remain attributed to their publishers.
intelligence_src_e53adb99e40ae66258
observed · 2026-10-13 04:25:05 UTC
ePrint Report: Efficient Unbiasable Verifiable Random Functions via (Non-)Black-Box Reductions Nicholas Brandt We present conceptually simple and practically efficient constructions of a verifiable random function (VRF) that fulfills strong notions of unbiasability recently introduced by Giunta and Stewart (Eurocrypt 2024). Unbiasability is a crucial property for many applications of VRFs such as leader election in proof-of-stake blockchains. The only previous constructions provide heuristic security in the random oracle model or rely on the decisional Diffie–Hellman assumption with preprocessing which incurs significant overhead. In contrast, our compiler turns any VRF into an unbiasable VRF in the standard model (without any setup) using only symmetric-key primitives; and thus only with negligible computational overhead. Underlying our approach, we provide a generic black-box reduction for unbiasability of VRFs that incurs subexponential loss. Additionally, under a mild (verifiable) requirement on the underlying VRF we also show a novel non-black-box reduction that incurs only polynomial loss. This no
Fingerprint: b3225450306574b60877ec217033e5355fdf9418e99a8c2f4bc988f0e1219b33
intelligence_src_e53adb99e40ae66258
observed · 2026-10-12 16:25:03 UTC
available
Fingerprint: 366cb966e32414edc1db353849a1ee8d6b8462b83786e04001881ba6594765ad