Name
Abstract | ||
|---|---|---|
Ecient secure time-stamping schemes employ a 2-level approachin which the time-stamping service operates in rounds. We saythat a time-stamping service is accountable if if it makes the TSA andother authorities accountable for their actions by enabling a principal todetect and later prove to a judge any frauds, including attempts to reordertime-stamps from the same round. We investigate the paradigm oftime-stamping services based on simply connected graphs, and proposea simple, yet ... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/978-3-540-46588-1_20 | Public Key Cryptography |
Keywords | Field | DocType |
optimally efficient accountable time-stamping | Time stamping,Computer security,Computer science,Information protection policy,Threaded binary tree,Communication theory,Digital signature,Hash function,Timestamp,Public-key cryptography | Conference |
Volume | ISSN | ISBN |
1751 | 0302-9743 | 3-540-66967-1 |
Citations | PageRank | References |
27 | 1.72 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahto Buldas | 1 | 403 | 36.66 |
| Helger Lipmaa | 2 | 1650 | 112.63 |
| Berry Schoenmakers | 3 | 1550 | 119.18 |