
Securing Parallelchain Protocols under Variable Mining Power
Several emerging PoW blockchain protocols rely on a "parallelchain" arc...
read it

ACeD: Scalable Data Availability Oracle
A popular method in practice offloads computation and storage in blockch...
read it

The Checkpointed Longest Chain: Userdependent Adaptivity and Finality
Longestchain protocols such as the one invented by Nakamoto for Bitcoin...
read it

PoSAT: ProofofWork Availability andUnpredictability, without the Work
An important feature of ProofofWork (PoW) blockchains is full dynamic ...
read it

BFT Protocol Forensics
Byzantine faulttolerant (BFT) protocols allow a group of replicas to co...
read it

Deepcode and ModuloSK are Designed for Different Settings
We respond to [1] which claimed that "ModuloSK scheme outperforms Deepc...
read it

Perigee: Efficient PeertoPeer Network Design for Blockchains
A key performance metric in blockchains is the latency between when a tr...
read it

Everything is a Race and Nakamoto Always Wins
Nakamoto invented the longest chain protocol, and claimed its security b...
read it

Free2Shard: Adaptiveadversaryresistant sharding via Dynamic Self Allocation
Propelled by the growth of largescale blockchain deployments, much rece...
read it

CMIGAN : Estimation of Conditional Mutual Information using MinMax formulation
Estimation of information theoretic quantities such as mutual informatio...
read it

Turbo Autoencoder: Deep learning based channel codes for pointtopoint communication channels
Designing codes that combat the noise in a communication medium has rema...
read it

ProofofStake Longest Chain Protocols Revisited
The Nakamoto longest chain protocol has served Bitcoin well in its decad...
read it

Coded Merkle Tree: Solving Data Availability Attacks in Blockchains
In this paper, we propose coded Merkle tree (CMT), a novel hash accumula...
read it

Improving Federated Learning Personalization via Model Agnostic Meta Learning
Federated Learning (FL) refers to learning a high quality global model b...
read it

Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples
Deep learning classifiers are known to be vulnerable to adversarial exam...
read it

Coded State Machine  Scaling State Machine Execution under Byzantine Faults
We introduce an informationtheoretic framework, named Coded State Machi...
read it

Learning in Gated Neural Networks
Gating is a key feature in modern neural networks including LSTMs, GRUs ...
read it

CCMI : Classifier based Conditional Mutual Information Estimation
Conditional Mutual Information (CMI) is a measure of conditional depende...
read it

Dropping Pixels for Adversarial Robustness
Deep neural networks are vulnerable against adversarial examples. In thi...
read it

DeepTurbo: Deep Turbo Decoder
Presentday communication systems routinely use codes that approach the ...
read it

LEARN Codes: Inventing Lowlatency Codes via Recurrent Neural Networks
Designing channel codes under low latency constraints is one of the most...
read it

Estimators for Multivariate Information Measures in General Probability Spaces
Information theoretic quantities play an important role in various setti...
read it

Deconstructing the Blockchain to Approach Physical Limits
Transaction throughput, confirmation latency and confirmation reliabilit...
read it

PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously
Today's blockchains do not scale in a meaningful sense. As more nodes jo...
read it

ClusterGAN : Latent Space Clustering in Generative Adversarial Networks
Generative Adversarial networks (GANs) have obtained remarkable success ...
read it

Deepcode: Feedback Codes via Deep Learning
The design of codes for communicating reliably over a statistically well...
read it

Mimic and Classify : A metaalgorithm for Conditional Independence Testing
Given independent samples generated from the joint distribution p(x,y,z)...
read it

Communication Algorithms via Deep Learning
Coding theory is a central discipline underpinning wireline and wireless...
read it

Globally Consistent Algorithms for Mixture of Experts
MixtureofExperts (MoE) is a widely popular neural network architecture...
read it

Potential Conditional Mutual Information: Estimators, Properties and Applications
The conditional mutual information I(X;YZ) measures the average informa...
read it

Discovering Potential Correlations via Hypercontractivity
Discovering a correlation from one variable to another variable is of fu...
read it

Learning Temporal Dependence from TimeSeries Data with Latent Variables
We consider the setting where a collection of time series, modeled as ra...
read it

Conditional Dependence via Shannon Capacity: Axioms, Estimators and Applications
We conduct an axiomatic study of the problem of estimating the strength ...
read it
Sreeram Kannan
is this you? claim profile