The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Probabilistic encryption & how to play mental poker keeping secret all partial information
Open accessAbstract
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
On Distinguishing Prime Numbers from Composite Numbers
Adleman, L. M., Pomerance, C., & Rumely, R. S. (1983) · The Annals of Mathematics · doi:10.2307/2006975 · Cited by 305
Solved and Unsolved Problems in Number Theory
Bellman, R., & Shanks, D. (1963) · Mathematics of Computation · doi:10.2307/2004020 · Cited by 189
Riemann's Hypothesis and tests for primality
Miller, G. L. (1975) · Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75 · doi:10.1145/800116.803773 · Cited by 186
On taking roots in finite fields
Adleman, L. M., Manders, K. L., & Miller, G. L. (1977) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1977.18 · Cited by 119
On distinguishing prime numbers from composite numbers
Adleman, L. M. (1980) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1980.28 · Cited by 66
Gilles Brassard, A. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.36 · Cited by 37
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Metadata
- Authors
- Goldwasser, S., & Micali, S.
- Venue
- Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82
- Publisher
- ACM Press
- Published
- 1982
- Pages
- 365-377
- OpenAlex
- W2043944888
- Cited by
- 883
- References
- 10
- FWCI
- 9.78
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Probabilistic encryption & how to play mental poker keeping secret all partial information. https://app.cochat.ai/papers/10.1145/800070.802212
- The paper
- Goldwasser, S., & Micali, S. (1982). Probabilistic encryption & how to play mental poker keeping secret all partial information. Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. https://doi.org/10.1145/800070.802212
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.