保护隐私的凸包生成协议

摘要

特殊的安全多方计算目前成为密码学界的一个研究热点。保护隐私的计算几何作为一类特殊的安全多方计算问题，有其广阔的应用前景。文章对其中的安全两方凸包求解问题进行分析，结合STPCH协议对PPCHP—QH协议加以改进，提出一个保护隐私的两方凸包快速生成协议且对其正确性、安全性和复杂性进行分析。%Special secure multi - party computation is one of the research focuses of the cryptography. As a special case of secure multi - party computation problems, privacy - preserving computational geometry has a broad application prospect. In this paper, finding secure two party convex hulls is studied. With STPCH protocol, PPCHP _ QH protocol is improved, and then a privacy - preserving protocol for quickly generating two party convex hulls is presented. It also discusses and analyzes the correctness, security and complexity of the protocol. The protocol is better than STPCH protocol and PPCHP_ QH protocol.