EDBT 2026 Demo / reviewers in the wild / expert
Dana Shamir
dblp:314/5132
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none
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
2 papers |
Cryptographic protocols and secure computation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
commitment schemes |
0.8 | 1 | 2024 | Reusable Online-Efficient Commitments · CRYPTO (8) 2024 |
Cryptographic protocols and secure computation
interactive proofs |
0.7 | 1 | 2023 | Non-interactive Universal Arguments · CRYPTO (2) 2023 |
Cryptographic protocols and secure computation › proof systems
universal arguments |
0.7 | 1 | 2023 | Non-interactive Universal Arguments · CRYPTO (2) 2023 |
Cryptographic protocols and secure computation › proof systems
non-interactive proofs |
0.2 | 1 | 2023 | Non-interactive Universal Arguments · CRYPTO (2) 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Reusable Online-Efficient Commitments
Nir Bitansky, Omer Paneth, Dana Shamir |
CRYPTO (8) | 3 |
| 2023 | Non-interactive Universal Arguments
Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon |
CRYPTO (2) | 3 |
| 2021 | Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators
Orr Fischer, Rotem Oshman, Dana Shamir |
OPODIS | 3 |