Secure Partitioning of Cloud Applications, with Cost Look-Ahead

被引:0
|
作者
Bocci, Alessandro [1 ]
Forti, Stefano [1 ]
Guanciale, Roberto [2 ]
Ferrari, Gian-Luigi [1 ]
Brogi, Antonio [1 ]
机构
[1] Univ Pisa, Dept Comp Sci, I-56127 Pisa, Italy
[2] KTH Royal Inst Technol, Div Theoret Comp Sci, S-11428 Stockholm, Sweden
关键词
data confidentiality; trusted execution environments; separation kernels; information-flow security; deployment costs; declarative programming; ISSUES;
D O I
10.3390/fi15070224
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The security of Cloud applications is a major concern for application developers and operators. Protecting users' data confidentiality requires methods to avoid leakage from vulnerable software and unreliable Cloud providers. Recently, trusted execution environments (TEEs) emerged in Cloud settings to isolate applications from the privileged access of Cloud providers. Such hardware-based technologies exploit separation kernels, which aim at safely isolating the software components of applications. In this article, we propose a methodology to determine safe partitionings of Cloud applications to be deployed on TEEs. Through a probabilistic cost model, we enable application operators to select the best trade-off partitioning in terms of future re-partitioning costs and the number of domains. To the best of our knowledge, no previous proposal exists addressing such a problem. We exploit information-flow security techniques to protect the data confidentiality of applications by relying on declarative methods to model applications and their data flow. The proposed solution is assessed by executing a proof-of-concept implementation that shows the relationship among the future partitioning costs, number of domains and execution times.
引用
收藏
页数:38
相关论文
共 50 条
  • [31] Mesh stability of look-ahead interconnected systems
    Pant, A
    Seiler, P
    Hedrick, K
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (02) : 403 - 407
  • [34] Effect of Look-Ahead Depth in Evolutionary Checkers
    Belal Al-Khateeb
    Graham Kendall
    Journal of Computer Science and Technology, 2012, 27 : 996 - 1006
  • [35] LOOK-AHEAD SCHEDULING FOR MINIMIZING MACHINE INTERFERENCE
    KOULAMAS, CP
    SMITH, ML
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1988, 26 (09) : 1523 - 1533
  • [36] Storage-to-tree transducers with look-ahead
    Hornung, T
    Vágvölgyi, S
    THEORETICAL COMPUTER SCIENCE, 2004, 329 (1-3) : 115 - 158
  • [37] Generalized look-ahead feedrate planning algorithm
    Dong, Jing-Chuan
    Wang, Tai-Yong
    Wang, Zi-Jing
    Li, Bo
    Ding, Yan-Yu
    Jiang, Yong-Xiang
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2013, 19 (03): : 529 - 539
  • [38] Distributed compilation allocation with look-ahead heuristics
    Mizrachi, D
    Exman, L
    2004 23RD IEEE CONVENTION OF ELECTRICAL AND ELECTRONICS ENGINEERS IN ISRAEL, PROCEEDINGS, 2004, : 141 - 144
  • [39] Look-ahead methods for block Hankel systems
    VanBarel, M
    Bultheel, A
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1997, 86 (01) : 311 - 333
  • [40] Effect of Look-Ahead Depth in Evolutionary Checkers
    Belal Al-Khateeb
    Graham Kendall
    Journal of Computer Science & Technology, 2012, 27 (05) : 996 - 1006