Adithya Bhat

ORCID: 0000-0003-4099-4014
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptography and Data Security
  • Distributed systems and fault tolerance
  • Blockchain Technology Applications and Security
  • Cloud Computing and Resource Management
  • Cloud Data Security Solutions
  • Internet Traffic Analysis and Secure E-voting
  • Advanced Data Storage Technologies
  • Distributed and Parallel Computing Systems
  • Modular Robots and Swarm Intelligence
  • Target Tracking and Data Fusion in Sensor Networks
  • Access Control and Trust
  • Cardiac Imaging and Diagnostics
  • Advanced Neural Network Applications
  • Radiation Effects in Electronics
  • Peer-to-Peer Network Technologies
  • Ferroelectric and Negative Capacitance Devices
  • Cryptography and Residue Arithmetic
  • Electroconvulsive Therapy Studies
  • IoT and Edge/Fog Computing
  • Complexity and Algorithms in Graphs
  • Fault Detection and Control Systems
  • Advanced Memory and Neural Computing
  • Caching and Content Delivery
  • Age of Information Optimization
  • Power Line Inspection Robots

Visa (United States)
2024

Purdue University West Lafayette
2020-2024

Visa (United Kingdom)
2024

Duke University
2023

Rochester Institute of Technology
2023

Taylor Family Institute for Innovative Psychiatric Research
2017

The Ohio State University
2015-2016

A verifiable timed signature (VTS) scheme allows one to time-lock a on known message for given amount of time T such that after performing sequential computation anyone can extract the from time-lock. Verifiability ensures publicly check if contains valid without solving it first, and be obtained by same T.

10.1145/3372297.3417263 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2020-10-30

A random beacon provides a continuous public source of randomness and its applications range from lotteries to zero-knowledge proofs. Existing protocols sacrifice either the fault tolerance or communication complexity for security, ease reconfigurability. This work overcomes challenges with existing works through novel efficient combination state machine replication (Publicly) Verifiable Secret Sharing (PVSS/VSS).

10.1145/3460120.3484574 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2021-11-12

Public random beacons publish numbers at regular intervals, which anyone can obtain and verify.The design of public distributed has been an exciting research direction with significant implications for blockchains, voting, beyond.Distributed beacons, in addition to being bias-resistant unpredictable, also need have low communication overhead latency, high resilience faults, ease reconfigurability.Existing synchronous beacon protocols sacrifice one or more these properties.In this work, we...

10.14722/ndss.2023.24832 article EN 2023-01-01

While electroconvulsive therapy is widely regarded as a lifesaving and safe procedure, evidence regarding its effects on myocardial cell injury sparse. The objective of this investigation was to determine the incidence magnitude new cardiac troponin elevation after using novel high-sensitivity I assay.

10.1097/aln.0000000000001531 article EN Anesthesiology 2017-02-10

Distributed key generation (DKG) is a building block in developing many efficient threshold cryptosystems. This work initiates the study of communication complexity and round DKG protocols over point-to-point (bounded) synchronous network. Our result first protocol for discrete log-based cryptosystems with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>κ</mml:mi> <mml:msup> <mml:mi>n</mml:mi>...

10.62056/ayfhsgvtw article EN cc-by IACR Communications in Cryptology 2024-07-08

Repeated Modular Squaring is a versatile computational operation that has led to practical constructions of timed-cryptographic primitives like time-lock puzzles (TLP) and verifiable delay functions (VDF) have fast growing list applications. While there huge interest for in the blockchains area, we find two real-world concerns need immediate attention towards their large-scale adoption: Firstly, requirement constantly perform computations seems unrealistic most users. Secondly, choosing...

10.1145/3460120.3484809 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2021-11-12

Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solutions focus on reducing communication complexity, improving throughput, or lowering latency. This work explores the energy efficiency of BFT-SMR protocols. First, we propose a novel SMR protocol that optimizes for steady state, i.e., when leader is correct. done by number required signatures per consensus unit and complexity order nodes n compared to state-of-the-art solutions. Concretely, employ idea quorum (collection)...

10.1145/3590140.3592848 article EN 2023-11-24

Agreement protocols are crucial in various emerging applications, spanning from distributed (blockchains) oracles to fault-tolerant cyber-physical systems. In scenarios where sensor/oracle nodes measure a common source, maintaining output within the convex range of correct inputs, known as validity, is imperative. Present asynchronous agreement employ either randomization, incurring substantial computation overhead, or approximate techniques, leading high $\mathcal{\tilde{O}}(n^3)$...

10.48550/arxiv.2405.02431 preprint EN arXiv (Cornell University) 2024-05-03

10.1109/sp54263.2024.00083 article EN 2022 IEEE Symposium on Security and Privacy (SP) 2024-05-19

Regular access to unpredictable and bias-resistant randomness is important for applications such as blockchains, voting, secure distributed computing. Distributed random beacon protocols address this need by distributing trust across multiple nodes, with the majority of them assumed be honest. Numerous blockchain space have led proposal several protocols, some already implemented. However, many current systems rely on threshold cryptographic setups or exhibit high computational costs, while...

10.1145/3658644.3670326 article EN cc-by 2024-12-02

Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solutions focus on reducing communication complexity, improving throughput, or lowering latency. This work explores the energy efficiency of BFT-SMR protocols. First, we propose a novel SMR protocol that optimizes for steady state, i.e., when leader is correct. done by number required signatures per consensus unit and complexity order nodes n compared to state-of-the-art solutions. Concretely, employ idea quorum (collection)...

10.48550/arxiv.2304.04998 preprint EN other-oa arXiv (Cornell University) 2023-01-01

Solar energy has the potential to become backbone source for world. Utility scale solar power plants (more than 50 MW) could have more 100K individual modules and be spread over 200 acres of land. Traditionally methods monitoring each module too costly in utility scale. We demonstrate an alternative using recent advances deep learning automatically analyze drone footage. show that this can a quick reliable alternative. it save huge amounts impact developing world hugely.

10.48550/arxiv.1902.04132 preprint EN other-oa arXiv (Cornell University) 2019-01-01

Although blockchains aim for immutability as their core feature, several instances have exposed the harms with perfect immutability. The permanence of illicit content inserted in Bitcoin poses a challenge to law enforcement agencies like Interpol, and millions dollars are lost buggy smart contracts Ethereum. A line research then spawned on Redactable solving problem redacting contents from both permissioned permissionless blockchains. However, all existing proposals follow build-new-chain...

10.48550/arxiv.2001.00486 preprint EN other-oa arXiv (Cornell University) 2020-01-01
Coming Soon ...