Accountable and Transparent TLS Certificate Management: An Alternate Public-Key Infrastructure with Verifiable Trusted Parties

Table 2

Asymptotic Analysis of Log-based Schemes. Here, n is total number of certificate present in the log server, k presents total number of domains, and m represents total number of active certificates for domains in the log server.

Schemes	Parameters	Certificate presence proof	Certificate absence proof	Extension proof	Currency proof
CT[34]	Proof size	O(logn)		O(logn)
	Computation cost	O(logn)		O(logn)
	Verification cost	O(logn)		O(logn)
AKI[46]	Proof size	O(logk)	O(logk)		O(logk)
	Computation cost	O(logn)	O(logn)		O(logn)
	Verification cost	O(logn)	O(logn)		O(logn)
ARPKI[48]	Proof size	O(logn)	O(logn)		O(logn)
	Computation cost	O(logn)	O(logn)		O(logn)
	Verification cost	O(logn)	O(logn)		O(logn)
Policert[35]	Proof size	O(logn)	O(logn)		O(logn)
	Computation cost	O(logn)	O(logn)		O(logn)
	Verification cost	O(logn)	O(logn)		O(logn)
DTKI[47]	Proof size	O(logn)	O(logn)	O(logn)	O(logk)
	Computation cost	O(logn)	O(logn)	O(logn)	O(logk)
	Verification cost	O(logn)	O(logn)	O(logn)	O(logk)
ATCM(Our Scheme)	Proof size	O(logk)	O	O(logn)	O
	Computation cost	O(logk)	O(m)	O(logn)	O(m)
	Verification cost	O(logk)	O	O(logn)	O