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

Stephanie Bayer

dblp:84/11145 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Security and privacy · 2 · 2 first-author

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 · 88% Network security · 12%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs		 0.322013
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists · EUROCRYPT 2013
Efficient Zero-Knowledge Argument for Correctness of a Shuffle · EUROCRYPT 2012
Network security
blacklists		 0.012013
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists · EUROCRYPT 2013
Cryptographic protocols and secure computation
verifiable shuffle		 0.012012
Efficient Zero-Knowledge Argument for Correctness of a Shuffle · EUROCRYPT 2012

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

zero-knowledge argument · 0.3
YearPublicationVenuePosition
2013 Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
Stephanie Bayer, Jens Groth
 EUROCRYPT1
2012 Efficient Zero-Knowledge Argument for Correctness of a Shuffle
Stephanie Bayer, Jens Groth
 EUROCRYPT1