(Note: Some links may not be working - generally this means that the full version is in the process of being completed.)

Preprints

• Straight-Line Knowledge Extraction for Multi-Round Protocols
  Lior Rotem, Stefano Tessaro
  preprint
  
• How Fast Does the Inverse Walk Approximate a Random Permutation?
  Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan
  preprint
  

2024

• Partially Non-Interactive Two-Round Lattice-Based Threshold Signatures
  Rutchathon Chairattana-Apirom, Stefano Tessaro, and Chenzhi Zhu
  ASIACRYPT 2024
• One-More Unforgeability for Multi- and Threshold Signatures
  Sela Navot, Stefano Tessaro
  ASIACRYPT 2024
• Count Corruptions, Not Users: Improved Tightness for Signatures, Encryption and Authenticated Key Exchange
  Mihir Bellare, Doreen Riepel, Stefano Tessaro, Yizhao Zhang
  ASIACRYPT 2024
• POPSTAR: Lightweight Threshold Reporting with Reduced Leakage
  Hanjun Li, Sela Navot, and Stefano Tessaro
  USENIX Security 2024
• Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods
  Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, and Stefano Tessaro
  CRYPTO 2024
• Collision Resistance from Multi-Collision Resistance for all Constant Parameters
  Jan Buzek and Stefano Tessaro
  CRYPTO 2024
• Fully Malicious Authenticated PIR
  Marian Dietz and Stefano Tessaro
  CRYPTO 2024
• Pairing-Free Blind Signatures from CDH Assumptions
  Rutchathon Chairattana-Apirom, Stefano Tessaro, and Chenzhi Zhu
  CRYPTO 2024
• Oblivious issuance of proofs
  Michele Orrù, Stefano Tessaro, Greg Zaverucha, Chenzhi Zhu
  CRYPTO 2024
• Twinkle: Threshold Signatures from DDH with Full Adaptive Security
  Renas Bacho, Julian Loss, Stefano Tessaro, Benedikt Wagner, and Chenzhi Zhu
  EUROCRYPT 2024

2023

• LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking
  Hanjun Li, Huijia Lin, Antigoni Polychroniadou, and Stefano Tessaro
  ASIACRYPT 2023
• The Query-Complexity of Preprocessing Attacks
  Asrhujit Ghoshal and Stefano Tessaro
  CRYPTO 2023
• Snowblind: A Threshold Blind Signature in Pairing-Free Groups
  Elizabeth Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, and Chenzhi Zhu
  CRYPTO 2023
• Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers
  Tianren Liu, Angelos Pelecanos, Stefano Tessaro, and Vinod Vaikuntanathan
  CRYPTO 2023
• Threshold and Multi-Signature Schemes from Linear Hash Functions
  Stefano Tessaro and Chenzhi Zhu
  EUROCRYPT 2023
• Revisiting BBS Signatures
  Stefano Tessaro and Chenzhi Zhu
  EUROCRYPT 2023

2022

• VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries
  Nirvan Tyagi, Ben Fisch, Andrew Zitek, Joseph Bonneau, and Stefano Tessaro
  ACM CCS 2022
• Better than Advertised Security for Non-Interactive Threshold Signatures
  Mihir Bellare, Elizabeth Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, and Chenzhi Zhu
  CRYPTO 2022
  Note: This is a merge of https://eprint.iacr.org/2022/833.pdf and https://eprint.iacr.org/2021/1375.pdf. Please refer to the individual papers for a full version.
• QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore
  Sujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal, Amr El Abbadi, Huijia Lin, Stefano Tessaro, Victor Zakhary
  USENIX Security 2022
• On Seedless PRNGs and Premature Next
  Sandro Coretti, Yevgeniy Dodis, Harish Karthikeyan, Noah Stephens-Davidowitz, and Stefano Tessaro
  ITC 2022
• Short Pairing-Free Blind Signatures with Exponential Security
  Stefano Tessaro and Chenzhi Zhu
  EUROCRYPT 2022
• A Fast and Simple Partially Oblivious PRF, with Applications
  Nirvan Tyagi, Sofı́a Celi, Thomas Ristenpart, Nick Sullivan, Stefano Tessaro, and Christopher A. Wood
  EUROCRYPT 2022
• Hiding in Plain Sight: Memory-tight Proofs via Randomness Programming
  Ashrujit Ghoshal, Riddhi Ghosal, Joseph Jaeger, and Stefano Tessaro
  EUROCRYPT 2022

2021

• Better Security-Efficiency Trade-Offs in Permutation-Based Two-Party Computation
  Yu Long Chen and Stefano Tessaro
  ASIACRYPT 2021
• Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys
  Stefano Tessaro and Xihu Zhang
  ASIACRYPT 2021
• Quantum Key-length Extension
  Joseph Jaeger, Fang Song, and Stefano Tessaro
  TCC 2021
• The t-wise Independence of Substitution-Permutation Networks
  Tianren Liu, Stefano Tessaro, and Vinod Vaikuntanathan
  CRYPTO 2021
• Tight State-Restoration Soundness in the Algebraic Group Model
  Ashrujit Ghoshal and Stefano Tessaro
  CRYPTO 2021
• Password Hashing and Preprocessing
  Pooya Farshim and Stefano Tessaro
  EUROCRYPT 2021

2020

• Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity
  Yevgeniy Dodis, Pooya Farshim, Sogol Mazaheri, and Stefano Tessaro
  TCC 2020
• Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness
  Joseph Jaeger and Stefano Tessaro
  TCC 2020
• Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
  Wei Dai, Stefano Tessaro, and Xihu Zhang
  TCC 2020
• On the Query Complexity of Constructing PRFs from Non-adaptive PRFs
  Pratik Soni and Stefano Tessaro
  SCN 2020
• The Memory-Tightness of Authenticated Encryption
  Ashrujit Ghoshal, Joseph Jaeger, and Stefano Tessaro
  CRYPTO 2020
• PACT: Privacy-Sensitive Protocols and Mechanisms for Mobile Contact Tracing
  Justin Chan, Landon Cox, Dean Foster, Shyam Gollakota, Eric Horvitz, Joseph Jaeger, Sham Kakade, Tadayoshi Kohno, John Langford, Jonathan Larson, Puneet Sharma, Sudheesh Singanamalla, Jacob Sunshine, and Stefano Tessaro
  IEEE Data Engineering Bulletin June 2020
• On the Memory-Tightness of Hashed ElGamal
  Ashrujit Ghoshal and Stefano Tessaro
  EUROCRYPT 2020

2019

• Seedless Fruit Is the Sweetest: Random Number Generation, Revisited
  Sandro Coretti, Yevgeniy Dodis, Harish Karthikeyan, and Stefano Tessaro
  CRYPTO 2019
• Memory-Hard Functions from Cryptographic Primitives
  Binyi Chen and Stefano Tessaro
  CRYPTO 2019
• Tight Time-Memory Trade-offs for Symmetric Encryption
  Joseph Jaeger and Stefano Tessaro
  EUROCRYPT 2019

2018

• Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
  Stefano Tessaro and Aishwarya Thiruvengadam
  TCC 2018 (Full version coming soon!) Invited to Journal of Cryptology
• The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization
  Viet Tung Hoang, Stefano Tessaro, and Aishwarya Thiruvengadam
  CCS 2018
• The Curse of Small Domains: New Attacks on Format-Preserving Encryption
  Viet Tung Hoang, Stefano Tessaro, and Ni Trieu
  CRYPTO 2018
• Privacy and Efficiency Tradeoffs for Multiword Top K Search with Linear Additive Rank Scoring
  Daniel Agun, Jinjin Shao, Shiyu Ji, Stefano Tessaro, and Tao Yang
  WWW 2018
• Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds
  Priyanka Bose, Viet Tung Hoang, and Stefano Tessaro
  EUROCRYPT 2018
• Naor-Reingold Goes Public: The Complexity of Known-key Security
  Pratik Soni and Stefano Tessaro
  EUROCRYPT 2018
• Foundations of Homomorphic Secret Sharing
  Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, and Stefano Tessaro
  ITCS 2018

2017

• Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs
  Huijia Lin and Stefano Tessaro
  CRYPTO 2017
• Information-theoretic Indistinguishability via the Chi-squared Method
  Wei Dai, Viet Tung Hoang, and Stefano Tessaro
  CRYPTO 2017
• Scrypt is Maximally Memory-Hard
  Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, and Stefano Tessaro
  EUROCRYPT 2017 Best Paper Award Invited to Journal of Cryptology
• Public-seed Pseudorandom Permutations
  Pratik Soni and Stefano Tessaro
  EUROCRYPT 2017
• The Multi-User Security of Double Encryption
  Viet Tung Hoang and Stefano Tessaro
  EUROCRYPT 2017

2016

• Message-recovery attacks on Feistel-based Format Preserving Encryption
  Mihir Bellare, Viet Tung Hoang and Stefano Tessaro
  CCS 2016
• Simultaneous Secrecy and Reliability Amplification for a General Channel Model
  Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, and Stefano Tessaro
  TCC 2016-B
• Key-alternating ciphers and key-length extension: Exact bounds and multi-user security
  Viet Tung Hoang and Stefano Tessaro
  CRYPTO 2016 Invited to Journal of Cryptology
• TaoStore: Overcoming Asynchronicity in Oblivious Data Storage
  Cetin Sahin, Victor Zakhary, Amr El Abbadi, Huijia Lin, and Stefano Tessaro
  S&P 2016
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
  Joel Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, and Stefano Tessaro
  EUROCRYPT 2016
• Hash-Function based PRFs: AMAC and its Multi-User Security
  Mihir Bellare, Daniel J. Bernstein, and Stefano Tessaro
  EUROCRYPT 2016
