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

George L. Sicherman

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

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

Databases, data management, data science and information retrieval · 1 · 1 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
1 paper
Privacy and data protection · 100%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › statistical database privacy
inference control		 0.011983
Answering Queries Without Revealing Secrets · ACM Trans. Database Syst. 1983
Privacy and data protection
information disclosure		 0.011983
Answering Queries Without Revealing Secrets · ACM Trans. Database Syst. 1983

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

secrecy analysis · 0.0formal safety criteria · 0.0
YearPublicationVenuePosition
1983 Answering Queries Without Revealing Secrets
abstract
Question-answering systems must often keep certain information secret. This can be accomplished, for example, by sometimes refusing to answer a query. Here the danger of revealing a secret by refusing to answer a query is investigated. First several criteria that can be used to decide whether or not to answer a query are developed. Then it is shown which of these criteria are safe if the questioner knows nothing at all about what is kept secret. Furthermore, it is proved that one of these criteria is safe even if the user of the system knows which information is to be kept secret.
George L. Sicherman, Wiebren de Jonge, Reind P. van de Riet
 ACM Trans. Database Syst.1