17 citations · 17 across the 5 of their papers we have counts for
6 papers
Testing Self-Reducible Samplers
Rishiraj Bhattacharyya, Sourav Chakraborty, Yash Pote +2
Samplers are the backbone of the implementations of any randomised algorithm. Unfortunately, obtaining an efficient algorithm to test the correctness of samplers is very hard to fi…
Bandwidth-Hard Functions from Random Permutations
Rishiraj Bhattacharyya, Avradip Mandal
ASIC hash engines are specifically optimized for parallel computations of cryptographic hashes and thus a natural environment for mounting brute-force attacks on hash functions. Tw…
Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs
Diptendu Chatterjee, Rishiraj Bhattacharyya
Unit disk graphs are the set of graphs which represent the intersection of disk graphs and interval graphs. These graphs are of great importance due to their structural similarity…
Compactness of Hashing Modes and Efficiency beyond Merkle Tree
Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy
We revisit the classical problem of designing optimally efficient cryptographically secure hash functions. Hash functions are traditionally designed via applying modes of operation…
Crooked Indifferentiability Revisited
Rishiraj Bhattacharyya, Mridul Nandi, Anik Raychaudhuri
In CRYPTO 2018, Russell et al introduced the notion of crooked indifferentiability to analyze the security of a hash function when the underlying primitive is subverted. They showe…
Property Testing of Joint Distributions using Conditional Samples
Rishiraj Bhattacharyya, Sourav Chakraborty
In this paper, we consider the problem of testing properties of joint distributions under the Conditional Sampling framework. In the standard sampling model, the sample complexity…