Efficient Long-Term Validation of Digital Signatures
Lecture notes in computer sciencePublished 1 January 2001Open access
Arne Ansper, Ahto Buldas, Meelis Roos, Jan Willemson
Citations25
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work presents a new scheme that is fast revocation while giving no extra power to on-line service providers; lightweight and scalable; and supply long-term validation.
Abstract
Digitally signed documents (e.g. contracts) would quickly lose their validity if the signing keys were revoked or the signature scheme was broken. The conventional validation techniques have been designed just for ephemeral use of signatures and are impractical for long-term validation. We present a new scheme that: (1)pro vides fast revocation while giving no extra power to on-line service providers; (2)supports long-term validation; (3)is lightweight and scalable. All authors were supported by the Estonian SF, grant no. 4150
Keywords
Computer Science
IEEE Transactions on Information TheoryNew directions in cryptography
14,441 Citations1976Whitfield Diffie, Martin E. Hellman
Lecture notes in computer scienceAdvances in Cryptology — CRYPTO’ 99
2,625 Citations1999Michael J. Wiener
A sophisticated variant of Desmedt-Odlyzko's method where the attacker obtains the signatures of m1, mτ−1 and exhibits the signature of an mτ which was never submitted to the signer is presented.
Lecture notes in computer scienceA Certified Digital Signature
1,690 Citations2007Ralph C. Merkle
A practical digital signature system based on a conventionalryption function which is as secure as the conventional encryption function is described, without the several years delay required for certification of an untested system.
Journal of CryptologyHow to time-stamp a digital document
1,389 Citations1991Stuart Haber, W. Scott Stornetta
Computationally practical procedures are proposed for digital time-stamping of such documents so that it is infeasible for a user either to back-date or to forward-date his document, even with the collusion of a time-Stamping service.
Protocols for Public Key Cryptosystems
1,378 Citations1980Ralph C. Merkle
Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative.
X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP
795 Citations2013Stefan Santesson, M. Myers +4 more
Lecture notes in computer scienceAdvances in Cryptology -- CRYPTO 2015
659 Citations2015Rosario Gennaro, Matthew Robshaw
This paper presents a simpler and more restricted variant of the universally composable security (UC) framework that is suitable for “standard” two-party and multiparty computation tasks and shows that for every protocol that can be represented in the SUC framework, the protocol is secure in SUC if and only if it isSecure in UC.
Lecture notes in computer sciencePublic-Key Cryptography – PKC 2017
444 Citations2017Serge Fehr
This framework provides an abstraction of dual system paradigms over composite-order graded multilinear encoding schemes in a black-box manner and achieves succinctness, meaning that the key and ciphertext sizes are less than or proportional to corresponding circuit sizes.
Improving the Efficiency and Reliability of Digital Time-Stamping
378 Citations1993Dave Bayer, Stuart Haber +1 more
Two schemes for digital time-stamping which rely on Cryptographic hash functions, which can be used both to report events succinctly, and to cause events based on documents without revealing their contents are proposed.
Lecture notes in computer scienceOn certificate revocation and validation
230 Citations1998Paul Kocher
The traditional revocation techniques of Certificate Revocation Lists (CRLs) and on-line checking are described, as well as a newer technique, certificate Revocation Trees (CRTs), based on Merkle hash trees, which provide an efficient and highly-scalable way to distribute revocation information.
Lecture notes in computer scienceCan we eliminate certificate revocation lists?
181 Citations1998Ronald L. Rivest
This work considers certificate revocation lists (CRLs), and asks whether they could, and should, be eliminated, in favor of other mechanisms, and suggests some possible replacement mechanisms.
Lecture notes in computer scienceTime-stamping with binary linking schemes
119 Citations1998Ahto Buldas, Peeter Laud +2 more
A digital signature certification system creates a nonce and attaches a time to the nonce to create a time stamped nonce uniquely identifying the time stamp, which uniquely identifies the signature on the document.
Efficient Broadcast Time-Stamping
67 Citations1991Josh Benaloh, Michael de Mare
Lecture notes in computer scienceEfficient and Fresh Certification
57 Citations2000Irene Gassko, Peter Gemmell +1 more
This work proposes a new solution to the problem of certificate revocation, and in particular, the creation of certification authorities (CAs) for public-key infrastructure (PKI).
Lecture notes in computer scienceOnline Certificate Status Checking in Financial Transactions: The Case for Re-issuance
17 Citations1999Barbara Fox⋆, Brian LaMacchia
This paper proposes a simple mechanism for online certificate status checking that is particularly well suited to the closed public key infrastructures that characterize financial networks and demonstrates how persistent evidence of this status checking request/response becomes a valuable by-product.