On the (In)Security of RSA Signatures. - Yevgeniy Dodis; Iftach Haitner; Aris Tentes (IACR Cryptol. ePrint Arch., 2011)

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise. - Abhishek Jain 002; Stephan Krenn; Krzysztof Pietrzak; Aris Tentes (ASIACRYPT, 2012)

On the Instantiability of Hash-and-Sign RSA Signatures. - Yevgeniy Dodis; Iftach Haitner; Aris Tentes (TCC, 2012)

Hardness Preserving Constructions of Pseudorandom Functions. - Abhishek Jain 002; Krzysztof Pietrzak; Aris Tentes (TCC, 2012)

Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems. - Abhishek Jain 002; Stephan Krenn; Krzysztof Pietrzak; Aris Tentes (IACR Cryptol. ePrint Arch., 2012)

Efficient Network-Based Enforcement of Data Access Rights. - Paul Giura; Vladimir Kolesnikov; Aris Tentes; Yevgeniy Vahlis (SCN, 2014)

Computational Complexity Implicationsof Secure Coin-Flipping. - Aris Tentes (2014)

Coin Flipping of Any Constant Bias Implies One-Way Functions. - Itay Berman; Iftach Haitner; Aris Tentes (Electron. Colloquium Comput. Complex., 2015)

On the connection between interval size functions and path counting. - Evangelos Bampas; Andreas-Nikolas Göbel; Aris Pagourtzis; Aris Tentes (Comput. Complex., 2017)

Coin Flipping of Any Constant Bias Implies One-Way Functions. - Itay Berman; Iftach Haitner; Aris Tentes (J. ACM, 2018)

Coin Flipping of emph{Any} Constant Bias Implies One-Way Functions. - Itay Berman; Iftach Haitner; Aris Tentes (CoRR, 2021)