TY - GEN
T1 - Optimally efficient accountable time-stamping
AU - Buldas, A.
AU - Lipmaa, H.
AU - Schoenmakers, L.A.M.
PY - 2000
Y1 - 2000
N2 - Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable if if it makes the TSA and other authorities accountable for their actions by enabling a principal to detect and later prove to a judge any frauds, including attempts to reorder time-stamps from the same round. We investigate the paradigm of time-stamping services based on simply connected graphs, and propose a simple, yet optimal, accountable time-stamping service, using what we call threaded tree schemes. We improve upon the previously best scheme by Buldas and Laud by reducing the size of a time stamp by a factor of about 3.786 and show that our construction is optimal in a strict sense. The new protocols also increase the trustworthiness of the publication process, which takes place at the end of each round.
AB - Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable if if it makes the TSA and other authorities accountable for their actions by enabling a principal to detect and later prove to a judge any frauds, including attempts to reorder time-stamps from the same round. We investigate the paradigm of time-stamping services based on simply connected graphs, and propose a simple, yet optimal, accountable time-stamping service, using what we call threaded tree schemes. We improve upon the previously best scheme by Buldas and Laud by reducing the size of a time stamp by a factor of about 3.786 and show that our construction is optimal in a strict sense. The new protocols also increase the trustworthiness of the publication process, which takes place at the end of each round.
U2 - 10.1007/978-3-540-46588-1_20
DO - 10.1007/978-3-540-46588-1_20
M3 - Conference contribution
SN - 3-540-66967-1
T3 - Lecture Notes in Computer Science
SP - 293
EP - 305
BT - Public Key Cryptography (Proceedings PKC 2000, Melbourne, Australia, January 18-20, 2000)
A2 - Imai, H.
A2 - Zheng, Y.
PB - Springer
CY - Berlin
ER -