Stefano Tessaro
Orcid: 0000-0002-3751-8546Affiliations:
- University of Washington, Seattle, WA, USA
According to our database1,
Stefano Tessaro
authored at least 106 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods.
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Count Corruptions, Not Users: Improved Tightness for Signatures, Encryption and Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2024
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022
VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022
2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021
2020
IACR Cryptol. ePrint Arch., 2020
Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IEEE Data Eng. Bull., 2020
CoRR, 2020
2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019
2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds.
IACR Cryptol. ePrint Arch., 2018
Privacy and Efficiency Tradeoffs for Multiword Top <i>K</i> Search with Linear Additive Rank Scoring.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018
Proceedings of the 21st International Conference on Extending Database Technology, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Understanding the Security Challenges of Oblivious Cloud Storage with Asynchronous Accesses.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
2016
J. Cryptol., 2016
IACR Cryptol. ePrint Arch., 2016
Key-alternating Ciphers and Key-length Extension: Exact Bounds and Multi-user Security.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Proceedings of the IEEE Symposium on Security and Privacy, 2016
2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the 2015 IEEE Information Theory Workshop, 2015
The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015
2014
Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014
2013
To Hash or Not to Hash Again? (In)differentiability Results for H<sup>2</sup> and HMAC.
IACR Cryptol. ePrint Arch., 2013
Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013
Proceedings of the Advances in Cryptology, 2013
Proceedings of the 51st Annual Allerton Conference on Communication, 2013
2012
Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading.
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012
2011
Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
2010
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010
2009
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition.
IACR Cryptol. ePrint Arch., 2009
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical.
Proceedings of the Advances in Cryptology, 2009
2008
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography.
Proceedings of the Advances in Cryptology, 2008
2007
IACR Cryptol. ePrint Arch., 2007
2005
Proceedings of the Distributed Computing, 19th International Conference, 2005
Proceedings of the Distributed Computing, 19th International Conference, 2005
Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), 2005