The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
How to generate and exchange secrets
Abstract
In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature. Specifically, we show how two parties A and B can interactively generate a random integer N = p·q such that its secret, i.e., the prime factors (p, q), is hidden from either party individually but is recoverable jointly if desired. This can be utilized to give a protocol for two parties with private values i and j to compute any polynomially computable functions f(i,j) and g(i,j) with minimal knowledge transfer and a strong fairness property. As a special case, A and B can exchange a pair of secrets sA, sB, e.g. the factorization of an integer and a Hamiltonian circuit in a graph, in such a way that sA becomes computable by B when and only when sB becomes computable by A. All these results are proved assuming only that the problem of factoring large intergers is computationally intractable.
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
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
Self-citationProtocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Self-citationThe knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Self-citationTheory 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
Self-citationProbabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
Goldreich, O., Micali, S., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.47 · Cited by 549
Coin flipping by telephone a protocol for solving impossible problems
Blum, M. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008911 · Cited by 518
Limits on the security of coin flips when half the processors are faulty
Cleve, R. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12168 · Cited by 451
Blum, M. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357360.357368 · Cited by 205
Cited by
Items 101–118 of 118
Security issues and requirements for Internet-scale publish-subscribe systems
Wang, C., Carzaniga, A., Evans, D., & Wolf, A. L. (2003) · Proceedings of the 35th Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2002.994531 · Cited by 176
ARRIGHI, P., & SALVAIL, L. (2006) · International Journal of Quantum Information · doi:10.1142/s0219749906002171 · Cited by 118
TenSEAL: A Library for Encrypted Tensor Operations Using Homomorphic Encryption
Benaissa, A., Retiat, B., Cebere, B., & Belfedhal, A. E. (2021) · arXiv · doi:10.48550/arxiv.2104.03152 · Cited by 111
Secret Collusion among AI Agents: Multi-Agent Deception via Steganography
Motwani, S., Baranchuk, M., Strohmeier, M., Bolina, V., Torr, P., Hammond, L., & Witt, C. D. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-2336 · Cited by 106
Security, Privacy, and Usability in Continuous Authentication: A Survey
Baig, A. F., & Eskeland, S. (2021) · Sensors · doi:10.3390/s21175967 · Cited by 98
Machine learning and genomics: precision medicine versus patient privacy
Azencott, C.-A. (2018) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2017.0350 · Cited by 89
Privacy-Preserving Gradient-Descent Methods
Han, S., Ng, W. K., Wan, L., & Lee, V. C. S. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.153 · Cited by 70
Zero trust: Never trust, always verify
Wylde, A. (2021) · 2021 International Conference on Cyber Situational Awareness, Data Analytics and Assessment (CyberSA) · doi:10.1109/cybersa52016.2021.9478244 · Cited by 62
Sebastian, G. (2023) · doi:10.2139/ssrn.4454761 · Cited by 56
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
Privacy-Preserving Deep Learning Based on Multiparty Secure Computation: A Survey
Zhang, Q., Xin, C., & Wu, H. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3058638 · Cited by 53
A Survey of Privacy-Preserving Methods Across Vertically Partitioned Data
Vaidya, J. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_14 · Cited by 46
Liu, X., Liu, A., Zhang, X., Li, Z., Liu, G., Zhao, L., & Zhou, X. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-55753-3_36 · Cited by 42
Tkachenko, O., Weinert, C., Schneider, T., & Hamacher, K. (2018) · Proceedings of the 2018 on Asia Conference on Computer and Communications Security · doi:10.1145/3196494.3196541 · Cited by 27
“We evaluated the algorithms both with the GMW and Yao’s GC protocol (cf. § 2.4.4 and §2.4.5, respectively).”
MethodInfluentialA Flexible and Privacy-Preserving Collaborative Filtering Scheme in Cloud Computing for VANETs
Yang, H., Shen, J., Zhou, T., Ji, S., & Vijayakumar, P. (2022) · ACM Transactions on Internet Technology · doi:10.1145/3425708 · Cited by 17
Trustworthy AI Inference Systems: An Industry Research View
Cammarota, R., Schunter, M., Rajan, A., Boemer, F., Kiss, Á., Treiber, A., Weinert, C., Schneider, T., Stapf, E., Sadeghi, A.-R., et al. (2020) · arXiv · doi:10.48550/arxiv.2008.04449 · Cited by 9
Function-Based Access Control (FBAC): Towards Preventing Insider Threats in Organizations
Desmedt, Y., & Shaghaghi, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-04834-1_8 · Cited by 5
Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents
de Witt, C. S., Krawiecka, K., Krawczuk, I., Hagag, B., Anderson, W. L., Belcak, P., Bucknall, B., Cai, X., Chopra, A., Cohen, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2505.02077 · Cited by 108
“Cryptographers have long treated secure multi-party computation (Yao, 1986) and Byzantine fault tolerance (Lamport et al., 1982b) as foundational distributed security primitives, yet the privacy-performance and security - performance trade-offs in freely interacting autonomous agent systems -…”
Metadata
- Authors
- Yao, A. C.-C.
- Venue
- 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
- Publisher
- IEEE
- Published
- 1986-10
- Pages
- 162-167
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2088492763
- Cited by
- 3,733
- References
- 12
- FWCI
- 7.26
- 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.