Private Aggregation from Fewer Anonymous Messages

theory and application of cryptographic techniques(2019)

引用 51|浏览46
暂无评分
摘要
Consider the setup where n parties are each given an element \\(x_i\\) in the finite field \\(\\mathbb {F}_q\\) and the goal is to compute the sum \\(\\sum _i x_i\\) in a secure fashion and with as little communication as possible. We study this problem in the anonymized model of Ishai et al. (FOCS 2006) where each party may broadcast anonymous messages on an insecure channel.
更多
查看译文
关键词
Secure aggregation, Anonymous channel, Shuffled model, Differential privacy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要