The DOI matches its Crossref record.
Advances in Cryptology — EUROCRYPT 2003
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
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
Information-theoretic security proof for quantum-key-distribution protocols
Renner, R., Gisin, N., & Kraus, B. (2005) · Physical Review A · doi:10.1103/physreva.72.012332 · Cited by 520
General properties of nonsignaling theories
Masanes, L., Acin, A., & Gisin, N. (2006) · Physical Review A · doi:10.1103/physreva.73.012112 · Cited by 401
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Secure Key from Bound Entanglement
Horodecki, K., Horodecki, M., Horodecki, P., & Oppenheim, J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160502 · Cited by 340
A survey on service function chaining
Bhamare, D., Jain, R., Samaka, M., & Erbad, A. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.09.001 · Cited by 331
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
CLEVR-X: A Visual Reasoning Dataset for Natural Language Explanations
Salewski, L., Koepke, A. S., Lensch, H. P. A., & Akata, Z. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-04083-2_5 · Cited by 20
Continuity and additivity properties of information decompositions
Rauh, J., Banerjee, P. K., Olbrich, E., Montúfar, G., & Jost, J. (2023) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2023.108979 · Cited by 7
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2581421091
- Cited by
- 241
- References
- 0
- FWCI
- 4.66
- 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.