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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Andrew Zitek

dblp:332/2989 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Security and privacy · 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
1 paper
Cryptographic protocols and secure computation · 87% Blockchain and cryptocurrency security · 13%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › authenticated data structure
authenticated dictionaries		 0.612022
VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries · CCS 2022
Cryptographic protocols and secure computation
verifiable computation		 0.612022
VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries · CCS 2022

Methods — techniques the papers use, named apart from their topics

incrementally verifiable computation · 0.6SNARKs · 0.6RSA accumulator · 0.6
YearPublicationVenuePosition
2022 VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries
abstract
Verifiable registries allow clients to securely access a key-value mapping maintained by an untrusted server. Registries must be audited to ensure global invariants are preserved, which, in turn, allows for efficient monitoring of individual registry entries by their owners. To this end, existing proposals either assume trusted third-party auditors or rely on incrementally verifiable computation (IVC) via expensive recursive SNARKs to make registries client-auditable.
Nirvan Tyagi, Ben Fisch, Andrew Zitek, Joseph Bonneau, Stefano Tessaro
 CCS3