Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hrithik Nandi
dblp:384/3420
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0003-8395-4925ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 4 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
hash functions |
1.0 | 1 | 2026 | How to Build a Short-Input Random Oracle from Public Random Permutations · EUROCRYPT 2026 |
Cryptographic primitives and cryptanalysis › symmetric cryptography
permutation-based cryptography |
0.3 | 1 | 2026 | How to Build a Short-Input Random Oracle from Public Random Permutations · EUROCRYPT 2026 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Rugged Pseudorandom Permutations with Beyond-Birthday-Bound Security
Nilanjan Datta, Jean Paul Degabriele, Avijit Dutta, Vukasin Karadzic, Hrithik Nandi |
AsiaCCS | 5 |
| 2026 | Generic Committing Attacks - Zero-Padded Ascon is Less Secure than Expected
Nilanjan Datta, Hrithik Nandi, Soumit Pal, Yu Sasaki 0001, Patrick Struck, Maximiliane Weishäupl |
CRYPTO (6) | 2 |
| 2026 | How to Build a Short-Input Random Oracle from Public Random Permutations
Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Ashwin Jha 0001, Sougata Mandal, Bart Mennink, Hrithik Nandi, Yaobin Shen |
EUROCRYPT | 7 |
| 2024 | Efficient Variants of TNT with BBB Security
Ritam Bhaumik, Wonseok Choi 0002, Avijit Dutta, Cuauhtemoc Mancillas-López, Hrithik Nandi, Yaobin Shen |
ProvSec (2) | 5 |