Demo Data from SIGIR 2026 / reviewers in the wild / expert
Arasu Arun
dblp:256/9241
· DBLP profile ↗
7ranked-venue papers
3as first author
7since 2021 · last 2026
0009-0000-1009-2365ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 3 first-author · 6 since 2021Computer networks · 1 · 1 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
6 papers |
Cryptographic protocols and secure computation · 80% Network security · 8% Blockchain and cryptocurrency security · 7% | |
| Computer networks
2 papers |
Software-defined and programmable networks · 100% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
proof systems |
1.8 | 2 | 2026 | Nebula: Proving Machine Executions via Folding Schemes · SP 2026 Jolt: SNARKs for Virtual Machines via Lookups · EUROCRYPT (6) 2024 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
1.1 | 2 | 2022 | Zero-Knowledge Middleboxes · USENIX Security Symposium 2022 Short-lived Zero-Knowledge Proofs and Signatures · ASIACRYPT (3) 2022 |
Cryptographic protocols and secure computation › proof systems
folding scheme |
1.0 | 1 | 2026 | Nebula: Proving Machine Executions via Folding Schemes · SP 2026 |
Cryptographic protocols and secure computation
verifiable computation |
1.0 | 1 | 2026 | Nebula: Proving Machine Executions via Folding Schemes · SP 2026 |
Cryptographic protocols and secure computation › proof systems
lookup arguments |
0.8 | 1 | 2024 | Jolt: SNARKs for Virtual Machines via Lookups · EUROCRYPT (6) 2024 |
Cryptographic protocols and secure computation › proof systems
succinct non-interactive arguments of knowledge |
0.8 | 1 | 2024 | Jolt: SNARKs for Virtual Machines via Lookups · EUROCRYPT (6) 2024 |
Cryptographic protocols and secure computation › secure multiparty computation
sealed-bid auction |
0.7 | 1 | 2023 | Riggs: Decentralized Sealed-Bid Auctions · CCS 2023 |
Blockchain and cryptocurrency security
smart contract security |
0.7 | 1 | 2023 | Riggs: Decentralized Sealed-Bid Auctions · CCS 2023 |
Cryptographic protocols and secure computation › commitment schemes
timed commitments |
0.7 | 1 | 2023 | Riggs: Decentralized Sealed-Bid Auctions · CCS 2023 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.6 | 1 | 2022 | Short-lived Zero-Knowledge Proofs and Signatures · ASIACRYPT (3) 2022 |
Software-defined and programmable networks
network function virtualization |
0.2 | 1 | 2024 | Zombie: Middleboxes that Don't Snoop · NSDI 2024 |
Cryptographic protocols and secure computation
commitment schemes |
0.2 | 1 | 2023 | Riggs: Decentralized Sealed-Bid Auctions · CCS 2023 |
Software-defined and programmable networks › network function
in-network middlebox |
0.2 | 1 | 2022 | Zero-Knowledge Middleboxes · USENIX Security Symposium 2022 |
Methods — techniques the papers use, named apart from their topics
trusted execution · 1.5folding scheme · 1.0lookup arguments · 0.8cryptographic protocols · 0.8cryptographic protocol · 0.8SNARKs · 0.8timed commitments · 0.7range proof · 0.7non-malleable commitments · 0.7zero-knowledge proofs · 0.6zero-knowledge proof · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Nebula: Proving Machine Executions via Folding Schemes
Arasu Arun, Srinath Setty |
SP | 1 |
| 2024 | Jolt: SNARKs for Virtual Machines via Lookups
Arasu Arun, Srinath Setty, Justin Thaler |
EUROCRYPT (6) | 1 |
| 2024 | Zombie: Middleboxes that Don't Snoop
Collin Zhang, Zachary DeStefano, Arasu Arun, Joseph Bonneau, Paul Grubbs, Michael Walfish |
NSDI | 3 |
| 2023 | Riggs: Decentralized Sealed-Bid AuctionsabstractWe introduce the first practical protocols for fully decentralized sealed-bid auctions using timed commitments. Timed commitments ensure that the auction is finalized fairly even if all participants drop out after posting bids or if n bidders collude to try to learn the nth bidder's bid value. Our protocols rely on a novel non-malleable timed commitment scheme which efficiently supports range proofs to establish that bidders have sufficient funds to cover a hidden bid value. This allows us to penalize users who abandon bids for exactly the bid value, while supporting simultaneous bidding in multiple auctions with a shared collateral pool. Our protocols are concretely efficient and we have implemented them in an Ethereum-compatible smart contract which automatically enforces payment and delivery of an auctioned digital asset. Nirvan Tyagi, Arasu Arun, Cody Freitag, Riad S. Wahby, Joseph Bonneau, David Mazières |
CCS | 2 |
| 2023 | Bicorn: An Optimistically Efficient Distributed Randomness Beacon
Kevin Choi, Arasu Arun, Nirvan Tyagi, Joseph Bonneau |
FC (1) | 2 |
| 2022 | Short-lived Zero-Knowledge Proofs and Signatures
Arasu Arun, Joseph Bonneau, Jeremy Clark |
ASIACRYPT (3) | 1 |
| 2022 | Zero-Knowledge Middleboxes
Paul Grubbs, Arasu Arun, Joseph Bonneau, Michael Walfish |
USENIX Security Symposium | 2 |