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

Scott Ames

dblp:121/5969 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none

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

Security and privacy · 3 · 3 first-author · 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
2 papers
Cryptographic protocols and secure computation · 64% Cryptographic primitives and cryptanalysis · 36%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
non-interactive zero-knowledge proofs		 0.312017
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup · CCS 2017
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs		 0.312017
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup · CCS 2017
Cryptographic primitives and cryptanalysis
hash functions		 0.112012
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis › hash functions
universal one-way hash functions		 0.112012
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis
one-way functions		 0.012012
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions · ASIACRYPT 2012

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

random oracle model · 0.3collision-resistant hash functions · 0.3
YearPublicationVenuePosition
2023 Ligero: lightweight sublinear arguments without a trusted setup
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
 Des. Codes Cryptogr.1
2017 Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
abstract
We design and implement a simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the verification circuit size. The protocol can be based on any collision-resistant hash function. Alternatively, it can be made non-interactive in the random oracle model, yielding concretely efficient zk-SNARKs that do not require a trusted setup or public-key cryptography.
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
 CCS1
2012 The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions
Scott Ames, Rosario Gennaro, Muthuramakrishnan Venkitasubramaniam
 ASIACRYPT1