40 citations · 63 across the 3 of their papers we have counts for
4 papers
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model
Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
The focus of this paper is on the public communication required for generating a maximal-rate secret key (SK) within the multiterminal source model of Csisz{á}r and Narayan. Buildi…
Achieving SK Capacity in the Source Model: When Must All Terminals Talk?
Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
In this paper, we address the problem of characterizing the instances of the multiterminal source model of Csiszár and Narayan in which communication from all terminals is needed f…
NLHB : A Non-Linear Hopper Blum Protocol
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankarasubramaniam +1
In this paper, we propose a light-weight provably-secure authentication protocol called the NLHB protocol, which is a variant of the HB protocol. The HB protocol uses the complexit…
Capacity Achieving Code Constructions for Two Classes of (d,k) Constraints
Yogesh Sankarasubramaniam, Steven W. McLaughlin
In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorit…