default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdithya Bhat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Nibesh Shrestha, Adithya Bhat, Aniket Kate, Kartik Nayak:
Synchronous Distributed Key Generation without Broadcasts. IACR Commun. Cryptol. 1(2): 19 (2024)- [c11]Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Chen-Da Liu-Zhang, Michael K. Reiter:
Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles. DSN 2024: 456-469 - [c10]Akhil Bandarupalli, Adithya Bhat, Somali Chaterji, Michael K. Reiter, Aniket Kate, Saurabh Bagchi:
SensorBFT: Fault-Tolerant Target Localization Using Voronoi Diagrams and Approximate Agreement. ICDCS 2024: 186-197 - [c9]Zhongtang Luo, Adithya Bhat, Kartik Nayak, Aniket Kate:
Attacking and Improving the Tor Directory Protocol. SP 2024: 3221-3237 - [d2]Akhil Bandarupalli
, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon without Threshold Cryptography. Version 1. Zenodo, 2024 [all versions]
- [d1]Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon without Threshold Cryptography. Version 2. Zenodo, 2024 [all versions] - [i12]Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Chen-Da Liu-Zhang, Michael K. Reiter:
Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles. CoRR abs/2405.02431 (2024) - 2023
- [c8]Adithya Bhat, Akhil Bandarupalli, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
The Unique Chain Rule and Its Applications. FC (1) 2023: 38-55 - [c7]Adithya Bhat, Akhil Bandarupalli, Manish Nagaraj, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
EESMR: Energy Efficient BFT - SMR for the masses. Middleware 2023: 1-14 - [c6]Adithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik Nayak:
OptRand: Optimistically Responsive Reconfigurable Distributed Randomness. NDSS 2023 - [i11]Adithya Bhat, Akhil Bandarupalli, Manish Nagaraj, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
EESMR: Energy Efficient BFT-SMR for the masses. CoRR abs/2304.04998 (2023) - [i10]Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
HashRand: Efficient Asynchronous Random Beacon without Threshold Cryptographic Setup. IACR Cryptol. ePrint Arch. 2023: 1755 (2023) - 2022
- [i9]Adithya Bhat, Aniket Kate, Kartik Nayak, Nibesh Shrestha:
OptRand: Optimistically responsive distributed random beacons. IACR Cryptol. ePrint Arch. 2022: 193 (2022) - [i8]Alin Tomescu, Adithya Bhat, Benny Applebaum, Ittai Abraham, Guy Gueta, Benny Pinkas, Avishay Yanai:
UTT: Decentralized Ecash with Accountable Privacy. IACR Cryptol. ePrint Arch. 2022: 452 (2022) - 2021
- [c5]Sri Aravinda Krishnan Thyagarajan, Tiantian Gong, Adithya Bhat, Aniket Kate, Dominique Schröder:
OpenSquare: Decentralized Repeated Modular Squaring Service. CCS 2021: 3447-3464 - [c4]Adithya Bhat, Nibesh Shrestha, Zhongtang Luo, Aniket Kate, Kartik Nayak:
RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. CCS 2021: 3502-3524 - [c3]Sri Aravinda Krishnan Thyagarajan, Adithya Bhat, Bernardo Magri, Daniel Tschudi, Aniket Kate:
Reparo: Publicly Verifiable Layer to Repair Blockchains. Financial Cryptography (2) 2021: 37-56 - [i7]Adithya Bhat, Akhil Bandarupalli, Saurabh Bagchi, Aniket Kate, Michael K. Reiter:
Apollo - Optimistically Linear and Responsive SMR. IACR Cryptol. ePrint Arch. 2021: 180 (2021) - [i6]Sri Aravinda Krishnan Thyagarajan, Tiantian Gong, Adithya Bhat, Aniket Kate, Dominique Schröder:
OpenSquare: Decentralized Repeated Modular Squaring Service. IACR Cryptol. ePrint Arch. 2021: 1273 (2021) - [i5]Nibesh Shrestha, Adithya Bhat, Aniket Kate, Kartik Nayak:
Synchronous Distributed Key Generation without Broadcasts. IACR Cryptol. ePrint Arch. 2021: 1635 (2021) - 2020
- [c2]Sri Aravinda Krishnan Thyagarajan, Adithya Bhat, Giulio Malavolta, Nico Döttling, Aniket Kate, Dominique Schröder:
Verifiable Timed Signatures Made Practical. CCS 2020: 1733-1750 - [i4]Sri Aravinda Krishnan Thyagarajan, Adithya Bhat, Bernardo Magri, Daniel Tschudi, Aniket Kate:
Reparo: Publicly Verifiable Layer to Repair Blockchains. CoRR abs/2001.00486 (2020) - [i3]Sri Aravinda Krishnan Thyagarajan, Adithya Bhat, Giulio Malavolta, Nico Döttling, Aniket Kate, Dominique Schröder:
Verifiable Timed Signatures Made Practical. IACR Cryptol. ePrint Arch. 2020: 1563 (2020) - [i2]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
- [i1]Alekh Karkada Ashok, Chandan G, Adithya Bhat, Kaustubh Karnataki, Ganesh Shankar:
Automatic Inspection of Utility Scale Solar Power Plants using Deep Learning. CoRR abs/1902.04132 (2019) - 2015
- [c1]Adithya Bhat, Nusrat Sharmin Islam, Xiaoyi Lu, Md. Wasi-ur-Rahman, Dipti Shankar, Dhabaleswar K. Panda:
A Plugin-Based Approach to Exploit RDMA Benefits for Apache and Enterprise HDFS. BPOE 2015: 119-132
Coauthor Index
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-10-10 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
