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 条
  • [41] Scalable Look-Ahead Linear Regression Trees
    Vogel, David S.
    Asparouhov, Ognian
    Scheffer, Tobias
    KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2007, : 757 - +
  • [42] CSPS model: Look-ahead controls and physics
    Matsui, M
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (10) : 2001 - 2025
  • [43] Look-ahead techniques for fast beam search
    Ortmanns, S
    Eiden, A
    Ney, H
    Coenen, N
    1997 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I - V: VOL I: PLENARY, EXPERT SUMMARIES, SPECIAL, AUDIO, UNDERWATER ACOUSTICS, VLSI; VOL II: SPEECH PROCESSING; VOL III: SPEECH PROCESSING, DIGITAL SIGNAL PROCESSING; VOL IV: MULTIDIMENSIONAL SIGNAL PROCESSING, NEURAL NETWORKS - VOL V: STATISTICAL SIGNAL AND ARRAY PROCESSING, APPLICATIONS, 1997, : 1783 - 1786
  • [44] YEAR-END REVIEW - AND A LOOK-AHEAD
    NAPIER, DH
    AEROSPACE AMERICA, 1994, 32 (04) : 8 - 10
  • [45] On look-ahead heuristics in disjunctive logic programming
    Wolfgang Faber
    Nicola Leone
    Gerald Pfeifer
    Francesco Ricca
    Annals of Mathematics and Artificial Intelligence, 2007, 51 : 229 - 266
  • [46] Look-ahead versus look-back for satisfiability problems
    Li, CM
    Anbulagan
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 97, 1997, 1330 : 341 - 355
  • [47] The Importance of Look-Ahead Depth in Evolutionary Checkers
    Al-Khateeb, Belal
    Kendall, Graham
    2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 2252 - 2258
  • [48] PROGRAM FOR TIMETABLE COMPILATION BY A LOOK-AHEAD METHOD
    CHERNIAVSKY, AL
    ARTIFICIAL INTELLIGENCE, 1972, 3 (02) : 61 - 76
  • [49] Better cooperative control with limited look-ahead
    Li, Dongxu
    Cruz, Jose B., Jr.
    2006 AMERICAN CONTROL CONFERENCE, VOLS 1-12, 2006, 1-12 : 4914 - +
  • [50] Look-Ahead Bidding Strategy for Energy Storage
    Wang, Yishen
    Dvorkin, Yury
    Fernandez-Blanco, Ricardo
    Xu, Bolun
    Qiu, Ting
    Kirschen, Daniel S.
    IEEE TRANSACTIONS ON SUSTAINABLE ENERGY, 2017, 8 (03) : 1106 - 1117