![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Nibesh Shrestha
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Isaac Doidge, Raghavendra Ramesh, Nibesh Shrestha, Joshua Tobkin:
Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals. CoRR abs/2401.01791 (2024) - [i10]Nibesh Shrestha, Aniket Kate, Kartik Nayak:
Sailfish: Towards Improving Latency of DAG-based BFT. IACR Cryptol. ePrint Arch. 2024: 472 (2024) - 2023
- [c5]Adithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik Nayak:
OptRand: Optimistically Responsive Reconfigurable Distributed Randomness. NDSS 2023 - [i9]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Communication and Round Efficient Parallel Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023: 1172 (2023) - 2022
- [i8]Adithya Bhat, Aniket Kate, Kartik Nayak, Nibesh Shrestha:
OptRand: Optimistically responsive distributed random beacons. IACR Cryptol. ePrint Arch. 2022: 193 (2022) - 2021
- [c4]Adithya Bhat, Nibesh Shrestha, Zhongtang Luo, Aniket Kate, Kartik Nayak:
RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. CCS 2021: 3502-3524 - [c3]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-Case Latency for Rotating Leader Synchronous BFT. OPODIS 2021: 27:1-27:19 - [c2]Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha:
Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. PODC 2021: 375-377 - [i7]Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha:
Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. IACR Cryptol. ePrint Arch. 2021: 603 (2021) - [i6]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-case Latency for Rotating Leader Synchronous BFT. IACR Cryptol. ePrint Arch. 2021: 1138 (2021) - [i5]Nibesh Shrestha, Adithya Bhat, Aniket Kate, Kartik Nayak:
Synchronous Distributed Key Generation without Broadcasts. IACR Cryptol. ePrint Arch. 2021: 1635 (2021) - 2020
- [c1]Nibesh Shrestha, Ittai Abraham, Ling Ren
, Kartik Nayak:
On the Optimality of Optimistic Responsiveness. CCS 2020: 839-857 - [i4]Ittai Abraham, Kartik Nayak, Ling Ren, Nibesh Shrestha:
On the Optimality of Optimistic Responsiveness. IACR Cryptol. ePrint Arch. 2020: 458 (2020) - [i3]Adithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik Nayak:
RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. IACR Cryptol. ePrint Arch. 2020: 1590 (2020)
2010 – 2019
- 2019
- [i2]Nibesh Shrestha, Mohan Kumar:
Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost. CoRR abs/1902.08505 (2019) - [i1]Nibesh Shrestha, Mohan Kumar:
Revisiting EZBFT: A Decentralized Byzantine Fault Tolerant Protocol with Speculation. CoRR abs/1909.03990 (2019)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint