Proceedings 16th Annual Computer Security Applications Conference (ACSAC'00)
DOI: 10.1109/acsac.2000.898881
|View full text |Cite
|
Sign up to set email alerts
|

A novel approach to on-line status authentication of public-key certificates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(5 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…These studies include Certificate Revocation System (CRS) (Micali, 1996), Certificate Revocation Tree (CRT) (Kocher, 1998), Delta CRL (Adams & Zuccherato, 1998), and On-line Certificate Status Protocol (OCSP) (The Internet Society, 1999). The use of CRS and CRT for certificate revocation still has a number of weaknesses, including the complexity of certificate verification and the latency associated with certificate statusupdating (Faldella & Prandini, 2000Naor & Nissim, 2002). Moreover, Cooper (2000) asserts that the Delta CRL mechanism does not improve the performance and scalability of the certificate-based PKI scheme.…”
Section: Related Workmentioning
confidence: 99%
“…These studies include Certificate Revocation System (CRS) (Micali, 1996), Certificate Revocation Tree (CRT) (Kocher, 1998), Delta CRL (Adams & Zuccherato, 1998), and On-line Certificate Status Protocol (OCSP) (The Internet Society, 1999). The use of CRS and CRT for certificate revocation still has a number of weaknesses, including the complexity of certificate verification and the latency associated with certificate statusupdating (Faldella & Prandini, 2000Naor & Nissim, 2002). Moreover, Cooper (2000) asserts that the Delta CRL mechanism does not improve the performance and scalability of the certificate-based PKI scheme.…”
Section: Related Workmentioning
confidence: 99%
“…Both the heights of the binary search tree and the redblack tree increase as O(log n) with time. The red-black tree is always shorter than the binary search tree, and approaches the optimum height 1 N/A O (1) hash chain CRT 5) O(n) N/A O(n) binary search tree 2-3 Tree 13) O(log n) N/A O(log n) 2-3 Tree EFECT 8) O(log n) N/A O(log n) B-Tree SEM 10) 1 1 O(1) Threshold RSA Accumulator 9) N/A O(n) O (1) RSA Accumulator proposed O(log n) N/A O(log n) red-black tree of a completely balanced tree. The maximum reduction at n = 20,000 was 0.75, which implies a reduction in computation cost for insert, delete, and search.…”
Section: 6 Estimation Based On Actual Revocation Datamentioning
confidence: 99%
“…When X=0 and v/u=100, because m has increased up to n, the number of total revoked certificates in system, computation cost reaches the maximum-about 174 exponentiations. Although this maximal cost is much better than in [5] and [6], some strategies can be employed to efficiently reduce computation cost. One is choosing a moderate value of X.…”
Section: B Re-computation Ofaccumulatorsmentioning
confidence: 99%
“…Although [5] and [6] present some methods to reduce traffic and computation in this scheme, unfortunately, the performance is still not satisfying.…”
Section: One-way Accumulatorsmentioning
confidence: 99%