Patrick Harasser

Orcid: 0009-0005-6095-9402

According to our database1, Patrick Harasser authored at least 8 papers between 2018 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Succinct PPRFs via Memory-Tight Reductions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Multi-Source Randomness Extraction and Generation in the Random-Oracle Model.
Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2024
The Uber-Knowledge Assumption: A Bridge to the AGM.
IACR Commun. Cryptol., 2024

Block Ciphers in Idealized Models: Automated Proofs and New Security Results.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2022
Beyond Uber: Instantiating Generic Groups via PGGs.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021
BlindOR: an Efficient Lattice-Based Blind Signature Scheme from OR-Proofs.
Proceedings of the Cryptology and Network Security - 20th International Conference, 2021

2020
Signatures from Sequential-OR Proofs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2018
Invisible Sanitizable Signatures and Public-Key Encryption are Equivalent.
Proceedings of the Applied Cryptography and Network Security, 2018


  Loading...