Aris Tentes

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:43/3046 · DBLP profile ↗

← Back

7ranked-venue papers

0as first author

0since 2021 · last 2018

—ORCID · none

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

Theory of computation · 5Security and privacy · 3Applied, interdisciplinary, general and emerging computing · 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

3 papers

Cryptographic protocols and secure computation · 62% Cryptographic primitives and cryptanalysis · 38%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic protocols and secure computation coin flipping	0.5	2	2018	Coin Flipping of Any Constant Bias Implies One-Way Functions · J. ACM 2018 Coin flipping of any constant bias implies one-way functions · STOC 2014
Cryptographic primitives and cryptanalysis one-way functions	0.5	2	2018	Coin Flipping of Any Constant Bias Implies One-Way Functions · J. ACM 2018 Coin flipping of any constant bias implies one-way functions · STOC 2014
Cryptographic protocols and secure computation › coin flipping weak coin flipping	0.2	1	2014	Coin flipping of any constant bias implies one-way functions · STOC 2014
Cryptographic protocols and secure computation commitment schemes	0.1	1	2012	Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise · ASIACRYPT 2012
Cryptographic protocols and secure computation › proof systems zero-knowledge proofs	0.1	1	2012	Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis cryptographic hardness	0.1	1	2014	Coin flipping of any constant bias implies one-way functions · STOC 2014
Cryptographic primitives and cryptanalysis › cryptographic assumptions learning parity with noise	0.0	1	2012	Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise · ASIACRYPT 2012

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

reduction · 0.5cryptographic implication · 0.3protocol analysis · 0.2

Year	Publication	Venue	Position
2018	Coin Flipping of Any Constant Bias Implies One-Way Functions abstract We show that the existence of a coin-flipping protocol safe against any nontrivial constant bias (e.g., .499) implies the existence of one-way functions. This improves upon a result of Haitner and Omri (FOCS’11), who proved this implication for protocols with bias √ 2−1/2 − o (1) ≈ .207. Unlike the result of Haitner and Omri, our result also holds for weak coin-flipping protocols. Itay Berman, Iftach Haitner, Aris Tentes	J. ACM	3
2017	On the connection between interval size functions and path counting Evangelos Bampas, Andreas Göbel 0001, Aris Pagourtzis, Aris Tentes	Comput. Complex.	4
2014	Coin flipping of any constant bias implies one-way functions abstract We show that the existence of a coin-flipping protocol safe against any non-trivial constant bias (e.g., .499) implies the existence of one-way functions. This improves upon a recent result of Haitner and Omri [FOCS '11], who proved this implication for protocols with bias [EQUATION] -- o(1) ≈ .207. Unlike the result of Haitner and Omri, our result also holds for weak coin-flipping protocols. Itay Berman, Iftach Haitner, Aris Tentes	STOC	3
2012	Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise Abhishek Jain 0002, Stephan Krenn, Krzysztof Pietrzak, Aris Tentes	ASIACRYPT	4
2012	On the Instantiability of Hash-and-Sign RSA Signatures Yevgeniy Dodis, Iftach Haitner, Aris Tentes	TCC	3
2012	Hardness Preserving Constructions of Pseudorandom Functions Abhishek Jain 0002, Krzysztof Pietrzak, Aris Tentes	TCC	3
2009	On the Connection between Interval Size Functions and Path Counting Evangelos Bampas, Andreas Göbel 0001, Aris Pagourtzis, Aris Tentes	TAMC	4