Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On Provably Secure Time-Stamping Schemes

From MaRDI portal
Publication:5465834
Jump to:navigation, search

DOI10.1007/978-3-540-30539-2_35zbMath1094.94508OpenAlexW122805432MaRDI QIDQ5465834

Ahto Buldas, Märt Saarepera

Publication date: 12 August 2005

Published in: Advances in Cryptology - ASIACRYPT 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30539-2_35



Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (5)

Does Secure Time-Stamping Imply Collision-Free Hash Functions? ⋮ Stamp and Extend – Instant But Undeniable Timestamping Based on Lazy Trees ⋮ Efficiency Bounds for Adversary Constructions in Black-Box Reductions ⋮ Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? ⋮ Analysis of client-side security for long-term time-stamping services




This page was built for publication: On Provably Secure Time-Stamping Schemes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5465834&oldid=30002364"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 03:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki