Reduce to the Max:A Simple Approach for Massive-Scale Privacy-Preserving Collaborative Network Measurements(缩减到最大:大规模隐私保护协作网络测量的简单方法)
Reduce to the Max: A Simple Approach for Massive-Scale Privacy-Preserving Collaborative Network Measurements (Extended Version)
摘要:
分布式计算中的隐私保护技术是域间网络协同监控的一个重要框架。存在几种不同的方法来解决这类问题,例如,基于Shamir秘密共享算法的同态加密和安全多方计算.从计算理论的角度来看,这样的技术是完整的:给定一组私有输入,可以执行任意计算任务,而不会泄露任何中间结果。事实上,HE和SSS也可以对秘密输入进行操作和/或提供秘密输出。然而,它们在计算上是昂贵的,并且在玩家的数量和/或计算任务的速率方面不能很好地扩展。在本文中,我们提倡使用“基本”(相对于“完整”)安全多方计算(E-SMC)的流量监控程序。E-SMC仅支持具有私有输入和公共输出的简单计算,即,它既不能处理秘密输入,也不能处理秘密(中间)输出。这样的简化带来了复杂性的显著降低,并且使得能够以可接受的延迟和开销实现大规模的实现。尽管它的简单性,我们声称,E-SMC计划是足以执行各种各样的计算任务的实际相关的协作网络监测,包括,例如,匿名发布和设置操作。这是通过将E-SMC方案与数据结构(如布隆过滤器和位图字符串)相结合来实现的。
英文摘要:
Privacy-preserving techniques for distributed computation have been proposed recently as a promising framework in collaborative inter-domain network monitoring. Several different approaches exist to solve such class of problems, e.g., Homomorphic Encryption (HE) and Secure Multiparty Computation (SMC) based on Shamir's Secret Sharing algorithm (SSS). Such techniques are complete from a computation-theoretic perspective: given a set of private inputs, it is possible to perform arbitrary computation tasks without revealing any of the intermediate results. In fact, HE and SSS can operate also on secret inputs and/or provide secret outputs. However, they are computationally expensive and do not scale well in the number of players and/or in the rate of computation tasks. In this paper we advocate the use of "elementary" (as opposite to "complete") Secure Multiparty Computation (E-SMC) procedures for traffic monitoring. E-SMC supports only simple computations with private input and public output, i.e., it can not handle secret input nor secret (intermediate) output. Such a simplification brings a dramatic reduction in complexity and enables massive-scale implementation with acceptable delay and overhead. Notwithstanding its simplicity, we claim that an E-SMC scheme is sufficient to perform a great variety of computation tasks of practical relevance to collaborative network monitoring, including, e.g., anonymous publishing and set operations. This is achieved by combining a E-SMC scheme with data structures like Bloom Filters and bitmap strings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。