The DOI matches its Crossref record.
Untraceable RFID tags via insubvertible encryption
Abstract
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain universal re-encryption schemes, insubvertible encryption prevents against adversarial exploitation of hidden channels, by including certificates proving that the ciphertext can only be decrypted by authorized parties.The scheme can be applied to RFID tags, providing strong protection against tracing. This enables post-sale applications of manufacturer-issued RFID tags while preserving the privacy of consumers. The functionality required of the RFID tags is minimal, namely that they be re-writable (many-writable). No cryptographic capabilities are required of the tags themselves, as the readers perform all necessary computations.
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
Cited by
RFID security and privacy: a research survey
Juels, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861395 · Cited by 1,911
An overview of Internet of Things (IoT): Architectural aspects, challenges, and protocols
Gupta, B. B., & Quamara, M. (2020) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.4946 · Cited by 493
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
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Metadata
- Authors
- Ateniese, G., Camenisch, J., & de Medeiros, B.
- Venue
- Proceedings of the 12th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2005-11-07
- Pages
- 92-101
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2083631211
- Cited by
- 171
- References
- 0
- FWCI
- 12.64
- 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.