nibeshrestha2's profile picture. Applied Researcher @SUPRA_Labs
PhD in  Computer Science | Distributed Consensus and Blockchains

Nibesh Shrestha

@nibeshrestha2

Applied Researcher @SUPRA_Labs PhD in Computer Science | Distributed Consensus and Blockchains

Nibesh Shrestha reposted

Excited that our paper Optimistic, Signature-Free Reliable Broadcast and Its Applications received a distinguished paper award at ACM CCS 2025. with @nibeshrestha2, Qianyu Yu, @giuliano_losa, @aniketpkate, @wang_xuechao

We got one of the distinguished paper awards! Congrats to the whole team!



Nibesh Shrestha reposted

What connects MPC, blockchain scalability, and post-quantum security? Find out at ACM CCS 2025, starting tomorrow in Taiwan, where we’re presenting two awesome projects! Tomorrow @akhilsai2712 will present Velox, PQ-secure MPC that is ready for real-world use. (paper:…


Excited to share our latest work “Optimistic, Signature-Free Reliable Broadcast and Its Applications”, accepted to ACM CCS 2025! Reliable Broadcast (RBC) is a key building block for BFT protocols. We present the first signature-free RBC that: ✅ Tolerates up to f < n/3 Byzantine…


Nibesh Shrestha reposted

Looking forward to speak at the Science and Engineering of Consensus workshop on Sunday in Berkeley. I'll talk about recent work with @kartik1507 and @nibeshrestha2 on our "Pipes" model for analysing blockchain protocols. One of the advantages of the model is that it actually…

AndrewLewisPye's tweet image. Looking forward to speak at the Science and Engineering of Consensus workshop on Sunday in Berkeley. I&apos;ll talk about recent work with @kartik1507 and @nibeshrestha2 on our &quot;Pipes&quot; model for analysing blockchain protocols. One of the advantages of the model is that it actually…

Nibesh Shrestha reposted

Fast finality for reliable broadcast,  asynchronous verifiable secret sharing (AVSS), asynchronous verifiable information dispersal (AVID), and blockchains while maintaining optimal fault tolerance of 33%! paper: arxiv.org/abs/2505.02761 Now, all these primitives can be…


Nibesh Shrestha reposted

A thread summarizing research on the good-case latency and resilience of partial synchrony protocols. Lower bound 1 (DLS): It is impossible to solve agreement under partial synchrony against a Byzantine adversary if f >= n/3. (decentralizedthoughts.github.io/2019-06-25-on-…) Lower bound 2 (Good-case…


Big update for Hydrangea! It now tolerates >33% faults (Byzantine or crash) and still commits in 2 rounds under certain parameterizations. For n = 3f + 2c + k + 1, Hydrangea commits in 2 rounds when faults <= (c+k)/2 for some parameter k; otherwise commits in 3 rounds while…

Presenting Hydrangea, an optimistic two-round partial synchrony protocol. With n = 3f + 3p + 1, under a good network and honest leader, parties commit in (i) two rounds when <= p parties are faulty, (ii) three rounds while tolerating f Byzantine faults and p crash faults. Paper…



Loading...

Something went wrong.


Something went wrong.