GXChain：可信计算—研究进展与技术分析_30页_3mb

GXChain可信计算技术研究总结

核心内容

可信计算是一种在保护数据隐私前提下实现数据大规模应用的技术，主要涵盖可信硬件、可信软件和可信网络等方向。本文重点分析了同态加密、安全多方计算（SMC）和可信执行环境（TEE）三种核心技术的发展现状、性能表现及应用场景。

主要观点

• 同态加密（HE）：允许在加密数据上直接进行计算，无需解密。目前存在计算复杂度高、通信开销大的问题，但已有多种优化方案，如HElib和SEAL，其性能已有所提升。
• 安全多方计算（SMC）：多个互不信任的参与者在不泄露隐私的前提下联合计算。虽然在半诚实模型中有所进展，但在恶意模型中仍有不足，且复杂算法的执行需要大量带宽和计算资源。
• 可信执行环境（TEE）：如Intel SGX，提供安全的执行环境，确保代码和数据的机密性和完整性。在实际应用中，TEE表现更为成熟，具备较高的性能和较低的通信开销。

关键信息

1. 技术简介与发展

1.1 同态加密

• 定义：对加密数据进行处理，解密结果与未加密数据处理结果一致。
• 历史发展：1978年由Rivest等人提出，2009年Gentry提出首个全同态加密方案（FHE）。
• 技术挑战：计算复杂度高，通信开销大，实用性受限。
• 优化方案：如BGV、GSW，以及HElib和SEAL库。

1.2 安全多方计算

• 定义：多个参与者在不泄露隐私的前提下计算某个函数。
• 研究进展：从两方计算到多方计算，如SPDZ、MASCOT等协议。
• 应用实例：包括防止卫星碰撞、纳税欺诈、性侵侦察、金融分析、教育数据等。
• 性能瓶颈：带宽限制显著，尤其在恶意模型下，计算效率较低。

1.3 可信执行环境

• 定义：智能设备上的安全区域，保障代码和数据安全。
• 技术代表：Intel SGX和ARM TrustZone。
• 性能优势：相比HE和SMC，具有更高的计算效率和更小的通信开销。
• 应用案例：包括区块链支付、机器学习模型推理等。

2. 可信计算技术性能分析

2.1 同态加密性能分析

• HElib测试结果：
  • AES加密：4分5秒（非自举） vs 17分30秒（自举）
  • AES解密：6分34秒（非自举） vs 27分11秒（自举）
• SEAL测试结果：
  • 加密与解密操作时间分别为13ms和11ms
  • 密文加法和乘法操作时间分别为<1ms和39ms（P1）或5056ms（P2）

2.2 安全多方计算性能分析

• 快速剪切和选择协议：
  • 通信开销显著降低，如AES在广域网下通信量为约24MB
  • 带宽限制明显，且复杂算法的执行效率较低
• 交互式乱码方案：
  • TinyLEGO在多个安全级别下表现优于传统方案
  • 通信带宽优化显著，如SHA256在广域网下通信量为约2376ms

2.3 可信执行环境性能分析

• SGX测试结果：
  • 寻找最大数：吞吐量随数据量增加而下降
  • SHA256：openssl吞吐量为435MB/s，sgxsdk为350MB/s（80%）
  • AES加密：sgxssl性能接近Opaque库
• SGX中的机器学习：
  • 通过将计算外包至GPU，实现DNN推理加速
  • 在VGG16和MobileNet等模型中实现12.7倍和5.0倍的加速

3. 结论

• 性能对比：在计算性能和带宽方面，HE和SMC存在较大局限，难以满足复杂运算需求。
• 应用前景：TEE具备更高的性能和更低的通信开销，是当前最具竞争力和实用性的方案。
• 未来展望：TEE在未来三年内有望成为主流技术，推动区块链和数据经济的发展。

参考文献

