Proceedings of the 2013 ACM workshop on Cloud computing security workshop最新文献

CloudSweeper: enabling data-centric document management for secure cloud archives CloudSweeper:为安全的云存档启用以数据为中心的文档管理

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517495

Peter Snyder, Chris Kanich

{"title":"CloudSweeper: enabling data-centric document management for secure cloud archives","authors":"Peter Snyder, Chris Kanich","doi":"10.1145/2517488.2517495","DOIUrl":"https://doi.org/10.1145/2517488.2517495","url":null,"abstract":"Cloud based storage accounts like web email are compromised on a daily basis. At the same time, billions of Internet users store private information in these accounts. As the Internet matures and these accounts accrue more information, these accounts become a single point of failure for both users' online identities and large amounts of their private information. This paper presents two contributions: the first, the heterogeneous documents abstraction, is a data-centric strategy for protecting high value information stored in globally accessible storage. Secondly, we present drano, an implementation of the heterogeneous documents strategy as a cloud-based email protection system. drano gives users the opportunity to remove or \"lock up\" sensitive, unexpected, and rarely used information to mitigate the risks of cloud storage accounts without sacrificing the benefits of cloud storage or computation. We show that drano can efficiently assist users in pinpointing and protecting passwords emailed to them in cleartext. We present performance measurements showing that the system can rewrite past emails stored at cloud providers quickly, along with initial results regarding user preferences for redacted cloud storage.","PeriodicalId":325036,"journal":{"name":"Proceedings of the 2013 ACM workshop on Cloud computing security workshop","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114955739","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}

引用次数: 11

Session details: Cryptographic protocols 会话详细信息:加密协议

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/3249994

E. Shi

引用次数: 0

An architecture for concurrent execution of secure environments in clouds 用于在云中并发执行安全环境的体系结构

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517489

Ramya Jayaram Masti, Claudio Marforio, Srdjan Capkun

{"title":"An architecture for concurrent execution of secure environments in clouds","authors":"Ramya Jayaram Masti, Claudio Marforio, Srdjan Capkun","doi":"10.1145/2517488.2517489","DOIUrl":"https://doi.org/10.1145/2517488.2517489","url":null,"abstract":"We propose an architecture that enables the creation and management of multiple, concurrent secure execution environments on multi-core systems. Our architecture is suitable for use in cloud settings where each user may require an independent secure environment within which he can run his sensitive applications. Our solution effectively scales architectures like Intel TXT which, both on single- and multi-core platforms, support the creation of only one secure environment. Unlike existing solutions that require significant hypervisor participation, our architecture relies on light-weight processor extensions and a novel hardware-based virtualized TPM that supports multiple, concurrent dynamic root of trust requests from different VMs. This, together with the virtualization extensions in modern processors, allows the use of a disengaged hypervisor that is only responsible for VM management (i.e., creation, deletion, startup, shutdown) and is not involved in the creation or management of secure execution environments. Such disengagement not only reduces hypervisor complexity but also its interaction with guest VMs and hence, the risk of system compromise. We show that our architecture provides guest applications independent secure environments within which they can concurrently execute, and protects them against other compromised system components including malicious VMs and peripherals. We also demonstrate the feasibility of realizing our architecture by emulating and testing it using QEMU.","PeriodicalId":325036,"journal":{"name":"Proceedings of the 2013 ACM workshop on Cloud computing security workshop","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128615033","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}

引用次数: 20

Supporting complex queries and access policies for multi-user encrypted databases 支持多用户加密数据库的复杂查询和访问策略

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517492

M. R. Asghar, G. Russello, B. Crispo, Mihaela Ion

{"title":"Supporting complex queries and access policies for multi-user encrypted databases","authors":"M. R. Asghar, G. Russello, B. Crispo, Mihaela Ion","doi":"10.1145/2517488.2517492","DOIUrl":"https://doi.org/10.1145/2517488.2517492","url":null,"abstract":"Cloud computing is an emerging paradigm offering companies (virtually) unlimited data storage and computation at attractive costs. It is a cost-effective model because it does not require deployment and maintenance of any dedicated IT infrastructure. Despite its benefits, it introduces new challenges for protecting the confidentiality of the data. Sensitive data like medical records, business or governmental data cannot be stored unencrypted on the cloud. Companies need new mechanisms to control access to the outsourced data and allow users to query the encrypted data without revealing sensitive information to the cloud provider. State-of-the-art schemes do not allow complex encrypted queries over encrypted data in a multi-user setting. Instead, those are limited to keyword searches or conjunctions of keywords. This paper extends work on multi-user encrypted search schemes by supporting SQL-like encrypted queries on encrypted databases. Furthermore, we introduce access control on the data stored in the cloud, where any administrative actions (such as updating access rights or adding/deleting users) do not require re-distributing keys or re-encryption of data. Finally, we implemented our scheme and presented its performance, thus showing feasibility of our approach.","PeriodicalId":325036,"journal":{"name":"Proceedings of the 2013 ACM workshop on Cloud computing security workshop","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177153","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}

引用次数: 50

Structural cloud audits that protect private information 保护私有信息的结构化云审计

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517493

Hongda Xiao, B. Ford, J. Feigenbaum

{"title":"Structural cloud audits that protect private information","authors":"Hongda Xiao, B. Ford, J. Feigenbaum","doi":"10.1145/2517488.2517493","DOIUrl":"https://doi.org/10.1145/2517488.2517493","url":null,"abstract":"As organizations and individuals have begun to rely more and more heavily on cloud-service providers for critical tasks, cloud-service reliability has become a top priority. It is natural for cloud-service providers to use redundancy to achieve reliability. For example, a provider may replicate critical state in two data centers. If the two data centers use the same power supply, however, then a power outage will cause them to fail simultaneously; replication per se does not, therefore, enable the cloud-service provider to make strong reliability guarantees to its users. Zhai et al.[socc-submission] present a system, which they refer to as a structural-reliability auditor (SRA), that uncovers common dependencies in seemingly disjoint cloud-in-fra-struc-tu-ral components (such as the power supply in the example above) and quantifies the risks that they pose. In this paper, we focus on the need for structural-reliability auditing to be done in a privacy-preserving manner. We present a privacy-preserving structural-reliability auditor (P-SRA), discuss its privacy properties, and evaluate a prototype implementation built on the Sharemind SecreC platform[SecreC]. P-SRA is an interesting application of secure multi-party computation (SMPC), which has not often been used for graph problems. It can achieve acceptable running times even on large cloud structures by using a novel data-partitioning technique that may be useful in other applications of SMPC.","PeriodicalId":325036,"journal":{"name":"Proceedings of the 2013 ACM workshop on Cloud computing security workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116901862","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}

引用次数: 12

Beyond the ideal object: towards disclosure-resilient order-preserving encryption schemes 超越理想对象:走向具有披露弹性的保序加密方案

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517496

S. Wozniak, M. Rossberg, Sascha Grau, Ali Alshawish, G. Schäfer

{"title":"Beyond the ideal object: towards disclosure-resilient order-preserving encryption schemes","authors":"S. Wozniak, M. Rossberg, Sascha Grau, Ali Alshawish, G. Schäfer","doi":"10.1145/2517488.2517496","DOIUrl":"https://doi.org/10.1145/2517488.2517496","url":null,"abstract":"With the emergence of affordable cloud services, users are currently moving data to external services providers. Hence, they implicitly trust providers to not abuse or \"lose\" sensitive data. To protect this data in the context of cloud computing, the use of Order-Preserving Encryption (OPE) has been suggested to encrypt data while still allowing efficient queries. The reference approach builds on Order-Preserving Functions (OPFs) drawn uniformly at random: the so-called \"ideal object\". However, recent results question the suitability of this construction, as its security properties turn out to be poor. In this article, we investigate possible alternatives. For this, we introduce two descriptive metrics rating one-wayness-related properties of OPF construction schemes, i.e., the ability of an adversary to estimate the plaintext when given a ciphertext and possible extra information. Furthermore, we propose three novel approaches to draw OPFs and apply the introduced metrics to study their security features in relation to the \"ideal object\". The results visualize the extent of insecurity caused by using the \"ideal object\" and qualify the suitability of the alternative schemes under different threat scenarios.","PeriodicalId":325036,"journal":{"name":"Proceedings of the 2013 ACM workshop on Cloud computing security workshop","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070283","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}

引用次数: 17

Cloudoscopy: services discovery and topology mapping cloudscopy:服务发现和拓扑映射

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517491

A. Herzberg, Haya Schulmann, Johanna Ullrich, E. Weippl

引用次数: 28

On the (Im)possibility of privately outsourcing linear programming 论私人外包线性规划的可能性

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517490

Peeter Laud, A. Pankova

引用次数: 10

Session details: Storage 会话详细信息:

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/3249993

Srdjan Capkun

引用次数: 0

Secure pattern matching using somewhat homomorphic encryption 使用某种同态加密的安全模式匹配

Proceedings of the 2013 ACM workshop on Cloud computing security workshop Pub Date : 2013-11-08 DOI: 10.1145/2517488.2517497

Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, K. Yokoyama, Takeshi Koshiba

{"title":"Secure pattern matching using somewhat homomorphic encryption","authors":"Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, K. Yokoyama, Takeshi Koshiba","doi":"10.1145/2517488.2517497","DOIUrl":"https://doi.org/10.1145/2517488.2517497","url":null,"abstract":"The basic pattern matching problem is to find the locations where a pattern occurs in a text. Recently, secure pattern matching has been received much attention in various areas, including privacy-preserving DNA matching and secure biometric authentication. The aim of this paper is to give a practical solution for this problem using homomorphic encryption, which is public key encryption supporting some operations on encrypted data. In this paper, we make use of the somewhat homomorphic encryption scheme presented by Lauter, Naehrig and Vaikuntanathan (ACM CCSW 2011), which supports a limited number of both additions and multiplications on encrypted data. In their work, some message encoding techniques are also presented for enabling us to efficiently compute sums and products over the integers. Based on their techniques, we propose a new packing method suitable for an efficient computation of multiple Hamming distance values on encrypted data. Our main extension gives two types of packed ciphertexts, and a linear computation over packed ciphertexts gives our desired results. We implemented the scheme with our packing method. Our experiments ran in an Intel Xeon at 3.07 GHz with our software library using inline assembly language in C programs. Our optimized implementation shows that the packed encryption of a text or a pattern, the computation of multiple Hamming distance values over packed ciphertexts, and the decryption respectively take about 3.65 milliseconds (ms), 5.31 ms, and 3.47 ms for secure exact and approximate pattern matching of a binary text of length 2048. The total time is about 12.43 ms, which would give the practical performance in real life. Our method gives both faster performance and lower communication than the state-of-the-art work for a binary text of several thousand bits in length.","PeriodicalId":325036,"journal":{"name":"Proceedings of the 2013 ACM workshop on Cloud computing security workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133698052","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}

引用次数: 89