Decentralized Anonymous Credentials
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Author(s): Christina Garman, Matthew Green, Ian Miers Download: Paper (PDF) Date: 22 Feb 2014 Document Type: Briefing Papers Additional Documents: Slides Associated Event: NDSS Symposium 2014 Abstract: We propose a novel anonymous credential scheme that eliminates the need for trusted credential issuers. Our approach builds on recent results in distributed anonymous e-cash and uses techniques … Continued
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 2×
“Peer-to-peer networks are vulnerable to impersonation attacks, where a single party simulates many different peers in order to gain advantage against the network [28].”
BackgroundSecurity 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
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
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 2×
“Anonymous credentials, introduced by Chaum [21] and developed in a line of subsequent works [4, 9, 13, 14, 16], represent a powerful solution to this privacy concern: they deprive even colluding credential issuers and verifiers of the ability to identify and track their users.”
BackgroundZerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983 · cited 3×
“For some applications, merely having paid the tiny registration fee may be su � cient and no verification is necessary.”
BackgroundSelf-citationPinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Cited by
Ali, O., Ally, M., Clutterbuck, & Dwivedi, Y. (2020) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2020.102199 · Cited by 422
Blockchain Technology as an Enabler of Service Systems: A Structured Literature Review
Seebacher, S., & Schüritz, R. (2017) · Lecture Notes in Business Information Processing · doi:10.1007/978-3-319-56925-3_2 · Cited by 377
A Comparative Study: Blockchain Technology Utilization Benefits, Challenges and Functionalities
Ali, O., Jaradat, A., Kulakli, A., & Abuhalimeh, A. (2021) · IEEE Access · doi:10.1109/access.2021.3050241 · Cited by 294
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings
Maller, M., Bowe, S., Kohlweiss, M., & Meiklejohn, S. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3339817 · Cited by 290
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains
Boneh, D., Bünz, B., & Fisch, B. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26948-7_20 · Cited by 271
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
Formal Treatment of Privacy-Enhancing Credential Systems
Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G. L., Neven, G., & Pedersen, M. Ø. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-31301-6_1 · Cited by 65
A taxonomic approach to understanding emerging blockchain identity management systems
Lesavre, L. (2020) · doi:10.6028/nist.cswp.01142020 · Cited by 64
“3 There are additional advanced schemes to issue credentials anonymously and without relying on any trusted issuer by using the techniques in [30] , but the claims for which these credentials are issued must be verifiable by anyone participating in that system.”
BackgroundVision: A Critique of Immunity Passports and W3C Decentralized Identifiers
Halpin, H. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-64357-7_7 · Cited by 31
“Although some schemes use blockchain technologies to achieve decentralization, these are still too computationally expensive for real-world use [14].”
Background
Metadata
- Authors
- Garman, C., Green, M., & Miers, I.
- Venue
- Proceedings 2014 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2014
- OpenAlex
- W2089128139
- Cited by
- 155
- References
- 9
- FWCI
- 4.94
- 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.