365 citations · 1k across the 45 of their papers we have counts for
56 papers
Unconditionally Safe Light Client
Niusha Moshrefi, Peiyao Sheng, Soubhik Deb +2
Blockchain applications often rely on lightweight clients to access and verify on-chain data efficiently without the need to run a resource-intensive full node. These light clients…
STAKESURE: Proof of Stake Mechanisms with Strong Cryptoeconomic Safety
Soubhik Deb, Robert Raynor, Sreeram Kannan
As of July 15, 2023, Ethererum, which is a Proof-of-Stake (PoS) blockchain [1] has around 410 Billion USD in total assets on chain (popularly referred to as total-value-locked, TVL…
Travelers: A scalable fair ordering BFT system
Bowen Xue, Sreeram Kannan
Many blockchain platform are subject to maximal value extraction (MEV), and users on the platform are losing money while sending transactions because the transaction order can be m…
SAKSHI: Decentralized AI Platforms
Suma Bhat, Canhui Chen, Zerui Cheng +8
Large AI models (e.g., Dall-E, GPT4) have electrified the scientific, technological and societal landscape through their superhuman capabilities. These services are offered largely…
BigDipper: Sharded Censorship Resistant Data Availability for Leader-Based BFT
Bowen Xue, Samuel Laferriere, Soubhik Deb +1
Leader-based Byzantine-fault-tolerant (BFT) protocols provide low latency and simple communication structure, but they give the leader short-term control over transaction inclusion…
Goldfish: Peer selection using Matrix completion in unstructured P2P network
Bowen Xue, Yifan Mao, Shaileshh Bojja Venkatakrishnan +1
Peer-to-peer (P2P) networks underlie a variety of decentralized paradigms including blockchains, distributed file storage and decentralized domain name systems. A central primitive…
HQAlign: Aligning nanopore reads for SV detection using current-level modeling
Dhaivat Joshi, Suhas Diggavi, Mark J. P. Chaisson +1
Motivation: Detection of structural variants (SV) from the alignment of sample DNA reads to the reference genome is an important problem in understanding human diseases. Long reads…
TrustBoost: Boosting Trust among Interoperable Blockchains
Peiyao Sheng, Xuechao Wang, Sreeram Kannan +2
Currently there exist many blockchains with weak trust guarantees, limiting applications and participation. Existing solutions to boost the trust using a stronger blockchain, e.g.,…
Optimal Bootstrapping of PoW Blockchains
Ranvir Rana, Dimitris Karakostas, Sreeram Kannan +2
Proof of Work (PoW) blockchains are susceptible to adversarial majority mining attacks in the early stages due to incipient participation and corresponding low net hash power. Boot…
Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities
Ertem Nusret Tas, David Tse, Fangyu Gai +3
Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners. Proof-of-Stake chains are energy-efficient, have fast finality…
Babylon: Reusing Bitcoin Mining to Enhance Proof-of-Stake Security
Ertem Nusret Tas, David Tse, Fisher Yu +1
Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners, but consumes huge amount of energy. Proof-of-Stake chains are e…
Minotaur: Multi-Resource Blockchain Consensus
Matthias Fitzi, Xuechao Wang, Sreeram Kannan +4
Resource-based consensus is the backbone of permissionless distributed ledger systems. The security of such protocols relies fundamentally on the level of resources actively engage…
Securing Parallel-chain Protocols under Variable Mining Power
Xuechao Wang, Viswa Virinchi Muppirala, Lei Yang +2
Several emerging PoW blockchain protocols rely on a "parallel-chain" architecture for scaling, where instead of a single chain, multiple chains are run in parallel and aggregated.…
ACeD: Scalable Data Availability Oracle
Peiyao Sheng, Bowen Xue, Sreeram Kannan +1
A popular method in practice offloads computation and storage in blockchains by relying on committing only hashes of off-chain data into the blockchain. This mechanism is acknowled…
Blockchain CAP Theorem Allows User-Dependent Adaptivity and Finality
Suryanarayana Sankagiri, Xuechao Wang, Sreeram Kannan +1
Longest-chain blockchain protocols, such as Bitcoin, guarantee liveness even when the number of actively participating users is variable, i.e., they are adaptive. However, they are…
PoSAT: Proof-of-Work Availability and Unpredictability, without the Work
Soubhik Deb, Sreeram Kannan, David Tse
An important feature of Proof-of-Work (PoW) blockchains is full dynamic availability, allowing miners to go online and offline while requiring only 50% of the online miners to be h…
BFT Protocol Forensics
Peiyao Sheng, Gerui Wang, Kartik Nayak +2
Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to…
Deepcode and Modulo-SK are Designed for Different Settings
Hyeji Kim, Yihan Jiang, Sreeram Kannan +2
We respond to [1] which claimed that "Modulo-SK scheme outperforms Deepcode [2]". We demonstrate that this statement is not true: the two schemes are designed and evaluated for ent…
Perigee: Efficient Peer-to-Peer Network Design for Blockchains
Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan +2
A key performance metric in blockchains is the latency between when a transaction is broadcast and when it is confirmed (the so-called, confirmation latency). While improvements in…
Free2Shard: Adaptive-adversary-resistant sharding via Dynamic Self Allocation
Ranvir Rana, Sreeram Kannan, David Tse +1
Propelled by the growth of large-scale blockchain deployments, much recent progress has been made in designing sharding protocols that achieve throughput scaling linearly in the nu…
Everything is a Race and Nakamoto Always Wins
Amir Dembo, Sreeram Kannan, Ertem Nusret Tas +4
Nakamoto invented the longest chain protocol, and claimed its security by analyzing the private double-spend attack, a race between the adversary and the honest nodes to grow a lon…
C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation
Arnab Kumar Mondal, Arnab Bhattacharya, Sudipto Mukherjee +3
Estimation of information theoretic quantities such as mutual information and its conditional variant has drawn interest in recent times owing to their multifaceted applications. N…
Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels
Yihan Jiang, Hyeji Kim, Himanshu Asnani +3
Designing codes that combat the noise in a communication medium has remained a significant area of research in information theory as well as wireless communications. Asymptotically…
Proof-of-Stake Longest Chain Protocols: Security vs Predictability
Vivek Bagaria, Amir Dembo, Sreeram Kannan +5
The Nakamoto longest chain protocol is remarkably simple and has been proven to provide security against any adversary with less than 50% of the total hashing power. Proof-of-stake…