Nibesh Shrestha
Nibesh Shrestha
Supra Labs
Verified email at - Homepage
Cited by
Cited by
Randpiper–reconfiguration-friendly random beacons with quadratic communication
A Bhat*, N Shrestha*, Z Luo, A Kate, K Nayak
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
On the optimality of optimistic responsiveness
N Shrestha, I Abraham, L Ren, K Nayak
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
Synchronous distributed key generation without broadcasts
N Shrestha, A Bhat, A Kate, K Nayak
IACR Communications in Cryptology 1 (2), 2024
OptRand: Optimistically Responsive Reconfigurable Distributed Randomness
A Bhat*, N Shrestha*, A Kate, K Nayak
Network and Distributed System Security Symposium (NDSS), 2023
Optimal good-case latency for rotating leader synchronous bft
I Abraham, K Nayak, N Shrestha
25th International Conference on Principles of Distributed Systems (OPODIS 2021), 2021
Communication and round efficient parallel broadcast protocols
I Abraham, K Nayak, N Shrestha
Cryptology ePrint Archive, 2023
Revisiting hbft: Speculative byzantine fault tolerance with minimum cost
N Shrestha, M Kumar, SS Duan
arXiv preprint arXiv:1902.08505, 2019
Brief announcement: Making synchronous bft protocols secure in the presence of mobile sluggish faults
J Kim, V Mehta, K Nayak, N Shrestha
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
Revisiting ezBFT: A decentralized Byzantine fault tolerant protocol with speculation
N Shrestha, M Kumar
arXiv preprint arXiv:1909.03990, 2019
Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals
I Doidge, R Ramesh, N Shrestha, J Tobkin
International Conference on Dependable Systems and Networks (DSN), 2024
Sailfish: Towards Improving the Latency of DAG-based BFT
N Shrestha, R Shrothrium, A Kate, K Nayak
Cryptology ePrint Archive, 2024
Efficient Synchronous Byzantine Consensus
N Shrestha
Rochester Institute of Technology, 2023
The system can't perform the operation now. Try again later.
Articles 1–12