Apr 19, 2023 · Abstract:In secure summation, K users, each holds an input, wish to compute the sum of the inputs at a server without revealing any ...
Apr 19, 2023 · The main result of this work is a complete characterization of the minimum key size for weakly secure summation with arbitrary security and ...
The main result of this work is a complete characterization of the minimum key size for weakly secure summation with arbitrary security and colluding patterns, ...
Weakly Secure Summation with Colluding Users | Request PDF
www.researchgate.net › publication › 37...
In this paper, we mainly considered the privacy and security from the perspective of the databases. In reality, it is also possible that the clients collude ...
Co-authors ; Weakly secure summation with colluding users. Z Li, Y Zhao, H Sun. 2023 IEEE International Symposium on Information Theory (ISIT), 2398-2403, 2023.
Oct 22, 2024 · Next, we allow any arbitrary group of users to share an independent key and any arbitrary group of users to collude with the server. For such a ...
We analyse each secure summation protocol under different collusion scenarios and evaluate the efficiency of each protocol with different numbers of parties and ...
Missing: Weakly Users.
[19] Z. Li, Y. Zhao, and H. Sun, “Weakly secure summation with colluding users,” in 2023 IEEE International Symposium on Information Theory.
Abstract—An information escrow (IE) service allows its users to encrypt a message such that the message is unlocked only when a user-specified condition is ...
Abstract. We consider both classical and quantum variations of X-secure, E-eavesdropped and T-colluding symmetric private information retrieval (SPIR).