activity
20152025
most citedTight List-Sizes for Oblivious AVCs under Constraints

5 citations · 6 across the 4 of their papers we have counts for

collaborators

10 papers

cs.IT2025

Efficient and rate-optimal list-decoding in the presence of minimal feedback

Pranav Joshi, Daniel McMorrow, Yihan Zhang +2

Given a channel with length- inputs and outputs over the alphabet , and of which a fraction of symbols can be arbitrarily corrupted b…

cs.IT2024

Wiretapped Commitment over Binary Channels

Anuj Kumar Yadav, Manideep Mamindlapally, Amitalok J. Budkuley

We propose the problem of wiretapped commitment, where two parties, say committer Alice and receiver Bob, engage in a commitment protocol using a noisy channel as a resource, in th…

cs.IT2023★ 1 cited

Commitment over Gaussian Unfair Noisy Channels

Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally +1

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes, ho…

cs.IT2021

On Reverse Elastic Channels and the Asymmetry of Commitment Capacity under Channel Elasticity

Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally +1

Commitment is an important cryptographic primitive. It is well known that noisy channels are a promising resource to realize commitment in an information-theoretically secure manne…

cs.IT2020★ 5 cited

Tight List-Sizes for Oblivious AVCs under Constraints

Yihan Zhang, Sidharth Jaggi, Amitalok J. Budkuley

We study list-decoding over adversarial channels governed by oblivious adversaries (a.k.a. oblivious Arbitrarily Varying Channels (AVCs)). This type of adversaries aims to maliciou…

cs.IT2019

Generalized List Decoding

Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi

This paper concerns itself with the question of list decoding for general adversarial channels, e.g., bit-flip () channels, erasure channels, (-) ch…