Kartik Nayak

TL;DR: In this paper, the authors proposed protocols that solve Byzantine broadcast and Byzantine agreement with long inputs of l bits using lower costs than l single-bit instances, and they achieved the best possible communication complexity of Θ(nl) for wider ranges of input sizes compared to prior results.

TL;DR: Solida as mentioned in this paper is a decentralized blockchain protocol based on reconfigurable Byzantine consensus augmented by proof-of-work, which improves on Bitcoin in confirmation time, and provides safety and liveness assuming the adversary control less than (roughly) one-third of the total mining power.

TL;DR: Oblivious RAMs, introduced by Goldreich and Ostrovsky [JACM’96], compile any RAM program into one that is “memory oblivious”, i.e., the access pattern to the memory is independent of the input.

TL;DR: This work initiates the study of locality-friendly oblivious RAMs—Oblivious RAM compilers that preserve the locality of the accessed memory regions, while leaking only the lengths of contiguous memory regions accessed; it develops a novel sorting algorithm which is also asymptotically optimal and enjoys good locality.