Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Direct Anonymous Attestation (DAA) is a scheme that enables the remote authentication of a Trusted Platform Module (TPM) while preserving the user's privacy. A TPM can prove to a remote party that it is a valid TPM without revealing its identity and without linkability. In the DAA scheme, a TPM can be revoked only if the DAA private key in the hardware has been extracted and published widely so that verifiers obtain the corrupted private key. If the unlinkability requirement is relaxed, a TPM suspected of being compromised can be revoked even if the private key is not known. However, with the full unlinkability requirement intact, if a TPM has been compromised but its private key has not been distributed to verifiers, the TPM cannot be revoked. Furthermore, a TPM cannot be revoked from the issuer, if the TPM is found to be compromised after the DAA issuing has occurred. In this paper, we present a new DAA scheme called Enhanced Privacy ID (EPID) scheme that addresses the above limitations. While still providing unlinkability, our scheme provides a method to revoke a TPM even if the TPM private key is unknown. This expanded revocation property makes the scheme useful for other applications such as for driver's license. Our EPID scheme is efficient and secure in the same security model as DAA, i.e. in the random oracle model under the strong RSA assumption and the decisional Diffie-Hellman assumption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Cited by
Applications of Blockchains in the Internet of Things: A Comprehensive Survey
Ali, M. S., Vecchio, M., Pincheira, M., Dolui, K., Antonelli, F., & Rehmani, M. H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2886932 · Cited by 855
“This solution is based on the ChainAnchor [121] system that aims to provide pseudonymity within permissioned blockchains using zero-knowledge proof scheme and Enhanced Privacy ID (EPID) [122].”
MethodSecurity keys: Practical cryptographic second factors for the modern web
Lang, J., Czeskis, A., Balfanz, D., Schilder, M., & Srinivas, S. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54970-4_25 · Cited by 54
“Advanced cryptographic techniques such as Direct Anonymous Attestation [35] and Enhanced Privacy ID [36] address many of the shortcomings of a privacy CA scheme, by allowing revocation without involving a trusted third party.”
MethodAttestation Mechanisms for Trusted Execution Environments Demystified
Ménétrey, J., Göttel, C., Khurshid, A., Pasin, M., Felber, P., Schiavoni, V., & Raza, S. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-16092-9_7 · Cited by 51
“Finally, the verifier examines the signature of the evidence (Fig.3-(cid:200) ) using the Intel attestation service (IAS) [5, 14].”
Method
Metadata
- Authors
- Brickell, E., & Li, J.
- Venue
- Proceedings of the 2007 ACM workshop on Privacy in electronic society
- Publisher
- ACM
- Published
- 2007-10-29
- Pages
- 21-30
- OpenAlex
- W2159372323
- Cited by
- 152
- References
- 2
- FWCI
- 6.72
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.