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 VLDB 2026 / reviewers in the wild / expert

Bob Sloan

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

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

Security and privacy · 1Theory of computation · 1

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 primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › provable security
security notions		 0.021988
The Notion of Security for Probabilistic Cryptosystems · SIAM J. Comput. 1988
The Notion of Security for Probabilistic Cryptosystems · CRYPTO 1986
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption		 0.011988
The Notion of Security for Probabilistic Cryptosystems · SIAM J. Comput. 1988
Cryptographic primitives and cryptanalysis › provable security › security notions
semantic security		 0.011988
The Notion of Security for Probabilistic Cryptosystems · SIAM J. Comput. 1988
Cryptographic primitives and cryptanalysis
public-key cryptography		 0.011986
The Notion of Security for Probabilistic Cryptosystems · CRYPTO 1986
Computational complexity › reduction
polynomial-time reduction		 0.011988
The Notion of Security for Probabilistic Cryptosystems · SIAM J. Comput. 1988

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

equivalence proof · 0.0security definitions · 0.0
YearPublicationVenuePosition
1988 The Notion of Security for Probabilistic Cryptosystems
abstract
Three very different formal definitions of security for public-key cryptosystems have been proposed—two by Goldwasser and Micali and one by Yao. We prove all of them to be equivalent. This equivalence provides evidence that the right formalization of the notion of security has been reached.
Silvio Micali, Charles Rackoff, Bob Sloan
 SIAM J. Comput.3
1986 The Notion of Security for Probabilistic Cryptosystems
Silvio Micali, Charles Rackoff, Bob Sloan
 CRYPTO3