[1] Rivest, R. L., Adleman, L., & Dertouzos, M. L. (1978). On data banks and privacy homomorphisms. Foundations of secure computation, 4(11), 169-180.
[2] Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
[3] Paillier, P. (1999, May). Public-key cryptosystems based on composite degree residuosity classes. In International Conference on the Theory and Applications of Cryptographic Techniques (pp. 223-238). Springer, Berlin, Heidelberg.
[4] Gentry, C., & Boneh, D. (2009). A fully homomorphic encryption scheme (Vol. 20, No. 09). Stanford University.
[5] Smart, N. P., & Vercauteren, F. (2010, May). Fully homomorphic encryption with relatively small key and ciphertext sizes. In International Workshop on Public Key Cryptography (pp. 420-443). Springer, Berlin, Heidelberg.
[6] Gentry, C., & Halevi, S. (2011, May). Implementing gentry's fully-homomorphic encryption scheme. In Annual international conference on the theory and applications of cryptographic techniques (pp. 129–148). Springer, Berlin, Heidelberg.
[7] Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014). (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT), 6(3), 13.
[8] Halevi, S., & Shoup, V. (2014, August). Algorithms in helib. In Annual Cryptology Conference (pp. 554-571). Springer, Berlin, Heidelberg.
[9] Gentry, C., Sahai, A., & Waters, B. (2013, August). Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Annual Cryptology Conference (pp. 75–92). Springer, Berlin, Heidelberg.
[10] Yao, Andrew Chi-Chih. "Protocols for secure computations." FOCS. Vol. 82. 1982.
[11] Goldreich, Oded, Silvio Micali, and Avi Wigderson. "How to play any mental game." Proceedings of the nineteenth annual ACM symposium on Theory of computing. ACM, 1987.
[12] Goldreich, Oded. "Secure multi-party computation." Manuscript. Preliminary version 78 (1998).
[13] Goldwasser, Shafi. "Multi party computations: past and present." Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing. ACM, 1997.
[14] https://github.com/n1analytics/MP-SPDZ
[15] https://www.icpsr.umich.edu/icpsrweb/
[16] Hemenway, B., Lu, S., Ostrovsky, R., & Welser Iv, W. (2016, August). High-precision secure computation of satellite collision probabilities. In International Conference on Security and Cryptography for Networks (pp. 169–187). Springer, Cham.
[17] Bogdanov, D., Jöemets, M., Siim, S., & Vaht, M. (2015, January). How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation. In International Conference on Financial Cryptography and Data Security (pp. 227-234). Springer, Berlin, Heidelberg.
[18] Rajan, A., Qin, L., Archer, D. W., Boneh, D., Lepoint, T., & Varia, M. (2018, June). Callisto: A cryptographic approach to detecting serial perpetrators of sexual misconduct. In Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies (p. 49). ACM.
[19] Lapets, A., Jansen, F., Albab, K. D., Issa, R., Qin, L., Varia, M., & Bestavros, A. (2018, June). Accessible privacy-preserving web-based data analysis for assessing and addressing economic inequalities. In Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies (p. 48). ACM.
[20] https://www.congress.gov/bill/115th-congress/house-bill/4479
[21] https://sharemind.cyber.ee/sharemind-mpc/
[22] Microsoft. The Coco Framework. Whitepaper, https://github.com/Azure/coco-framework. 2017.
[23] Hearn, M. (2016). Corda: A distributed ledger. Corda Technical White Paper
[24] Lind, J., Eyal, I., Kelbert, F., Naor, O., Pietzuch, P., & Sirer, E. G. (2017). Teechain: Scalable blockchain payments using trusted execution environments. arXiv preprint arXiv:1707.05454.
[25] Gu, Z., Huang, H., Zhang, J., Su, D., Lamba, A., Pendarakis, D., & Molloy, I. (2018). Securing Input Data of Deep Learning Inference Systems via Partitioned Enclave Execution. arXiv preprint arXiv:1807.00969.
[26] Kunkel, R., Quoc, D. L., Gregor, F., Arnautov, S., Bhatotia, P., & Fetzer, C. (2019). TensorSCONE: A Secure TensorFlow Framework using Intel SGX. arXiv preprint arXiv:1902.04413.
[27] Hunt, T., Song, C., Shokri, R., Shmatikov, V., & Witchel, E. (2018). Chiron: Privacy-preserving machine learning as a service. arXiv preprint arXiv:1803.05961.
[28] Martins, P., Sousa, L., & Mariano, A. (2018). A survey on fully homomorphic encryption: An engineering perspective. ACM Computing Surveys (CSUR), 50(6), 83.
[29] Halevi, S., & Shoup, V. (2018, August). Faster homomorphic linear transformations in helib. In Annual International Cryptology Conference (pp. 93–120). Springer, Cham.
[30] Bos, J. W., Lauter, K., & Naehrig, M. (2014). Private predictive analysis on encrypted medical data. Journal of biomedical informatics, 50, 234-243.
[31] Lindell, Y. (2016). Fast cut-and-choose-based protocols for malicious and covert adversaries. Journal of Cryptology, 29(2), 456-490.
[32] Lindell, Y., & Pinkas, B. (2012). Secure two-party computation via cut-and-choose oblivious transfer. Journal of cryptography, 25(4), 680–722.
[33] Frederiksen, T. K., Jakobsen, T. P., Nielsen, J. B., & Trifiletti, R. (2015). TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation. IACR Cryptology ePrint Archive, 2015, 309.
[34] Frederiksen, T. K., Jakobsen, T. P., & Nielsen, J. B. (2014, September). Faster maliciously secure two-party computation using the GPU. In International Conference on Security and Cryptography for Networks (pp. 358-379). Springer, Cham.
[35] Lindell, Y. (2016). Fast cut-and-choose-based protocols for malicious and covert adversaries. Journal of Cryptology, 29(2), 456-490.
[36] Wang, X., Ranellucci, S., & Katz, J. (2017, October). Authenticated garbling and efficient maliciously secure two-party computation. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 21-37). ACM.
[37] Wang, X., Malozemoff, A. J., & Katz, J. (2017, April). Faster secure two-party computation in the single-execution setting. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 399-424). Springer, Cham.
[38] Nielsen, J. B., Schneider, T., & Trifletti, R. (2017, February). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS.
[39] Harnik, D., & Tsfadia, E. (2017). Impressions of Intel SGX performance.
[40] Tramer, F., & Boneh, D. (2018). Slalom: Fast, verifiable and private execution of neural networks in trusted hardware. arXiv preprint arXiv:1806.03287.