RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness

Schindler, Philipp; Judmayer, Aljosha; Hittmeir, Markus; Stifter, Nicholas; Weippl, Edgar

doi:10.14722/ndss.2021.24116

Cited by 18 publications

(16 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lenstra and Wesolowski proposed Unicorn [152] with a sufficiently long delay parameter (longer than the time period during which values may be submitted), even the last party to publish its random value cannot predict the final beacon outcome [139]. RandRunner [153] implements a trapdoor VDF with strong uniqueness and does not require an agreement protocol for the VDF inputs, which achieves much lower communication overhead. Additionally, the Ethereum research team [92] plans to use RANDAO [154] and VDF in the Ethereum beacon chain to randomly select block producers.…”

Section: Vdfmentioning

confidence: 99%

“…HE-Rand [93] is also synchronous as the protocol is described in rounds. RandRunner is designed for practical deployment scenarios with bounded network delay, while it still ensures liveness, public-verifiability, and bias-resistance even under periods of full asynchrony [153].…”

Section: Network Modelmentioning

confidence: 99%

“…§ In RandRunner, only unpredictability is affected by network asynchrony while all other properties remain unchanged. After the network conditions normalize, unpredictability is restored and the recovery time increases linearly with the duration of the asynchronous period [153]. ♣ In RandRunner, if all nodes execute the protocol properly and the network is reliable, the communication complexity is 𝑂 (𝑛).…”

Section: Network Modelmentioning

confidence: 99%

See 2 more Smart Citations

Building Blocks of Sharding Blockchain Systems: Concepts, Approaches, and Open Problems

Liu¹,

Liu²,

Salles³

et al. 2021

Preprint

View full text Add to dashboard Cite

Sharding is the prevalent approach to breaking the trilemma of simultaneously achieving decentralization, security, and scalability in traditional blockchain systems, which are implemented as replicated state machines relying on atomic broadcast for consensus on an immutable chain of valid transactions. Sharding is to be understood broadly as techniques for dynamically partitioning nodes in a blockchain system into subsets (shards) that perform storage, communication, and computation tasks without fine-grained synchronization with each other. Despite much recent research on sharding blockchains, much remains to be explored in the design space of these systems. Towards that aim, we conduct a systematic analysis of existing sharding blockchain systems and derive a conceptual decomposition of their architecture into functional components and the underlying assumptions about system models and attackers they are built on. The functional components identified are node selection, epoch randomness, node assignment, intra-shard consensus, cross-shard transaction processing, shard reconfiguration, and motivation mechanism. We describe interfaces, functionality, and properties of each component and show how they compose into a sharding blockchain system. For each component, we systematically review existing approaches, identify potential and open problems, and propose future research directions. We focus on potential security attacks and performance problems, including system throughput and latency concerns such as confirmation delays. We believe our modular architectural decomposition and in-depth analysis of each component, based on a comprehensive literature study, provides a systematic basis for conceptualizing state-of-the-art sharding blockchain systems, proving or improving security and performance properties of components, and developing new sharding blockchain system designs.

show abstract

Section: Vdfmentioning

confidence: 99%

Section: Network Modelmentioning

confidence: 99%

Section: Network Modelmentioning

confidence: 99%

See 1 more Smart Citation

Building Blocks of Sharding Blockchain Systems: Concepts, Approaches, and Open Problems

Liu¹,

Liu²,

Salles³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Randao [5, 6] is one such proposal where users contribute randomness in plain and the aggregation of these values is hashed and used as a starting point to compute the VDF. Similar protocols where also considered that use VDFs [24,53,68]. However these proposals require a trusted setup (to generate the RSA modulus 𝑁 ) and even when all parties are honest (optimistic case), one party still has to compute the delay function.…”

Section: Related Workmentioning

confidence: 99%

“…Timed commitments [8,19,25,45,49,57] and timed-based cryptography [15,40,63,74] have seen a recent surge of popularity in the research community, due to their wide array of applications. Examples of interest include protocols for distributed randomness generation [68], contract signing [17], e-voting [57], multi-signature transactions in cryptocurrencies [72], zero-knowledge arguments [44], and non-malleable commitments [54], among many others.…”

Section: Introductionmentioning

confidence: 99%

Efficient CCA Timed Commitments in Class Groups

Thyagarajan

Castagnos

Laguillaumie

et al. 2021

Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

Blockchain‐inspired lightweight trust‐based system in vehicular networks

et al. 2023

View full text Add to dashboard Cite

SummaryA decentralized application runs on the blockchain network without the intervention of a central authority. Transparency in transactions and security in vehicular networks are the issues for central systems. The proposed system uses blockchain‐based smart contracts, which eliminate the requirement for any third‐party verification. Additionally, with signature verification and reduced overhead, smart contracts also help in a fast and secure transaction. This study suggests a trust‐based system paradigm where certificate authority (CA) is employed for vehicle registration. We also propose a blockchain‐based system that provides efficient two‐way authentication and key agreement through encryption and digital signatures. The analysis of the proposed model reveals that it is an efficient way of establishing distributed trust management, which helps in preserving vehicle privacy. The proposed scheme is tested in Automated Validation of Internet Security‐sensitive Protocols (AVISPA), and security parameters verification in Network Simulator 2(NS2) also shows that the proposed scheme is more effective in comparison with existing schemes in terms of authentication cost, storage cost, and overhead.

show abstract

RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness

Cited by 18 publications

References 26 publications

Building Blocks of Sharding Blockchain Systems: Concepts, Approaches, and Open Problems

Building Blocks of Sharding Blockchain Systems: Concepts, Approaches, and Open Problems

Efficient CCA Timed Commitments in Class Groups

Blockchain‐inspired lightweight trust‐based system in vehicular networks

Contact Info

Product

Resources

About