Accountable certificate management using undeniable attestations

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2000, Pages 9-17

  Buldas, A ^a   Laud, P ^a   Lipmaa, H ^a  

^a Küberneetika AS   (Estonia)

Author keywords

Accountable certificate management; Attesters; Authenticated search trees; Long term authenticity; Non repudiation; Public key infrastructure; Search trees; Time stamping

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; DATABASE SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

ACCOUNTABLE CERTIFICATE MANAGEMENT; AUTHENTICATED SEARCH TREES; DIGITAL DOCUMENTS; PUBLIC KEY INFRASTRUCTURE;

MANAGEMENT INFORMATION SYSTEMS;

EID: 0034449541     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/352600.352604     Document Type: Conference Paper

References (25)

1. Fast digital identity revocation
2. Collision-free accumulators and fail-stop signature schemes without trees
3. Optimal bounds for the predecessor problem
4. One-way accumulators: A decentralized alternative to digital signatures (extended abstract)
5. Time-stamping with binary linking schemes
6. Optimally efficient accountable time-stamping
7. A certification scheme for electronic commerce
8. A design principle for hash functions
9. Dynamic perfect hashing: Upper and lower bounds
10. New directions in cryptography
11. Efficient and fresh certification
12. How to time-stamp a digital document
13. On certificate revocation and validation
14. Protocols for public key cryptosystems
15. One way hash functions and DES
16. Efficient certificate revocation
17. Certificate revocation and certificate update
18. Commutativity in cryptography
19. Fast accumulated hashing
20. Can we eliminate revocation lists?
21. Efficient accumulators without trapdoor