The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Design and implementation of the idemix anonymous credential system
Abstract
Anonymous credential systems [8, 9, 12, 24] allow anonymous yet authenticated and accountable transactions between users and service providers. As such, they represent a powerful technique for protecting users' privacy when conducting Internet transactions. In this paper, we describe the design and implementation of an anonymous credential system based on the protocols developed by [6]. The system is based on new high-level primitives and interfaces allowing for easy integration into access control systems. The prototype was realized in Java. We demonstrate its use and some deployment issues with the description of an operational demonstration scenario.
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
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Decentralized Trust Management
Blaze, M., Feigenbaum, J., & Lacy, J. (1996) · Cited by 1,870
Crowds: anonymity for Web transactions
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,770
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
Self-citationUntraceable Electronic Cash: (Extended Abstract)
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_25 · Cited by 1,120
Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., & Ylonen, T. (1999) · doi:10.17487/rfc2693 · Cited by 762
Design of a role-based trust-management framework
Li, N., Mitchell, J. C., & Winsborough, W. H. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004366 · Cited by 750
Goldschlag, D., Reed, M., & Syverson, P. (1999) · Communications of the ACM · doi:10.1145/293411.293443 · Cited by 689
Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521
Onion Routing for Anonymous and Private Internet Connections
Goldschlag, D. M., Reed, M., & Syverson, P. F. (1999) · Cited by 413
Proceedings. 1989 IEEE Symposium on Security and Privacy
(1989) · doi:10.1109/secpri.1989 · Cited by 406
Access control meets public key infrastructure, or: assigning roles to strangers
Herzberg, A., Mass, Y., Mihaeli, J., Naor, D., & Ravid, Y. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848442 · Cited by 388
KeyNote: Trust Management for Public-Key Infrastructures: Position Paper
Blaze, M., Feigenbaum, J., & Keromytis, A. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49135-x_9 · Cited by 360
ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Informatik-Fachberichte · doi:10.1007/978-3-642-76462-2_32 · Cited by 216
A Secure and Privacy-Protecting Protocol for Transmitting Personal Information Between Organizations
Chaum, D., & Evertse, J. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_10 · Cited by 157
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
Damgård, I. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_26 · Cited by 146
A logic-based knowledge representation for authorization with delegation
Li, N., Feigenbaum, J., & Grosof, B. N. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.1999.779771 · Cited by 100
Unlinkable serial transactions: protocols and applications
Stubblebine, S. G., Syverson, P. F., & Goldschlag, D. M. (1999) · ACM Transactions on Information and System Security · doi:10.1145/330382.330384 · Cited by 67
Self-delegation with controlled propagation — or — What if you lose your laptop
Goldreich, O., Pfitzmann, B., & Rivest, R. L. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055726 · Cited by 41
Cited by
Hyperledger fabric: a distributed operating system for permissioned blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · Proceedings of the Thirteenth EuroSys Conference · doi:10.1145/3190508.3190538 · Cited by 3,654
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Privacy in the Internet of Things: threats and challenges
Ziegeldorf, J. H., Morchon, O. G., & Wehrle, K. (2014) · Security and Communication Networks · doi:10.1002/sec.795 · Cited by 610
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Camenisch, J., & Shoup, V. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_8 · Cited by 541
Self-citationHyperledger Fabric: A Distributed Operating System for Permissioned Blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10228 · Cited by 499
Metadata
- Authors
- Camenisch, J., & Van Herreweghen, E.
- Venue
- Proceedings of the 9th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2002-11-18
- Pages
- 21-30
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2033820870
- Cited by
- 555
- References
- 21
- FWCI
- 10.60
- 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.