Omer Horvitz

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

dblp:36/3547 · DBLP profile ↗

← Back

6ranked-venue papers

4as first author

0since 2021 · last 2010

—ORCID · none

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

Security and privacy · 4 · 2 first-authorTheory of computation · 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 5 papers		Cryptographic protocols and secure computation · 90% Cryptographic primitives and cryptanalysis · 10%
Theoretical computer science 1 paper		Algorithmic game theory and mechanism design · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic protocols and secure computation commitment schemes	0.2	3	2009	Reducing Complexity Assumptions for Statistically-Hiding Commitment · J. Cryptol. 2009 Bounds on the Efficiency of "Black-Box" Commitment Schemes · ICALP 2005 Reducing Complexity Assumptions for Statistically-Hiding Commitment · EUROCRYPT 2005
Cryptographic protocols and secure computation › commitment schemes statistically hiding commitment	0.1	2	2009	Reducing Complexity Assumptions for Statistically-Hiding Commitment · J. Cryptol. 2009 Reducing Complexity Assumptions for Statistically-Hiding Commitment · EUROCRYPT 2005
Cryptographic primitives and cryptanalysis cryptographic assumptions	0.1	2	2009	Reducing Complexity Assumptions for Statistically-Hiding Commitment · EUROCRYPT 2005 Reducing Complexity Assumptions for Statistically-Hiding Commitment · J. Cryptol. 2009
Cryptographic protocols and secure computation › secure multiparty computation round complexity	0.1	1	2007	Universally-Composable Two-Party Computation in Two Rounds · CRYPTO 2007
Cryptographic protocols and secure computation › secure multiparty computation secure two-party computation	0.1	1	2007	Universally-Composable Two-Party Computation in Two Rounds · CRYPTO 2007
Cryptographic protocols and secure computation › secure computation protocols › round complexity of secure computation two-round protocols	0.1	1	2007	Universally-Composable Two-Party Computation in Two Rounds · CRYPTO 2007
Cryptographic protocols and secure computation › composable security universally composable security	0.1	1	2007	Universally-Composable Two-Party Computation in Two Rounds · CRYPTO 2007
Algorithmic game theory and mechanism design › mechanism design black-box reduction	0.1	1	2005	Bounds on the Efficiency of "Black-Box" Commitment Schemes · ICALP 2005
Cryptographic protocols and secure computation › security protocol analysis computational soundness of formal encryption	0.0	1	2003	Weak Key Authenticity and the Computational Completeness of Formal Encryption · CRYPTO 2003
Cryptographic protocols and secure computation cryptographic key management	0.0	1	2003	Weak Key Authenticity and the Computational Completeness of Formal Encryption · CRYPTO 2003

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

reduction · 0.1black-box separation · 0.1formal methods · 0.0

Year	Publication	Venue	Position
2010	Bounds on the efficiency of black-box commitment schemes Omer Horvitz, Jonathan Katz	Theor. Comput. Sci.	1
2009	Reducing Complexity Assumptions for Statistically-Hiding Commitment Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel	J. Cryptol.	2
2007	Universally-Composable Two-Party Computation in Two Rounds Omer Horvitz, Jonathan Katz	CRYPTO	1
2005	Reducing Complexity Assumptions for Statistically-Hiding Commitment Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel	EUROCRYPT	2
2005	Bounds on the Efficiency of "Black-Box" Commitment Schemes Omer Horvitz, Jonathan Katz	ICALP	1
2003	Weak Key Authenticity and the Computational Completeness of Formal Encryption Omer Horvitz, Virgil D. Gligor	CRYPTO	1