The DOI matches its Crossref record.
Encryption-Scheme Security in the Presence of Key-Dependent Messages
Open accessOverview
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
“It evaluates a d-depth NAND-circuit as follows: given ciphertexts encrypted under pk i associated to wires at the ith level of the circuit, it Recrypts them so that they become encrypted under pk i 1 , applies the NAND gates at that level, and recurses for i 1. If E securely encrypts key-dependent messages (is KDM-sec…”
BackgroundAn 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
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293
Metadata
- Authors
- Black, J., Rogaway, P., & Shrimpton, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 62-75
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1485489906
- Cited by
- 249
- References
- 0
- FWCI
- 1.23
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Encryption-Scheme Security in the Presence of Key-Dependent Messages. https://app.cochat.ai/papers/10.1007/3-540-36492-7_6
- The paper
- Black, J., Rogaway, P., & Shrimpton, T. (2003). Encryption-Scheme Security in the Presence of Key-Dependent Messages. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-36492-7_6
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.