Vinith Krishnan

dblp:271/4364 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › distributed randomness
distributed randomness beacon
0.612022
Spurt: Scalable Distributed Randomness Beacon with Transparent Setup · SP 2022
Cryptographic protocols and secure computation › secret sharing › verifiable secret sharing
publicly verifiable secret sharing
0.612022
Spurt: Scalable Distributed Randomness Beacon with Transparent Setup · SP 2022
Cryptographic protocols and secure computation
secret sharing
0.612022
Spurt: Scalable Distributed Randomness Beacon with Transparent Setup · SP 2022
Distributed systems
consensus
0.212022
Spurt: Scalable Distributed Randomness Beacon with Transparent Setup · SP 2022
Distributed systems › consensus
partial synchrony
0.212022
Spurt: Scalable Distributed Randomness Beacon with Transparent Setup · SP 2022

Methods — techniques the papers use, named apart from their topics

decisional bilinear diffie-hellman · 1.1PVSS · 1.1
YearPublicationVenuePosition
2022 Spurt: Scalable Distributed Randomness Beacon with Transparent Setup
abstract
Having shared access to high-quality random numbers is essential in many important applications. Yet, existing constructions of distributed random beacons still have limitations such as imperfect security guarantees, strong setup or network assumptions, or high costs. In this paper, we present Spurt, an efficient distributed randomness beacon protocol that does not require any trusted or expensive setup and is secure against a malicious adversary that controls up to one-third of the nodes in a partially synchronous network. We formally prove that each output of Spurt is unpredictable, bias-resistant, and publicly verifiable. Spurt has an amortized total communication cost of $O(\lambda n^{2})$ per beacon output where $\lambda$ is the security parameter. While designing Spurt, we also design a publicly verifiable secret sharing (PVSS) scheme whose security is based on the standard Decisional Bilinear Diffie-Hellman assumption and does not require a Random Oracle. We implement Spurt and evaluate it using a network of up to 128 nodes running in geographically distributed AWS instances. Our evaluation shows that Spurt can produce about 84 beacon outputs per minute in a network of 32 nodes and is comparable to systems with stronger assumptions or weaker security.
Sourav Das 0001, Vinith Krishnan, Irene Miriam Isaac, Ling Ren 0001
SP2