The DOI matches its OpenAlex record; 5 of the 5 references it cites were found in a registry or an index.
Protocols for secure computations
Abstract
Two millionaires wish to know who is richer; however, they do not want to find out inadvertently any additional information about each other’s wealth. How can they carry out such a conversation? This is a special case of the following general problem. Suppose m people wish to compute the value of a function f(x1, x2, x3, . . . , xm), which is an integer-valued function of m integer variables xi of bounded range. Assume initially person Pi knows the value of xi and no other x’s. Is it possible for them to compute the value of f , by communicating among themselves, without unduly giving away any information about the values of their own variables? The millionaires’ problem corresponds to the case when m = 2 and f(x1, x2) = 1 if x1 < x2, and 0 otherwise. In this paper, we will give precise formulation of this general problem and describe three ways of solving it by use of one-way functions (i.e., functions which are easy to evaluate but hard to invert). These results have applications to secret voting, private querying of database, oblivious negotiation, playing mental poker, etc. We will also discuss the complexity question “How many bits need to be exchanged for the computation”, and describe methods to prevent participants from cheating. Finally, we study the question “What cannot be accomplished with one-way functions”. Before describing these results, we would like to put this work in perspective by first considering a unified view of secure computation in the next section.
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. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Some complexity questions related to distributive computing(Preliminary Report)
Yao, A. C.-C. (1979) · Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79 · doi:10.1145/800135.804414 · Cited by 1,042
Self-citationDIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
Probabilistic 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
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“Cryptographic methods for computing on encrypted data were developed starting in the early 1980s [2], [3], and Agrawal and Srikant [4] and Vaidya et al.”
MethodFederated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
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
Self-citationUniversally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Mobile crowdsensing: current state and future challenges
Ganti, R., Ye, F., & Lei, H. (2011) · IEEE Communications Magazine · doi:10.1109/mcom.2011.6069707 · Cited by 2,054
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
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
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
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
A survey on trust management for Internet of Things
Yan, Z., Zhang, P., & Vasilakos, A. V. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.01.014 · Cited by 1,155
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
(2011) · PubMed · Cited by 990
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Security and Privacy on Blockchain
Zhang, R., Xue, R., & Liu, L. (2020) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 959
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
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
Cryptographic distinguishability measures for quantum-mechanical states
Fuchs, C. A., & van de Graaf, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761271 · Cited by 773
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
The round complexity of secure protocols
Beaver, D., Micali, S., & Rogaway, P. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100287 · Cited by 721
SplitFed: When Federated Learning Meets Split Learning
Thapa, C., Mahawaga Arachchige, P. C., Camtepe, S., & Sun, L. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i8.20825 · Cited by 720
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000002 · Cited by 718
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions
Ni, J., Zhang, K., Lin, X., & Shen, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2762345 · Cited by 659
Privacy-Preserving Set Operations
Kissner, L., & Song, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_15 · Cited by 648
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · arXiv · doi:10.48550/arxiv.1902.04885 · Cited by 600
Privacy-Preserving Face Recognition
Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., & Toft, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03168-7_14 · Cited by 583
Multiparty Computation from Threshold Homomorphic Encryption
Cramer, R., Damgård, I., & Nielsen, J. B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_18 · Cited by 578
Liu, K., Kargupta, H., & Ryan, J. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.14 · Cited by 554
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548
“Secure Multiparty Computation (SMC) [95] enables different participants with private inputs to perform a joint computation on their inputs without revealing them to each other.”
BackgroundInfluentialFoundations of garbled circuits
Bellare, M., Hoang, V. T., & Rogaway, P. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382279 · Cited by 541
Differentially private aggregation of distributed time-series with transformation and encryption
Rastogi, V., & Nath, S. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807247 · Cited by 534
Deng, M., Wuyts, K., Scandariato, R., Preneel, B., & Joosen, W. (2011) · Requirements Engineering · doi:10.1007/s00766-010-0115-7 · Cited by 533
Structured Encryption and Controlled Disclosure
Chase, M., & Kamara, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_33 · Cited by 520
Threshold Implementations Against Side-Channel Attacks and Glitches
Nikova, S., Rechberger, C., & Rijmen, V. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935308_38 · Cited by 507
Multi-prover interactive proofs: how to remove intractability
Ben-Or, M., Goldwasser, S., Kilian, J., & Widgerson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62223 · Cited by 468
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
Reusable garbled circuits and succinct functional encryption
Goldwasser, S., Kalai, Y., Popa, R. A., Vaikuntanathan, V., & Zeldovich, N. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488678 · Cited by 457
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
Secure multi-party computation problems and their applications: a review and open problems
Du, W., & Atallah, M. J. (2001) · Proceedings of the 2001 workshop on New security paradigms · doi:10.1145/508171.508174 · Cited by 453
PDA: Privacy-Preserving Data Aggregation in Wireless Sensor Networks
He, W., Liu, X., Nguyen, H., Nahrstedt, K., & Abdelzaher, T. (2007) · IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications · doi:10.1109/infcom.2007.237 · Cited by 434
Receipt-free secret-ballot elections (extended abstract)
Benaloh, J., & Tuinstra, D. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195407 · Cited by 432
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
Secure k-nearest neighbor query over encrypted data in outsourced environments
Elmehdwi, Y., Samanthula, B. K., & Jiang, W. (2014) · 2014 IEEE 30th International Conference on Data Engineering · doi:10.1109/icde.2014.6816690 · Cited by 386
A New Approach to Practical Active-Secure Two-Party Computation
Nielsen, J. B., Nordholt, P. S., Orlandi, C., & Burra, S. S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_40 · Cited by 379
Verifiable Delegation of Computation over Large Datasets
Benabbas, S., Gennaro, R., & Vahlis, Y. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_7 · Cited by 379
Enigma: Decentralized Computation Platform with Guaranteed Privacy
Zyskind, G., & Pentland, A. (2018) · New Solutions for Cybersecurity · doi:10.7551/mitpress/11636.003.0018 · Cited by 368
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Du, W., Han, Y. S., & Chen, S. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.21 · Cited by 366
More Efficient Constant-Round Multi-party Computation from BMR and SHE
Lindell, Y., Smart, N. P., & Soria-Vazquez, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53641-4_21 · Cited by 360
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
A 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
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Fair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_6 · Cited by 353
A model for asynchronous reactive systems and its application to secure message transmission
Pfitzmann, B., & Waidner, M. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924298 · Cited by 349
Privacy-Preserving Average Consensus via State Decomposition
Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2902731 · Cited by 334
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning
So, J., Guler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3054610 · Cited by 318
A Survey on Zero-Knowledge Proof in Blockchain
Sun, X., Yu, F. R., Zhang, P., Sun, Z., Xie, W., & Peng, X. (2021) · IEEE Network · doi:10.1109/mnet.011.2000473 · Cited by 316
Efficient Garbling from a Fixed-Key Blockcipher
Bellare, M., Hoang, V. T., Keelveedhi, S., & Rogaway, P. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.39 · Cited by 304
(2010) · Cited by 291
Privacy in the Smart City—Applications, Technologies, Challenges, and Solutions
Eckhoff, D., & Wagner, I. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2748998 · Cited by 287
Generic Attacks on Secure Outsourced Databases
Kellaris, G., Kollios, G., Nissim, K., & O'Neill, A. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978386 · Cited by 284
COCA: A secure distributed online certification authority
Zhou, L., Schneider, F. B., & Van Renesse, R. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571638 · Cited by 278
Composition and integrity preservation of secure reactive systems
Pfitzmann, B., & Waidner, M. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352639 · Cited by 277
Mix and Match: Secure Function Evaluation via Ciphertexts
Jakobsson, M., & Juels, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_13 · Cited by 276
Privacy-preserving matrix factorization
Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., & Boneh, D. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516751 · Cited by 271
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
Kus Khalilov, M. C., & Levi, A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2818623 · Cited by 271
Scalable and Unconditionally Secure Multiparty Computation
Damgård, I., & Nielsen, J. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_32 · Cited by 270
Efficient private bidding and auctions with an oblivious third party
Cachin, C. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319726 · Cited by 267
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Kolesnikov, V., Sadeghi, A.-R., & Schneider, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10433-6_1 · Cited by 263
Securely outsourcing linear algebra computations
Atallah, M. J., & Frikken, K. B. (2010) · Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security · doi:10.1145/1755688.1755695 · Cited by 263
Trustworthy ai: A computational perspective
Liu, H., Wang, Y., Fan, W., Liu, X., Li, Y., Jain, S., Liu, Y., Jain, A., & Tang, J. (2023) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3546872 · Cited by 261
Privacy in Internet of Things: From Principles to Technologies
Li, C., & Palanisamy, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2864168 · Cited by 130
A Survey of Self-Sovereign Identity Ecosystem
Soltani, R., Nguyen, U. T., & An, A. (2021) · Security and Communication Networks · doi:10.1155/2021/8873429 · Cited by 131
“History of secure multiparty computation begins in 1986 when Yao proposed the two-party computation protocol using cryptography [112].”
BackgroundMethodSecurity Aspects of Blockchain Technology Intended for Industrial Applications
Idrees, S. M., Nowostawski, M., Jameel, R., & Mourya, A. K. (2021) · Electronics · doi:10.3390/electronics10080951 · Cited by 127
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
Post-Quantum Era Privacy Protection for Intelligent Infrastructures
Malina, L., Dzurenda, P., Ricci, S., Hajny, J., Srivastava, G., Matulevicius, R., Affia, A.-A. O., Laurent, M., Sultan, N. H., & Tang, Q. (2021) · IEEE Access · doi:10.1109/access.2021.3062201 · Cited by 111
The tao of inference in privacy-protected databases
Bindschaedler, V., Grubbs, P., Cash, D., Ristenpart, T., & Shmatikov, V. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3236187.3236217 · Cited by 75
Kim, J., Koo, D., Kim, Y., Yoon, H., Shin, J., & Kim, S. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3212509 · Cited by 74
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
Practical Key Recovery Model for Self-Sovereign Identity Based Digital Wallets
Soltani, R., Nguyen, U. T., & An, A. (2019) · 2019 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · doi:10.1109/dasc/picom/cbdcom/cyberscitech.2019.00066 · Cited by 39
Backdoor attacks and defenses in feature-partitioned collaborative learning
Liu, Y., Yi, Z., & Chen, T. (2020) · arXiv · doi:10.48550/arxiv.2007.03608 · Cited by 38
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
Kumari, K. A., Sharma, A., Chakraborty, C., & Ananyaa, M. (2022) · Big Data · doi:10.1089/big.2021.0012 · Cited by 36
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
A Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks
Sun, X., Yu, F. R., Zhang, P., Xie, W., & Peng, X. (2020) · Sensors · doi:10.3390/s20154253 · Cited by 23
Decentralized and Privacy-Preserving Key Management Model
Soltani, R., Nguyen, U. T., & An, A. (2020) · 2020 International Symposium on Networks, Computers and Communications (ISNCC) · doi:10.1109/isncc49221.2020.9297294 · Cited by 8
Privacy preserving collaborative filtering by distributed mediation
Ben Horin, A., & Tassa, T. (2021) · Fifteenth ACM Conference on Recommender Systems · doi:10.1145/3460231.3474251 · Cited by 8
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
“…agents and their interactions may mean that traditional approaches to securing agent computations in distributed networks may not be directly applicable or sufficient, be it zero-trust approaches (Wylde, 2021), threat monitoring (Liao et al., 2013), or secure multi-party computation (Yao, 1982a).”
On Using Secure Aggregation in Differentially Private Federated Learning with Multiple Local Steps
Heikkilä, M. A. (2024) · arXiv · doi:10.48550/arxiv.2407.19286
Metadata
- Authors
- Yao, A. C.-C.
- Published
- 1982-11-03
- Pages
- 160-164
- OpenAlex
- W2092422002
- Cited by
- 2,661
- References
- 5
- FWCI
- 1.22
- Type
- journal article
- 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.