Accountable Certificate Management Using Undeniable Attestations

Accountable Certificate Management Using Undeniable Attestations (2000)

Cached

Download Links

[www.tml.hut.fi]

Other Repositories/Bibliography

DBLP

by Ahto Buldas , Peeter Laud , Helger Lipmaa

Venue:	COMPUTER AND COMMUNICATIONS SECURITY
Citations:	36 - 3 self

Versions

Version History

Metadata Version 4

User correction supplied by jfernandez

Datum	Value	Source
TITLE	Accountable Certificate Management Using Undeniable Attestations	user correction - Legacy Corrections
AUTHOR NAME	Ahto Buldas	user correction
AUTHOR AFFIL	Küberneetika AS, Akadeemia tee 21	user correction
AUTHOR ADDR	12618 Tallinn, Estonia	user correction
AUTHOR NAME	Peeter Laud	user correction
AUTHOR AFFIL	Universität des Saarlandes, FB 14 Informatik	user correction
AUTHOR ADDR	Im Stadtwald, Bau 45, Postfach 15 11 50, 66041 Saarbrücken, Germany	user correction
AUTHOR NAME	Helger Lipmaa	user correction
AUTHOR AFFIL	Helsinki University of Technology, Department of Computer Science	user correction
AUTHOR ADDR	FI-02015 HUT, Espoo, Finland	user correction
ABSTRACT	This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for accountable certificate management, where clients receive attestations confirming inclusion/removal of their certificates from the database of valid certificates. We explain why accountability depends on the inability of the third parties to create contradictory attestations. After that we define an undeniable attester as a primitive that provides efficient attestation creation, publishing and verification, so that it is intractable to create contradictory attestations. We introduce authenticated search trees and build an efficient undeniable attester upon them. The proposed system is the first accountable long-term certificate management system. Moreover, authenticated search trees can be used in many security-critical applications instead of the (sorted) hash trees to reduce trust in the authorities, without decrease in efficiency. Therefore, the undeniable attester promises looks like a very useful cryptographic primitive with a wide range of applications.	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
VENUE	COMPUTER AND COMMUNICATIONS SECURITY	user correction
VENUE TYPE	CONFERENCE	user correction
PAGES	9--17	user correction
CITATIONS	25 found	ParsCit 1.0