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.
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
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
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
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
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
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
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Can homomorphic encryption be practical?
Naehrig, M., Lauter, K., & Vaikuntanathan, V. (2011) · Proceedings of the 3rd ACM workshop on Cloud computing security workshop · doi:10.1145/2046660.2046682 · Cited by 1,004
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
Designated Verifier Proofs and Their Applications
Jakobsson, M., Sako, K., & Impagliazzo, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_13 · Cited by 817
Secure Multiparty Computation for Privacy-Preserving Data Mining
Lindell, Y., & Pinkas, B. (2009) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i1.566 · Cited by 554
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
A robust and verifiable cryptographically secure election scheme
Cohen, J. D., & Fischer, M. J. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.2 · Cited by 408
Thapa, C., & Camtepe, S. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 393
Functional Signatures and Pseudorandom Functions
Boyle, E., Goldwasser, S., & Ivan, I. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54631-0_29 · Cited by 384
Self-citationA Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2015) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357
Privacy-Preserving Datamining on Vertically Partitioned Databases
Dwork, C., & Nissim, K. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_32 · Cited by 348
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488623 · Cited by 304
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Blum, M., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_23 · Cited by 262
Self-citationYang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 261
How to generate cryptographically strong sequences of pseudo random bits
Blum, M., & Micali, S. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.72 · Cited by 252
Self-citationZebraLancer: Private and Anonymous Crowdsourcing System atop Open Blockchain
Lu, Y., Tang, Q., & Wang, G. (2018) · 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2018.00087 · Cited by 224
Homomorphic Encryption for Machine Learning in Medicine and Bioinformatics
Wood, A., Najarian, K., & Kahrobaei, D. (2021) · ACM Computing Surveys · doi:10.1145/3394658 · Cited by 179
Privacy-preserving neural networks with Homomorphic encryption: Challenges and opportunities
Pulido-Gaytan, B., Tchernykh, A., Cortés-Mendoza, J. M., Babenko, M., Radchenko, G., Avetisyan, A., & Drozdov, A. Y. (2021) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-021-01076-8 · Cited by 126
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Security and Privacy Issues in Deep Learning
Bae, H., Jang, J., Jung, D., Jang, H., Ha, H., Lee, H., & Yoon, S. (2018) · arXiv · doi:10.48550/arxiv.1807.11655 · Cited by 56
A Review of Homomorphic Encryption Libraries for Secure Computation
Sathya, S. S., Vepakomma, P., Raskar, R., Ramachandra, R., & Bhattacharya, S. (2018) · arXiv · doi:10.48550/arxiv.1812.02428 · Cited by 37
Antwi-Boasiako, E., Zhou, S., Liao, Y., Liu, Q., Wang, Y., & Owusu-Agyemang, K. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102949 · Cited by 31
Privacy-Preserving Electrocardiogram Monitoring for Intelligent Arrhythmia Detection
Son, J., Park, J., Oh, H., Bhuiyan, M., Hur, J., & Kang, K. (2017) · Sensors · doi:10.3390/s17061360 · Cited by 25
“To transfer the sensing signal securely, we use a stream cipher that consists of a pseudo-random generator (PRG) and a bitwise exclusive OR operator [32].”
MethodOn Using The First Variant of Dependent RSA Encryption Scheme to Secure Text: A Tutorial
Rachmawati, D., & Budiman, M. A. (2020) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/1542/1/012024 · Cited by 11
A public key cryptosystem and signature scheme based on numerical series
Nagaty, K. A. (2020) · SN Applied Sciences · doi:10.1007/s42452-019-1928-8 · Cited by 5
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
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.