Analysis of client-side security for long-term time-stamping services
From MaRDI portal
Publication:2117024
DOI10.1007/978-3-030-78372-3_2zbMath1489.68048OpenAlexW3168787638MaRDI QIDQ2117024
Publication date: 21 March 2022
Full work available at URL: https://zenodo.org/record/5546769
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long-term secure time-stamping using preimage-aware hash functions (short version)
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Modeling Computational Security in Long-Lived Systems
- Salvaging Merkle-Damgård for Practical Applications
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- How to Time-Stamp a Digital Document
- On Provably Secure Time-Stamping Schemes
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
- Knowledge-Binding Commitments with Applications in Time-Stamping
- Applied Cryptography and Network Security
This page was built for publication: Analysis of client-side security for long-term time-stamping services