Name
Abstract | ||
|---|---|---|
One of the key features that must be supported by every modern PKI is an efficient way to determine (at verification) whether the signing key had been revoked. In most solutions, the verifier periodically contacts the certificate authority (CA) to obtain a list of blacklisted, or whitelisted, certificates. In the worst case this has to be done for every signature verification. Besides the computational costs of verification, after revocation all signatures under the revoked key become invalid. In the solution by Boneh et al. at USENIX ' 01, the CA holds a share of the private signing key and contributes to the signature generation. After revocation, the CA simply denies its participation in the interactive signing protocol. Thus, the revoked user can no longer generate valid signatures. We extend this solution to also cover privacy, non-trusted setups, and time-stamps. We give a formal definitional framework, and provide elegantly simple, yet provably secure, instantiations from efficient standard building blocks such as digital signatures, commitments, and partially blind signatures. Finally, we propose extensions to our scheme. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-45572-3_2 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 9824 | 0302-9743 |
Citations | PageRank | References |
2 | 0.35 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Beck | 1 | 549 | 25.12 |
| Stephan Krenn | 2 | 2 | 0.69 |
| Franz-Stefan Preiss | 3 | 74 | 6.55 |
| Samelin, K. | 4 | 148 | 12.46 |