The DOI matches its Crossref record.
Public-key cryptosystems provably secure against chosen ciphertext attacks
Open accessAbstract
We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given a public-key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model.No such secure cryptosystems were known before.A concrete implementation can be based on quadratic residuosity intractability.
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
Cited by
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
A Survey of Homomorphic Encryption for Nonspecialists
Fontaine, C., & Galand, F. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/13801 · Cited by 438
Canetti, R., Dwork, C., Naor, M., & Ostrovsky, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052229 · Cited by 348
Self-citationvon Ahn, L., & Hopper, N. J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_20 · Cited by 147
Metadata
- Authors
- Naor, M., & Yung, M.
- Venue
- Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90
- Publisher
- ACM Press
- Published
- 1990
- Pages
- 427-437
- OpenAlex
- W2073210531
- Cited by
- 1,088
- References
- 0
- FWCI
- 4.53
- 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: Public-key cryptosystems provably secure against chosen ciphertext attacks. https://app.cochat.ai/papers/10.1145/100216.100273
- The paper
- Naor, M., & Yung, M. (1990). Public-key cryptosystems provably secure against chosen ciphertext attacks. Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90. https://doi.org/10.1145/100216.100273
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.
