AggFT：具有可证明终止性与隐私性的低成本容错智能电表聚合
AggFT: Low-Cost Fault-Tolerant Smart Meter Aggregation with Proven Termination and Privacy
AI总结：
本文针对智能电表与链路故障下的隐私聚合问题，改进基于掩码的协议，提出轻量级容错算法 AggFT，降低计算开销、证明终止性与故障下隐私性，并兼容掩码和同态加密。
摘要：
智能电表数据聚合协议已被开发出来，以应对针对用户消费数据日益增长的隐私威胁。然而，当智能电表或网络通信链路发生故障时，这些协议无法令人满意地工作。本文提出一种轻量级且容错的聚合算法，可作为进一步研究的坚实基础。我们重新审视了一种现有的基于掩码、具备错误恢复能力的隐私保护聚合协议，并从以下方面对其加以改进：（i）对密码学部分进行修改，从而降低计算成本；（ii）简化协议在故障存在时的行为，并在定义明确的故障模型下给出正确终止的证明；（iii）将计算部分与数据流解耦，使该算法也能够与同态加密结合，作为隐私保护的基础。据我们所知，这是首个同时面向掩码和同态加密而形式化的算法。（iv）最后，我们给出了故障条件下隐私保证的形式化证明。这种带有严格证明的系统化处理以及所建立的与图论的联系，也可作为在增强恢复能力方面进行可能推广和改进的起点。
英文摘要：
Smart meter data aggregation protocols have been developed to address rising privacy threats against customers' consumption data. However, these protocols do not work satisfactorily in the presence of failures of smart meters or network communication links. In this paper, we propose a lightweight and fault-tolerant aggregation algorithm that can serve as a solid foundation for further research. We revisit an existing error-resilient privacy-preserving aggregation protocol based on masking and improve it by: (i) performing changes in the cryptographic parts that lead to a reduction of computational costs, (ii) simplifying the behaviour of the protocol in the presence of faults, and showing a proof of proper termination under a well-defined failure model, (iii) decoupling the computation part from the data flow so that the algorithm can also be used with homomorphic encryption as a basis for privacy-preservation. To best of our knowledge, this is the first algorithm that is formulated for both, masking and homomorphic encryption. (iv) Finally, we provide a formal proof of the privacy guarantee under failure. The systematic treatment with strict proofs and the established connection to graph theory may also serve as a starting point for possible generalizations and improvements with respect to increased resilience.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
