Folgen
Rishiraj Bhattacharyya
Rishiraj Bhattacharyya
Bestätigte E-Mail-Adresse bei bham.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Security analysis of the mode of JH hash function
R Bhattacharyya, A Mandal, M Nandi
International Workshop on Fast Software Encryption, 168-191, 2010
532010
Complexity of the Unconstrained Traveling Tournament Problem
R Bhattacharyya
Operations Research Letters 44 (5), 649-654, 2016
35*2016
Secure message authentication against related-key attack
R Bhattacharyya, A Roy
International Workshop on Fast Software Encryption, 305-324, 2013
262013
Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
R Bhattacharyya, A Mandal, M Nandi
International Conference on Cryptology in India, 199-218, 2009
232009
Property Testing of Joint Distributions using Conditional Samples
R Bhattacharyya, S Chakraborty
ACM Transactions on Computation Theory (TOCT) 10 (4), 16, 2018
182018
Non-adaptive programmability of random oracle
R Bhattacharyya, P Mukherjee
Theoretical Computer Science 592, 97-114, 2015
102015
On the indifferentiability of Fugue and Luffa
R Bhattacharyya, A Mandal
International Conference on Applied Cryptography and Network Security, 479-497, 2011
62011
Compactness of hashing modes and efficiency beyond Merkle tree
E Andreeva, R Bhattacharyya, A Roy
Annual International Conference on the Theory and Applications of …, 2021
52021
Memory-tight reductions for practical key encapsulation mechanisms
R Bhattacharyya
IACR International Conference on Public-Key Cryptography, 249-278, 2020
52020
On the impossibility of instantiating PSS in the standard model
R Bhattacharyya, A Mandal
International Workshop on Public Key Cryptography, 351-368, 2011
42011
Crooked Indifferentiability of Enveloped XOR Revisited
R Bhattacharyya, M Nandi, A Raychaudhuri
International Conference on Cryptology in India, 73-92, 2021
3*2021
Constant query locally decodable codes against a computationally bounded adversary
R Bhattacharyya, S Chakraborty
12011
Bandwidth-Hard Functions from Random Permutations
R Bhattacharyya, A Mandal
arXiv preprint arXiv:2207.11519, 2022
2022
Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs
D Chatterjee, R Bhattacharyya
arXiv preprint arXiv:2203.15509, 2022
2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–14