Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anandarup Roy 0002

dblp:230/9668 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0001-7674-241XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
block cipher
0.912025
Post-quantum Security of Key-Alternating Feistel Ciphers · ASIACRYPT (1) 2025
Cryptographic primitives and cryptanalysis › block cipher
feistel network
0.912025
Post-quantum Security of Key-Alternating Feistel Ciphers · ASIACRYPT (1) 2025
Cryptographic primitives and cryptanalysis › block cipher › feistel network
key-alternating feistel
0.912025
Post-quantum Security of Key-Alternating Feistel Ciphers · ASIACRYPT (1) 2025
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.912025
Post-quantum Security of Key-Alternating Feistel Ciphers · ASIACRYPT (1) 2025
YearPublicationVenuePosition
2025 Post-quantum Security of Key-Alternating Feistel Ciphers
Jyotirmoy Basak, Ritam Bhaumik, Amit Kumar Chauhan, Ravindra Jejurikar, Ashwin Jha 0001, Anandarup Roy 0002, André Schrottenloher, Suprita Talnikar
ASIACRYPT (1)6
2025 A Trustworthy and Efficient Inference Scheduling Scheme for Edge MoEs Using DRL
abstract
With the widespread popularity of Large Language Models (LLMs), the mixture of experts (MoE) has not only emerged as a key enabler for scaling up model capacity by significantly reducing computational demands, but also for giving rise to edge-computing empowered distributed LLMs with better prices, low latency, and regional privacy. Nonetheless, besides constraints in computational capability, edge-based LLM deployments also face challenges such as unreliable environments due to the limited security of edge devices. In this paper, we propose REMIS, an inference task scheduling scheme designed to enable MoE-based LLM services under untrustworthy computation conditions. Specifically, after an LLM is properly partitioned into shards and deployed across edge devices, REMIS dynamically schedules and activates experts on devices with lower loads and higher reliability. This strategy is effectively achieved through a deep reinforcement learning procedure that optimizes both servicing latency and inference credibility. Unlike most existing MoE-based schemes with fixed Top-K routing, REMIS operates in a novel plug-in manner, intelligently selecting experts to improve task adaptability. Numerical evaluations under various untrustworthy setups validate the superiority of our proposed scheme in both servicing latency and inference credibility.
Shengli Pan 0001, Shanwu Chen, Anandarup Roy 0002, Peng Li 0017
TrustCom4