Access control related problems and solutions are commonly taken for granted as the No.1 enterprise security concern. Today, as more and more companies shift their business to cloud, while blurring the boundary of information exchange and management, this inevitably introduces serious technical challenges and difficulties to the realm of access security management for loss of cognitive central control in some degree, thereby increasingly receiving more attentions and investigations on their original basis. Big internet companies such as Google, Facebook in the US., and Baidu in China, their IDCs consist of huge amount of physical servers and millions of virtual machines or containers, usually deemed as a profound private cloud. At meantime, doing daily jobs, hundreds and thousands of employees (most of them are engineers with different roles) demand to access multi-categorical resources in IDC frequently. For example, SREs may need to remotely logon production servers to configure environment or rectify system mistakes; RDs might logon by certain account associated to machines, initiating services to fulfill development work. Moreover, IDC is the place where tremendous applications are running dynamically and endlessly, among which they exchange information one another by accessing to data storage and computing services probably across domains. As a consequence, a very complicated topology based on accessing relationships is emerged due to interactions among massive people-devices-services. In order to solve such large-scale distributed access control centered problems, this apparently leads to a line of security technologies needing to be considered, including identity management, authentication methods, authorization models, auditing and reporting, regulatory compliance, tracing and forensic, domain isolation, intrusion detections, and even more the administration toolkits for security evaluation criteria. Toward designing and implementing this desired type of comprehensive security platform, while simultaneously circumventing relative reliable, scalable and performance issues in engineering, as is highly concerned in industrial-level products, it is really a daunting task if without developing appropriate abstraction on targets and innovative applicable theorem in depth, for reducing complexity and unifying mechanisms. In this talk, we just present such a real-world existing system developed by our team, namely Giano which embraces most aforementioned security techniques, already widely used for Baidu IDC operating management and integrated into many business products. Some important related theoretical work such as delegation logic, attribute-based authentication, proof-carrying authorization, et al. are about to be illustrated, with the focus on their applications in practice.
{"title":"Giano: Toward Large Scale Access Security Management in Private Cloud","authors":"Ye Wu","doi":"10.1145/2898445.2898458","DOIUrl":"https://doi.org/10.1145/2898445.2898458","url":null,"abstract":"Access control related problems and solutions are commonly taken for granted as the No.1 enterprise security concern. Today, as more and more companies shift their business to cloud, while blurring the boundary of information exchange and management, this inevitably introduces serious technical challenges and difficulties to the realm of access security management for loss of cognitive central control in some degree, thereby increasingly receiving more attentions and investigations on their original basis. Big internet companies such as Google, Facebook in the US., and Baidu in China, their IDCs consist of huge amount of physical servers and millions of virtual machines or containers, usually deemed as a profound private cloud. At meantime, doing daily jobs, hundreds and thousands of employees (most of them are engineers with different roles) demand to access multi-categorical resources in IDC frequently. For example, SREs may need to remotely logon production servers to configure environment or rectify system mistakes; RDs might logon by certain account associated to machines, initiating services to fulfill development work. Moreover, IDC is the place where tremendous applications are running dynamically and endlessly, among which they exchange information one another by accessing to data storage and computing services probably across domains. As a consequence, a very complicated topology based on accessing relationships is emerged due to interactions among massive people-devices-services. In order to solve such large-scale distributed access control centered problems, this apparently leads to a line of security technologies needing to be considered, including identity management, authentication methods, authorization models, auditing and reporting, regulatory compliance, tracing and forensic, domain isolation, intrusion detections, and even more the administration toolkits for security evaluation criteria. Toward designing and implementing this desired type of comprehensive security platform, while simultaneously circumventing relative reliable, scalable and performance issues in engineering, as is highly concerned in industrial-level products, it is really a daunting task if without developing appropriate abstraction on targets and innovative applicable theorem in depth, for reducing complexity and unifying mechanisms. In this talk, we just present such a real-world existing system developed by our team, namely Giano which embraces most aforementioned security techniques, already widely used for Baidu IDC operating management and integrated into many business products. Some important related theoretical work such as delegation logic, attribute-based authentication, proof-carrying authorization, et al. are about to be illustrated, with the focus on their applications in practice.","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131724044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shuo Qiu, Boyang Wang, Ming Li, Jesse Victors, Jiqiang Liu, Yanfeng Shi, Wei Wang
Computing similarity, especially Jaccard Similarity, between two datasets is a fundamental building block in big data analytics, and extensive applications including genome matching, plagiarism detection, social networking, etc. The increasing user privacy concerns over the release of has sensitive data have made it desirable and necessary for two users to evaluate Jaccard Similarity over their datasets in a privacy-preserving manner. In this paper, we propose two efficient and secure protocols to compute the Jaccard Similarity of two users' private sets with the help of an unfully-trusted server. Specifically, in order to boost the efficiency, we leverage Minhashing algorithm on encrypted data, where the output of our protocols is guaranteed to be a close approximation of the exact value. In both protocols, only an approximate similarity result is leaked to the server and users. The first protocol is secure against a semi-honest server, while the second protocol, with a novel consistency-check mechanism, further achieves result verifiability against a malicious server who cheats in the executions. Experimental results show that our first protocol computes an approximate Jaccard Similarity of two billion-element sets within only 6 minutes (under 256-bit security in parallel mode). To the best of our knowledge, our consistency-check mechanism represents the very first work to realize an efficient verification particularly on approximate similarity computation.
{"title":"Fast, Private and Verifiable: Server-aided Approximate Similarity Computation over Large-Scale Datasets","authors":"Shuo Qiu, Boyang Wang, Ming Li, Jesse Victors, Jiqiang Liu, Yanfeng Shi, Wei Wang","doi":"10.1145/2898445.2898453","DOIUrl":"https://doi.org/10.1145/2898445.2898453","url":null,"abstract":"Computing similarity, especially Jaccard Similarity, between two datasets is a fundamental building block in big data analytics, and extensive applications including genome matching, plagiarism detection, social networking, etc. The increasing user privacy concerns over the release of has sensitive data have made it desirable and necessary for two users to evaluate Jaccard Similarity over their datasets in a privacy-preserving manner. In this paper, we propose two efficient and secure protocols to compute the Jaccard Similarity of two users' private sets with the help of an unfully-trusted server. Specifically, in order to boost the efficiency, we leverage Minhashing algorithm on encrypted data, where the output of our protocols is guaranteed to be a close approximation of the exact value. In both protocols, only an approximate similarity result is leaked to the server and users. The first protocol is secure against a semi-honest server, while the second protocol, with a novel consistency-check mechanism, further achieves result verifiability against a malicious server who cheats in the executions. Experimental results show that our first protocol computes an approximate Jaccard Similarity of two billion-element sets within only 6 minutes (under 256-bit security in parallel mode). To the best of our knowledge, our consistency-check mechanism represents the very first work to realize an efficient verification particularly on approximate similarity computation.","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128189145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Virtual machine live migration technology, as an important support for cloud computing, has become a central issue in recent years. The virtual machines' runtime environment is migrated from the original physical server to another physical server, maintaining the virtual machines running at the same time. Therefore, it can make load balancing among servers and ensure the quality of service. However, virtual machine migration security issue cannot be ignored due to the immature development of it. This paper we analyze the security threats of the virtual machine migration, and compare the current proposed protection measures. While, these methods either rely on hardware, or lack adequate security and expansibility. In the end, we propose a security model of live virtual machine migration based on security policy transfer and encryption, named as SPLM (Security Protection of Live Migration) and analyze its security and reliability, which proves that SPLM is better than others. This paper can be useful for the researchers to work on this field. The security study of live virtual machine migration in this paper provides a certain reference for the research of virtualization security, and is of great significance.
虚拟机实时迁移技术作为云计算的重要支撑，已成为近年来研究的热点问题。将虚拟机的运行时环境从原来的物理服务器迁移到另一台物理服务器上，同时维护虚拟机的运行。因此，它可以在服务器之间进行负载均衡，保证服务质量。然而，由于虚拟机迁移技术发展不成熟，其安全性问题不容忽视。本文分析了虚拟机迁移的安全威胁，并对目前提出的保护措施进行了比较。然而，这些方法要么依赖于硬件，要么缺乏足够的安全性和可扩展性。最后，提出了一种基于安全策略传输和加密的实时虚拟机迁移安全模型，命名为SPLM (security Protection of live migration)，并对其安全性和可靠性进行了分析，证明了SPLM优于其他模型。本文对这一领域的研究有一定的参考价值。本文对实时虚拟机迁移的安全性研究，为虚拟化安全性的研究提供了一定的参考，具有重要的意义。
{"title":"SPLM: Security Protection of Live Virtual Machine Migration in Cloud Computing","authors":"Degang Sun, Jie Zhang, Weiping Fan, Tingting Wang, Chao Liu, Wei-qing Huang","doi":"10.1145/2898445.2898446","DOIUrl":"https://doi.org/10.1145/2898445.2898446","url":null,"abstract":"Virtual machine live migration technology, as an important support for cloud computing, has become a central issue in recent years. The virtual machines' runtime environment is migrated from the original physical server to another physical server, maintaining the virtual machines running at the same time. Therefore, it can make load balancing among servers and ensure the quality of service. However, virtual machine migration security issue cannot be ignored due to the immature development of it. This paper we analyze the security threats of the virtual machine migration, and compare the current proposed protection measures. While, these methods either rely on hardware, or lack adequate security and expansibility. In the end, we propose a security model of live virtual machine migration based on security policy transfer and encryption, named as SPLM (Security Protection of Live Migration) and analyze its security and reliability, which proves that SPLM is better than others. This paper can be useful for the researchers to work on this field. The security study of live virtual machine migration in this paper provides a certain reference for the research of virtualization security, and is of great significance.","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122537244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The wide use of cloud computing and of data outsourcing rises important concerns with regards to data security resulting thus in the necessity of protection mechanisms such as encryption of sensitive data. The recent major theoretical breakthrough of finding the Holy Grail of encryption, i.e. fully homomorphic encryption guarantees the privacy of queries and their results on encrypted data. However, there are only a few studies proposing a practical performance evaluation of the use of homomorphic encryption schemes in order to perform database queries. In this paper, we propose and analyse in the context of a secure framework for a generic database query interpreter two different methods in which client requests are dynamically executed on homomorphically encrypted data. Dynamic compilation of the requests allows to take advantage of the different optimizations performed during an off-line step on an intermediate code representation, taking the form of boolean circuits, and, moreover, to specialize the execution using runtime information. Also, for the returned encrypted results, we assess the complexity and the efficiency of the different protocols proposed in the literature in terms of overall execution time, accuracy and communication overhead.
{"title":"Dynamic Execution of Secure Queries over Homomorphic Encrypted Databases","authors":"Oana Stan, Sergiu Carpov, Renaud Sirdey","doi":"10.1145/2898445.2898454","DOIUrl":"https://doi.org/10.1145/2898445.2898454","url":null,"abstract":"The wide use of cloud computing and of data outsourcing rises important concerns with regards to data security resulting thus in the necessity of protection mechanisms such as encryption of sensitive data. The recent major theoretical breakthrough of finding the Holy Grail of encryption, i.e. fully homomorphic encryption guarantees the privacy of queries and their results on encrypted data. However, there are only a few studies proposing a practical performance evaluation of the use of homomorphic encryption schemes in order to perform database queries. In this paper, we propose and analyse in the context of a secure framework for a generic database query interpreter two different methods in which client requests are dynamically executed on homomorphically encrypted data. Dynamic compilation of the requests allows to take advantage of the different optimizations performed during an off-line step on an intermediate code representation, taking the form of boolean circuits, and, moreover, to specialize the execution using runtime information. Also, for the returned encrypted results, we assess the complexity and the efficiency of the different protocols proposed in the literature in terms of overall execution time, accuracy and communication overhead.","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125708027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this work we describe a message packing and unpacking method for homomorphic ciphertexts. Messages are packed into the coefficients of plaintext polynomials. We propose an unpacking procedure which allows to obtain a ciphertext for each packed message. The packing and unpacking of ciphertexts represents a solution for reducing the transmission bottleneck in cloud based applications, in particular when sending homomorphic calculations results. The results we obtain (packing ratio, unpacking time) are compared to existing packing methods based on trans-ciphering.
{"title":"Another Compression Method for Homomorphic Ciphertexts","authors":"Sergiu Carpov, Renaud Sirdey","doi":"10.1145/2898445.2898452","DOIUrl":"https://doi.org/10.1145/2898445.2898452","url":null,"abstract":"In this work we describe a message packing and unpacking method for homomorphic ciphertexts. Messages are packed into the coefficients of plaintext polynomials. We propose an unpacking procedure which allows to obtain a ciphertext for each packed message. The packing and unpacking of ciphertexts represents a solution for reducing the transmission bottleneck in cloud based applications, in particular when sending homomorphic calculations results. The results we obtain (packing ratio, unpacking time) are compared to existing packing methods based on trans-ciphering.","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Paper Session 1: Infrastructure Support","authors":"Cong Wang","doi":"10.1145/3247609","DOIUrl":"https://doi.org/10.1145/3247609","url":null,"abstract":"","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114348969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Since it becomes increasingly difficult to trick end users to install and run executable files from unknown sources, attackers refer to stealthy ways such as manipulation of DLL (Dynamic Link Library) files to compromise user computers. In this paper, we propose to develop mechanisms that allow the hypervisor to conduct lightweight examination of DLL files and their running environment in guest virtual machines. Different from the approaches that focus on static analysis of the DLL API calling graphs, our mechanisms conduct continuous examination of their running states. In this way, malicious manipulations to DLL files that happen after they are loaded into memory can also be detected. In order to maintain non-intrusive monitoring and reduce the impacts on VM performance, we avoid examinations of the complete DLL file contents but focus on the parameters such as the relative virtual addresses (RVA) of the functions. We have implemented our approach in Xen and conducted experiments with more than 100 malware of different types. The experiment results show that our approach can effectively detect the malware with very low increases in overhead at guest VMs.
{"title":"Lightweight Examination of DLL Environments in Virtual Machines to Detect Malware","authors":"Xiongwei Xie, Weichao Wang","doi":"10.1145/2898445.2898456","DOIUrl":"https://doi.org/10.1145/2898445.2898456","url":null,"abstract":"Since it becomes increasingly difficult to trick end users to install and run executable files from unknown sources, attackers refer to stealthy ways such as manipulation of DLL (Dynamic Link Library) files to compromise user computers. In this paper, we propose to develop mechanisms that allow the hypervisor to conduct lightweight examination of DLL files and their running environment in guest virtual machines. Different from the approaches that focus on static analysis of the DLL API calling graphs, our mechanisms conduct continuous examination of their running states. In this way, malicious manipulations to DLL files that happen after they are loaded into memory can also be detected. In order to maintain non-intrusive monitoring and reduce the impacts on VM performance, we avoid examinations of the complete DLL file contents but focus on the parameters such as the relative virtual addresses (RVA) of the functions. We have implemented our approach in Xen and conducted experiments with more than 100 malware of different types. The experiment results show that our approach can effectively detect the malware with very low increases in overhead at guest VMs.","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123012126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Keynote Address","authors":"S. Rajamani","doi":"10.1145/3247608","DOIUrl":"https://doi.org/10.1145/3247608","url":null,"abstract":"","PeriodicalId":187535,"journal":{"name":"Proceedings of the 4th ACM International Workshop on Security in Cloud Computing","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123473741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：