Daniel Jost

Orcid: 0000-0002-6562-9665

Affiliations:
  • New York University, New York, NY, USA
  • ETH Zurich, Switzerland (former)


According to our database1, Daniel Jost authored at least 19 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Triple Ratchet: A Bandwidth Efficient Hybrid-Secure Signal Protocol.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Compact Key Storage in the Standard Model.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Compact Key Storage - A Modern Approach to Key Backup and Delegation.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening Liveness.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

ELEKTRA: Efficient Lightweight multi-dEvice Key TRAnsparency.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Forward-Secure Encryption with Fast Forwarding.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

On the Insider Security of MLS.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Generalized Proofs of Knowledge with Fully Dynamic Setup.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020
On Generalizations of Composable Security.
PhD thesis, 2020

Continuous Group Key Agreement with Active Security.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Agree-and-Prove: Generalized Proofs Of Knowledge and Applications.
IACR Cryptol. ePrint Arch., 2019

A Unified and Composable Take on Ratcheting.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
A note on the equivalence of IND-CCA & INT-PTXT and IND-CCA & INT-CTXT.
IACR Cryptol. ePrint Arch., 2018

Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Security Definitions for Hash Functions: Combining UCE and Indifferentiability.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions.
IACR Cryptol. ePrint Arch., 2017

2013
An Automatic Encoding from VeriFast Predicates into Implicit Dynamic Frames.
Proceedings of the Verified Software: Theories, Tools, Experiments, 2013


  Loading...