%0 Generic
%A Kavousi, Alireza
%A Wang, Zhipeng
%A Jovanovic, Philipp
%C Vienna, Austria
%D 2024
%F discovery:10198742
%I IEEE
%K Measurement, Manifolds, Proof of stake, Protocols, Scalability, Voting, Vectors
%P 216-234
%T SoK: Public Randomness
%U https://discovery.ucl.ac.uk/id/eprint/10198742/
%V 2014
%X Public randomness is a fundamental component in many cryptographic protocols and distributed systems and often plays a crucial role in ensuring their security, fairness, and transparency properties. Driven by the surge of interest in blockchain and cryptocurrency platforms and the usefulness of such a building block in those areas, designing secure protocols to generate public randomness in a distributed manner has received considerable attention in recent years. This paper presents a systematization of knowledge on the topic of public randomness with a focus on cryptographic tools providing public verifiability and key themes underlying these systems. We provide concrete insights on how state-of-the-art protocols achieve this task efficiently in an adversarial setting and present various research gaps that may be of interest for future research.
%Z This version is the author-accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.