The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
How to win the clonewars: efficient periodic n-times anonymous authentication
Open accessAbstract
We create a credential system that lets a user anonymously authenticate at most $n$ times in a single time period. A user withdraws a dispenser of n e-tokens. She shows an e-token to a verifier to authenticate herself; each e-token can be used only once, however, the dispenser automatically refreshes every time period. The only prior solution to this problem, due to Damgård et al. [29], uses protocols that are a factor of k slower for the user and verifier, where k is the security parameter. Damgård et al. also only support one authentication per time period, while we support n. Because our construction is based on e-cash, we can use existing techniques to identify a cheating user, trace all of her e-tokens, and revoke her dispensers. We also offer a new anonymity service: glitch protection for basically honest users who (occasionally) reuse e-tokens. The verifier can always recognize a reused e-token; however, we preserve the anonymity of users who do not reuse e-tokens too often.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“See Sweeney [46] and Recently Damg˚ard, Dupont and Pedersen [29] presented a session every half an hour), and at the same time to have a way to identify participants that submit data more frequently.”
BackgroundImproved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475 · cited 1×
“One example is the bilinear El Gamal cryptosystem [7, 2], which is semantically secure under the DBDH assumption; that is, given (g, g, g, g, Q), it is difficult to decide if Q = e(g, g).”
BackgroundSelf-citationAn 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-citation
Cited by
Privacy-preserving deep learning
Shokri, R., & Shmatikov, V. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813687 · Cited by 2,356
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks
Sun, J., Zhang, C., Zhang, Y., & Fang, Y. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.14 · Cited by 364
The Algebraic Group Model and its Applications
Fuchsbauer, G., Kiltz, E., & Loss, J. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96881-0_2 · Cited by 310
Smart Meter Data Privacy: A Survey
Asghar, M. R., Dan, G., Miorandi, D., & Chlamtac, I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 307
Randomizable Proofs and Delegatable Anonymous Credentials
Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., & Shacham, H. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_7 · Cited by 269
Self-citation
Metadata
- Authors
- Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., & Meyerovich, M.
- Venue
- Proceedings of the 13th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2006-10-30
- Pages
- 201-210
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2133420971
- Cited by
- 240
- References
- 3
- FWCI
- 10.08
- Type
- conference paper
- Language
- en
- Open access
- green
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.