Modelling a Public-Key Infrastructure
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
How to Time-Stamp a Digital Document
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
How to incorporate revocation status information into the trust metrics for public-key certification
Proceedings of the 2005 ACM symposium on Applied computing
EuroPKI '08 Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice
Empirical Analysis of Certificate Revocation Lists
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
A calculus of trust and its application to PKI and identity management
Proceedings of the 8th Symposium on Identity and Trust on the Internet
Design requirements for a secure time-stamping scheme
EuroIMSA '08 Proceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications
Validity models of electronic signatures and their enforcement in practice
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Modeling public key infrastructures in the real world
EuroPKI'05 Proceedings of the Second European conference on Public Key Infrastructure
Modeling long-term signature validation for resolution of dispute
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Certification validation: back to the past
EuroPKI'11 Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications
| Hi-index | 0.09 |
In MBarka and Stern (2011) [3], we proposed a new algorithm to validate certificates in the past with the goals of it being simple to present, simple to implement and to fall back on standard algorithms with current time settings. This paper improves our algorithm through a much cleaner handling of time issues by defining a new notion, called revocation freshness, yielding a better fall-back on the standard algorithm. It also takes into account a practical ''caution period'' to lessen some of our previous hypothesis.