Eliminating counterevidence with applications to accountable certificate management

Journal of Computer Security

Volumn 10, Issue 3, 2002, Pages 273-296

  Buldas, Ahto ^a   Laud, Peeter ^a   Lipmaa, Helger ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

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

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; PROGRAM DOCUMENTATION; PUBLIC KEY CRYPTOGRAPHY;

ACCOUNTABLE CERTIFICATE MANAGEMENT;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 0036312254     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2002-10304     Document Type: Conference Paper

References (30)

1. One-way accumulators: A decentralized alternative to digital signatures
2. Multidimensional binary search trees used for associative searching
3. Multidimensional binary search trees in database applications
4. Optimal bounds for the predecessor problem
5. Accountable certificate management using undeniable attestations
6. Time-stamping with binary linking schemes
7. Optimally efficient accountable time-stamping
8. Collision-free accumulators and fail-stop signature schemes without trees
9. A certification scheme for electronic commerce
10. A design principle for Hash functions
11. New directions in cryptography
12. Dynamic perfect hashing: Upper and lower bounds
13. Universal codeword sets and representations for the integers
14. Efficient and fresh certification
15. How to time-stamp a digital document
16. On certificate revocation and validation
17. Enabling the archival storage of signed documents
18. Protocols for public key cryptosystems
19. One way Hash functions and DES
20. Certificate revocation and certificate update
21. Commutativity in cryptography
22. Fast accumulated Hashing
23. Can we eliminate revocation lists?
24. Efficient accumulators without trapdoor
25. Analysis and application of accountable certificate management