The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Self-citationUniversally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509980 · Cited by 717
Metadata
- Authors
- Bellare, M., Boldyreva, A., & Micali, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 259-274
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1901278359
- Cited by
- 519
- References
- 1
- FWCI
- 12.68
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. https://app.cochat.ai/papers/10.1007/3-540-45539-6_18
- The paper
- Bellare, M., Boldyreva, A., & Micali, S. (2000). Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45539-6_18
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.