• Provably Robust Sponge-Based PRNGs and KDFs
  Peter Gazi and Stefano Tessaro
  EUROCRYPT 2016
• Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
  Binyi Chen, Huijia Lin, and Stefano Tessaro
  TCC 2016-A
• Contention in Cryptoland: Obfuscation, Leakage and UCE
  Mihir Bellare, Igors Stepanovs, and Stefano Tessaro
  TCC 2016-A
• Two-Round Man-in-the-Middle Security from LPN
  David Cash, Eike Kiltz, and Stefano Tessaro
  TCC 2016-A

2015

• Optimally Secure Block Ciphers from Ideal Primitives
  Stefano Tessaro
  ASIACRYPT 2015
• Generic Security of NMAC and HMAC with Input Whitening
  Peter Gazi, Krzysztof Pietrzak, and Stefano Tessaro
  ASIACRYPT 2015
• The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
  Peter Gazi, Krzysztof Pietrzak, and Stefano Tessaro
  CRYPTO 2015
• Secret-key Cryptography from Ideal Primitives: A Systematic Overview
  Peter Gaži and Stefano Tessaro
  ITW 2015 - Invited paper
• Obfuscation of Probabilistic Circuits and Applications
  Ran Canetti, Huijia Lin, Stefano Tessaro, and Vinod Vaikuntanathan
  TCC 2015
• Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
  Peter Gazi, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano Tessaro
  FSE 2015

2014

• Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
  Mihir Bellare, Igors Stepanovs, and Stefano Tessaro
  ASIACRYPT 2014
• The Locality of Searchable Symmetric Encryption
  David Cash and Stefano Tessaro
  EUROCRYPT 2014
• Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts
  Stefano Tessaro and David A. Wilson
  PKC 2014

2013

• On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption
  Joel Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, and David A. Wilson
  Cryptography and Coding 2013
• Bounds on Inference
  Flavio Calmon, Mayank Varia, Muriel Medard, Mark Christiansen, Ken Duffy, and Stefano Tessaro
  Allerton 2013
• Amplification of Chosen-Ciphertext Security [MIT News]
  Huijia Lin and Stefano Tessaro
  EUROCRYPT 2013
• Communication Locality in Secure Multi-Party Computation: How to Run Sublinear Algorithms in a Distributed Setting
  Elette Boyle, Shafi Goldwasser, and Stefano Tessaro.
  TCC 2013
• An Equational Approach to Secure Multi-Party Computation
  Daniele Micciancio and Stefano Tessaro.
  ITCS 2013

2012

• Multi-Instance Security and its Application to Password-Based Cryptography
  Mihir Bellare, Thomas Ristenpart, and Stefano Tessaro
  CRYPTO 2012
• Semantic Security for the Wiretap Channel [Video]
  Mihir Bellare, Stefano Tessaro, and Alexander Vardy
  CRYPTO 2012
  This paper combines the following two works: A Cryptographic Treatment of the Wiretap Channel (with M. Bellare and A. Vardy) and Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity (with M. Bellare).
• To Hash or Not to Hash Again? (In)differentiability Results for H² and HMAC
  Yevgeniy Dodis, Thomas Ristenpart, John Steinberger, and Stefano Tessaro
  CRYPTO 2012
• Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
  Peter Gazi and Stefano Tessaro
  EUROCRYPT 2012

2011

• The Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited
  Thomas Holenstein, Robin Künzler, and Stefano Tessaro
  STOC 2011
• Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
  Stefano Tessaro
  TCC 2011 - Best Student Paper Award Invited to Journal of Cryptology

2010 and earlier

• Random Oracles With(out) Programmability
  Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, and Stefano Tessaro
  ASIACRYPT 2010
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
  Ueli Maurer and Stefano Tessaro
  TCC 2010
• Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
  Ueli Maurer and Stefano Tessaro
  CRYPTO 2009
• Abstract Storage Devices
  Robert Koenig, Ueli Maurer, and Stefano Tessaro
  SOFSEM 2009
  Full version available at http://www.arxiv.org/abs/0706.2746.
• Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
  Ueli Maurer and Stefano Tessaro
  ASIACRYPT 2008
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
  Ueli Maurer and Stefano Tessaro
  CRYPTO 2007
  Full version available from http://eprint.iacr.org/2007/229.
• Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
  Christian Cachin and Stefano Tessaro
  DSN 2006
• Asynchronous Verifiable Information Dispersal
  Christian Cachin and Stefano Tessaro
  SRDS 2005

Manuscripts

• Petros Mol and Stefano Tessaro
  Secret-Key Authentication Beyond the Challenge-Response Paradigm: Definitional Issues and New Protocols
  Manuscript. Dec 2012.
• Stefano Tessaro
  Computational Indistinguishability Amplification
  PhD Dissertation. ETH Zurich. Oct 2010.