Seunghoon Lee

Orcid: 0000-0003-4475-5686

Affiliations:
  • Purdue University, Department of Computer Science, West Lafayette, IN, USA


According to our database1, Seunghoon Lee authored at least 14 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Differentially Private Compression and the Sensitivity of LZ77.
IACR Cryptol. ePrint Arch., 2025

Preprocessing Security in Multiple Idealized Models with Applications to Schnorr Signatures and PSEC-KEM.
IACR Cryptol. ePrint Arch., 2025

A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function.
IACR Commun. Cryptol., 2025

The Impact of Reversibility on Parallel Pebbling.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2023
Differentially Private L<sub>2</sub>-Heavy Hitters in the Sliding Window Model.
CoRR, 2023

Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

On Explicit Constructions of Extremely Depth Robust Graphs.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On the Multi-user Security of Short Schnorr Signatures with Preprocessing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs.
CoRR, 2021

On the Security of Proofs of Sequential Work in a Post-Quantum World.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Approximating Cumulative Pebbling Cost Is Unique Games Hard.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
On the Multi-User Security of Short Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2019

Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019


  Loading...