论文信息 - Secure Multiparty Computation for Cooperative Cyber Risk Assessment

Secure Multiparty Computation for Cooperative Cyber Risk Assessment

A common problem organizations face is determining how to prioritize security updates and patches to minimize the risk of vulnerabilities in their infrastructure. Limited resources constrain organizations to select a set of only the most security critical updates that they can afford to perform; thus, it is very important to compute the risk of delaying less critical updates accurately.

[1] Arkady Yerukhimovich,et al. Cryptography for Big Data Security , 2015, IACR Cryptol. ePrint Arch..

[2] Pasquale Malacaria,et al. How to spend it: optimal investment for cyber security , 2014, ACySE '14.

[3] Arjen K. Lenstra,et al. Information Security Risk Assessment, Aggregation, and Mitigation , 2004, ACISP.

[4] Dan Bogdanov,et al. Sharemind: A Framework for Fast Privacy-Preserving Computations , 2008, ESORICS.

[5] Andrew Chi-Chih Yao,et al. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6] Arkady Yerukhimovich,et al. A survey of cryptographic approaches to securing big-data analytics in the cloud , 2014, 2014 IEEE High Performance Extreme Computing Conference (HPEC).

[7] Xenofontas A. Dimitropoulos,et al. SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics , 2010, USENIX Security Symposium.

[8] Ivan Damgård,et al. Asynchronous Multiparty Computation: Theory and Implementation , 2008, IACR Cryptol. ePrint Arch..

[9] Robert K. Cunningham,et al. Cryptographically Secure Computation , 2015, Computer.

[10] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.