Capabilities for trustworthy cloud-based computing and data storage require usable, secure and efficient solutions which allow clients to remotely store and process their data in the cloud. In this paper, we present RESeED, a tool which provides user-transparent and cloud-agnostic search over encrypted data using regular expressions without requiring cloud providers to make changes to their existing infrastructure. When a client asks RESeED to upload a new file in the cloud, RESeED analyzes the file's content and updates novel data structures accordingly, encrypting and transferring the new data to the cloud. RESeED provides regular expression search over this encrypted data by translating queries onthe-fly to finite automata and analyzes efficient and secure representations of the data before asking the cloud to download the encrypted files. We evaulate a working prototype of RESeED experimentally (currently publicly available) and show the scalability and correctness of our approach using real-world data sets from arXiv.org and the IETF. We show absolute accuracy for RESeED, with very low (6%) overhead, and high performability, even beating grep for some benchmarks.

Summary Lack of trust has become one of the main concerns of users who tend to utilize one or multiple Cloud providers. Trustworthy Cloud‐based computing and data storage require secure and efficient solutions which allow clients to remotely store and process their data in the Cloud. User‐side encryption is an established method to secure the user data on the Cloud. However, using encryption, we lose processing capabilities, such as searching, over the Cloud data. In this paper, we present RESeED, a tool that provides user‐transparent and Cloud‐agnostic regular‐expression search functionality over encrypted data across multiple Clouds. Upon a client's intent to upload a new document to the Cloud, RESeED analyzes the document's content and updates its data structures accordingly. Then, it encrypts and transfers the document to the Cloud. RESeED provides the regular‐expression search functionality over encrypted data by translating the search queries on‐the‐fly to finite automata and analyzing concise and secure representations of the data before asking the Cloud to download the encrypted documents. RESeED's parallel architecture enables efficient search over large‐scale (and potentially big data scale) data‐sets. We evaluate the performance of RESeED experimentally and demonstrate its scalability and correctness using real‐world data‐sets from arXiv.org and Internet Engineering Task Force (IETF). Our results show that RESeED produces accurate query responses with a reasonable (≃6%) storage overhead. The results also demonstrate that for many search queries, RESeED performs faster in compare with the grep utility that functions on unencrypted data. Copyright © 2017 John Wiley & Sons, Ltd.

We present RESeED, a tool that provides usertransparent and Cloud-agnostic regular expression search over encrypted data without requiring trust in the Cloud, or changes to Cloud infrastructure. Upon receiving a search query, RESeED translates it to a finite automata and analyzes efficient and secure representations of the data before asking the Cloud to download the matching encrypted files. We demonstrate and evaluate a working prototype of RESeED and show the scalability and correctness of our approach using data from arXiv.org. For more details see our Technical Report 1 .

A review was made of the entire hospital course of 20 patients aged 44 to 79 years who suddenly developed clinically intractable left-heart pump failure as a result of acute myocardial infarction. They were divided into three groups according to their presenting circulatory state. Thirteen patients were in cardiac arrest (group I), four had cardiogenic shock due to myocardial rupture (group II), and three had severe intractable left-heart failure (group III). Preoperative partial or complete cardiac catheterization was possible in six patients. Surgical treatment using cardiopulmonary bypass was selectively undertaken as a mode of therapy in 11 of the 20 cases. In 10, the area of infarction was delineated and was resected. Pathologically, the infarcts were from 1 to 14 days old, and in 19 of 20 cases involved the anterior wall. The specimens weighed 25 to 83 g. One patient, who was discharged, had infarctectomy and double coronary vein bypass graft. One patient lived for 3 weeks after infarctectomy and pulmonary embolectomy. Two others survived after surgery for 2 and 36 hours, respectively. The results of this prospective study suggest that identification of patients possibly amenable to successful treatment of medically irreversible pump failure by surgical means will require earlier recognition of the high-risk group and intensive hemodynamic and radiographic evaluation of the extent of the disease process.