Stefano Tessaro

Orcid: 0000-0002-3751-8546

Affiliations:
  • University of Washington, Seattle, WA, USA


According to our database1, Stefano Tessaro authored at least 102 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers.
IACR Cryptol. ePrint Arch., 2024

POPSTAR: Lightweight Threshold Reporting with Reduced Leakage.
IACR Cryptol. ePrint Arch., 2024

Partially Non-Interactive Two-Round Lattice-Based Threshold Signatures.
IACR Cryptol. ePrint Arch., 2024

Collision Resistance from Multi-Collision Resistance for all Constant Parameters.
IACR Cryptol. ePrint Arch., 2024

2023
Threshold and Multi-Signature Schemes from Linear Hash Functions.
IACR Cryptol. ePrint Arch., 2023

Revisiting BBS Signatures.
IACR Cryptol. ePrint Arch., 2023

Oblivious issuance of proofs.
IACR Cryptol. ePrint Arch., 2023

LERNA: Secure Single-Server Aggregation via Key-Homomorphic Masking.
IACR Cryptol. ePrint Arch., 2023

The Query-Complexity of Preprocessing Attacks.
IACR Cryptol. ePrint Arch., 2023

Fully Malicious Authenticated PIR.
IACR Cryptol. ePrint Arch., 2023

Snowblind: A Threshold Blind Signature in Pairing-Free Groups.
IACR Cryptol. ePrint Arch., 2023

Pairing-Free Blind Signatures from CDH Assumptions.
IACR Cryptol. ePrint Arch., 2023

Twinkle: Threshold Signatures from DDH with Full Adaptive Security.
IACR Cryptol. ePrint Arch., 2023

2022
Short Pairing-Free Blind Signatures with Exponential Security.
IACR Cryptol. ePrint Arch., 2022

QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore.
IACR Cryptol. ePrint Arch., 2022

On Seedless PRNGs and Premature Next.
IACR Cryptol. ePrint Arch., 2022

Better Security-Efficiency Trade-Offs in Permutation-Based Two-Party Computation.
IACR Cryptol. ePrint Arch., 2022

Stronger Security for Non-Interactive Threshold Signatures: BLS and FROST.
IACR Cryptol. ePrint Arch., 2022

Better than Advertised Security for Non-interactive Threshold Signatures.
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
Client-Auditable Verifiable Registries.
IACR Cryptol. ePrint Arch., 2021

A Fast and Simple Partially Oblivious PRF, with Applications.
IACR Cryptol. ePrint Arch., 2021

Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys.
IACR Cryptol. ePrint Arch., 2021

The t-wise Independence of Substitution-Permutation Networks.
IACR Cryptol. ePrint Arch., 2021

Quantum Key-length Extension.
IACR Cryptol. ePrint Arch., 2021

On the Memory-Tightness of Hashed ElGamal.
IACR Cryptol. ePrint Arch., 2021

Hiding in Plain Sight: Memory-tight Proofs via Randomness Programming.
IACR Cryptol. ePrint Arch., 2021

Quantum Key-Length Extension.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Password Hashing and Preprocessing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
On the Query Complexity of Constructing PRFs from Non-adaptive PRFs.
IACR Cryptol. ePrint Arch., 2020

Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness.
IACR Cryptol. ePrint Arch., 2020

Tight State-Restoration Soundness in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2020

The Memory-Tightness of Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2020

Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity.
IACR Cryptol. ePrint Arch., 2020

Super-Linear Time-Memory Trade-Offs for Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2020

PACT: Privacy-Sensitive Protocols And Mechanisms for Mobile Contact Tracing.
IEEE Data Eng. Bull., 2020

PACT: Privacy Sensitive Protocols and Mechanisms for Mobile Contact Tracing.
CoRR, 2020

2019
Tight Time-Memory Trade-offs for Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2019

Seedless Fruit is the Sweetest: Random Number Generation, Revisited.
IACR Cryptol. ePrint Arch., 2019

Memory-Hard Functions from Cryptographic Primitives.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Naor-Reingold Goes Public: The Complexity of Known-key Security.
IACR Cryptol. ePrint Arch., 2018

The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization.
IACR Cryptol. ePrint Arch., 2018

The Curse of Small Domains: New Attacks on Format-Preserving Encryption.
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

Pharos: Privacy Hazards of Replicating ORAM Stores.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

2017
Public-Seed Pseudorandom Permutations.
IACR Cryptol. ePrint Arch., 2017

Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs.
IACR Cryptol. ePrint Arch., 2017

The Multi-User Security of Double Encryption.
IACR Cryptol. ePrint Arch., 2017

Information-theoretic Indistinguishability via the Chi-squared Method.
IACR Cryptol. ePrint Arch., 2017

Foundations of Homomorphic Secret Sharing.
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

Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction.
J. Cryptol., 2016

Simultaneous Secrecy and Reliability Amplification for a General Channel Model.
IACR Cryptol. ePrint Arch., 2016

Key-alternating Ciphers and Key-length Extension: Exact Bounds and Multi-user Security.
IACR Cryptol. ePrint Arch., 2016

Provably Robust Sponge-Based PRNGs and KDFs.
IACR Cryptol. ePrint Arch., 2016

Message-recovery attacks on Feistel-based Format Preserving Encryption.
IACR Cryptol. ePrint Arch., 2016

Hash-Function based PRFs: AMAC and its Multi-User Security.
IACR Cryptol. ePrint Arch., 2016

Scrypt is Maximally Memory-Hard.
IACR Cryptol. ePrint Arch., 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptol. ePrint Arch., 2016

TaoStore: Overcoming Asynchronicity in Oblivious Data Storage.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015
Optimally Secure Block Ciphers from Ideal Primitives.
IACR Cryptol. ePrint Arch., 2015

Generic Security of NMAC and HMAC with Input Whitening.
IACR Cryptol. ePrint Arch., 2015

Tight Bounds for Keyed Sponges and Truncated CBC.
IACR Cryptol. ePrint Arch., 2015

Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.
IACR Cryptol. ePrint Arch., 2015

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions.
IACR Cryptol. ePrint Arch., 2015

Two-Round Man-in-the-Middle Security from LPN.
IACR Cryptol. ePrint Arch., 2015

Contention in Cryptoland: Obfuscation, Leakage and UCE.
IACR Cryptol. ePrint Arch., 2015

Secret-key cryptography from ideal primitives: A systematic overview.
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

The Locality of Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2014

Obfuscation of Probabilistic Circuits and Applications.
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

Poly-Many Hardcore Bits for Any One-Way Function.
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

An equational approach to secure multi-party computation.
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

Amplification of Chosen-Ciphertext Security.
Proceedings of the Advances in Cryptology, 2013

Bounds on inference.
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

A Cryptographic Treatment of the Wiretap Channel.
IACR Cryptol. ePrint Arch., 2012

Multi-Instance Security and its Application to Password-Based Cryptography.
IACR Cryptol. ePrint Arch., 2012

Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity.
IACR Cryptol. ePrint Arch., 2012

To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Semantic Security for the Wiretap Channel.
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

The equivalence of the random oracle model and the ideal cipher model, revisited.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Computational Indistinguishability Amplification.
PhD thesis, 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

Random Oracles with(out) Programmability.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition.
IACR Cryptol. ePrint Arch., 2009

Abstract Storage Devices.
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
Domain Extension of Public Random Functions: Beyond the Birthday Barrier.
IACR Cryptol. ePrint Arch., 2007

2006
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

2005
Asynchronous Verifiable Information Dispersal.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Asynchronous Veri.able Information Dispersal.
Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), 2005


  Loading...