Implementation Combination Cryptographic Algorithm Triangle Chain Cipher and Vigenere Cipher In Securing Data in Database

Data security is most important today, because the rampant data theft resulting in a lot of misuse of data by irresponsible parties so that it makes us anxious as data owners, for data storage it is usually stored in the database. From these problems the idea emerged to create a cryptographic system where the system can secure data by encrypting and decrypting also make data fully save and then the data owned by the user. This study aims to secure the data in the database by encrypting the original data without destroying the original data when later after decrypted. To perform this security, a cryptographic methodology is used with both of method that is Vigenere Cipher and Triangle Chain Cipher algorithms which are implemented in the application because both of methodology have same root that is classical cryptographic. This application will later be used as a medium for users to secure their data in the database so that later data theft will not to be easy. After doing fully research that produces applications that can implement combination of Vigenere Cipher and Triangle Chain Cipher algorithms,data in the encrypted database field is safe because encryption has been done to the data.

P-P37 Robot assisted pancreaticojejunostomy may be associated with lower risk of post-operative pancreatic fistula in high-risk cases: Initial experience

Background Robot assisted pancreaticoduodenectomy has increased in popularity over recent years. There is evidence from high volume centers which suggests that it is associated with lower risk of post-operative pancreatic fistula than open surgery. The aims of this study were to evaluate our initial experience after robotic assisted pancreaticoduodenectomy and compare if a low volume center can produce similar positive outcomes. Methods The initial 12 patients who were listed for a robot assisted pancreaticoduodenectomy were included in the study in a consecutive manner. A standardised method of anastomosis was used in all surgeries, this being a duct-to-mucosa two-layer modified Blumgart pancreato-jejunostomy. Data was collected prospectively and stored in an encrypted database. Surgical outcomes were then analysed. Results The study included first 12 consecutive patients who underwent robotic pancreaticoduodenectomy between August 2019 and January 2020. None of the patients had clinically relevant postoperative pancreatic fistula despite 75% of the patients falling into moderate to high-risk group for fistula development. Median operative time and length of stay was 547 minutes and 8 days respectively with three Clavien Dindo grade III complications and three Clavien-Dindo grade II complications. Conclusions Robotic assisted pancreaticoduodenectomy maybe associated with lower risk of post-operative pancreatic fistula in high-risk cases.

Forward and Backward-Secure Range-Searchable Symmetric Encryption

Dynamic searchable symmetric encryption (DSSE) allows a client to query or update an outsourced encrypted database. Range queries are commonly needed. Previous range-searchable schemes either do not support updates natively (SIGMOD’16) or use file indexes of many long bit-vectors for distinct keywords, which only support toggling updates via homomorphically flipping the presence bit. (ESORICS’18). We propose a generic upgrade of any (inverted-index) DSSE to support range queries (a.k.a. range DSSE), without homomorphic encryption, and a specific instantiation with a new trade-off reducing client-side storage. Our schemes achieve forward security, an important property that mitigates file injection attacks. Moreover, we identify a variant of injection attacks against the first somewhat dynamic scheme (ESORICS’18). We also extend the definition of backward security to range DSSE and show that our schemes are compatible with a generic upgrade of backward security (CCS’17). We comprehensively analyze the computation and communication overheads, including implementation details of client-side index-related operations omitted by prior schemes. We show high empirical efficiency for million-scale databases over a million-scale keyword space.

Cryptanalysis of an encrypted database in SIGMOD '14

Encrypted database is an innovative technology proposed to solve the data confidentiality issue in cloud-based DB systems. It allows a data owner to encrypt its database before uploading it to the service provider; and it allows the service provider to execute SQL queries over the encrypted data. Most of existing encrypted databases (e.g., CryptDB in SOSP '11) do not support data interoperability: unable to process complex queries that require piping the output of one operation to another. To the best of our knowledge, SDB (SIGMOD '14) is the only encrypted database that achieves data interoperability. Unfortunately, we found SDB is not secure! In this paper, we revisit the security of SDB and propose a ciphertext-only attack named co-prime attack. It successfully attacks the common operations supported by SDB, including addition, comparison, sum, equi-join and group-by. We evaluate our attack in three real-world benchmarks. For columns that support addition and comparison , we recover 84.9% -- 99.9% plaintexts. For columns that support sum, equi-join and group-by , we recover 100% plaintexts. Besides, we provide potential countermeasures that can prevent the attacks against sum, equi-join, group-by and addition. It is still an open problem to prevent the attack against comparison.

Comparing Botulinum Toxin Injections with Extraocular Muscle Surgery in Toddlers with Esotropia: A Retrospective Analysis

Background In toddlers with esotropia, early alignment of the visual axes either with extraocular muscle surgery (EOMS) or botulinum toxin injections (BTIs) into both medial rectus muscles may result in improved depth perception. We compared the outcome of BTIs with EOMS in toddlers in order to gain further insight into the advantages and disadvantages of either method. Patients and Methods In this retrospective study, our encrypted database was searched for toddlers with esotropia aged 35 months or younger at the time of initial treatment with either BTIs or EOMS and who had a follow-up of at least 2 years. We analyzed the angle of deviation, dose effect (DE), and binocularity as well as the number of interventions. Results We identified 26 toddlers who received their first treatment for esotropia within the first 35 months of life: 16 with BTIs (9 males, 7 females) and 10 with EOMS (3 males, 7 females). Mean follow-up was considerably longer in the EOMS (87.7 months) than in the BTI group (35.7 months). Age at first intervention was 22.8 months in the BTI and 24.1 months in the EOMS group, and each toddler wore its full cycloplegic refraction. Mean angle at treatment was 41.25 prism diopters (PD) in the BTI compared to 52.9 PD in the EOMS group. The BTI group received an average of 1.68 BTIs, with a mean dosage of 14.5 IU Botox and a mean DE (mDE) of 1.8 PD/IU. In the EOMS group, the average number of surgeries was 1.4, with a mean dosage of 16.85 mm and a mDE of 3.14 PD/mm surgery. Some degree of binocularity could be observed in 9 (56%) of the BTI (5 × Bagolini positive, 2 × 550″, 2 × 220″) and in 4 (40%) of the EOMS group (2 × 3600″, 1 × 550″, 1 × 300″). By the end of the BTI group follow-up, four toddlers electively underwent EOMS rather than a 3rd BTI (followed by a 3rd BTI in 1), which resulted in the appearance of measurable binocularity in all four (1 × Bagolini positive, 1 × 220″, 1 × 200″, 1 × 60″). Conclusions Our results show that BTIs are a viable treatment alternative in early esotropia. Even if EOMS is ultimately required, some binocularity may develop as the visual axes are aligned for some time in the sensitive phase owing to the effects of Botox. Moreover, less surgical dosage is needed than would have otherwise been necessary to treat the original angle of deviation. BTIs are faster, less invasive, and present as an effective alternative when patient compliance is too low to reliably measure the angle of deviation, which is essential for the planning of EOMS.

Building enclave-native storage engines for practical encrypted databases

Data confidentiality is one of the biggest concerns that hinders enterprise customers from moving their workloads to the cloud. Thanks to the trusted execution environment (TEE), it is now feasible to build encrypted databases in the enclave that can process customers' data while keeping it confidential to the cloud. Though some enclave-based encrypted databases emerge recently, there remains a large unexplored area in between about how confidentiality can be achieved in different ways and what influences are implied by them. In this paper, we first provide a broad exploration of possible design choices in building encrypted database storage engines, rendering trade-offs in security, performance and functionality. We observe that choices on different dimensions can be independent and their combination determines the overall trade-off of the entire storage. We then propose Enclage , an encrypted storage engine that makes practical trade-offs. It adopts many enclave-native designs, such as page-level encryption, reduced enclave interaction, and hierarchical memory buffer, which offer high-level security guarantee and high performance at the same time. To make better use of the limited enclave memory, we derive the optimal page size in enclave and adopt delta decryption to access large data pages with low cost. Our experiments show that Enclage outperforms the baseline, a common storage design in many encrypted databases, by over 13x in throughput and about 5x in storage savings.

An End to End Cloud Computing Privacy Framework Using Blind Processing

Database-as-a-service (DBaaS) is a trend allowing organizations to outsource their databases and computations to external parties. However, despite the many advantages provided by this service in terms of cost reduction and efficiency, DBaaS raises many security issues regarding data privacy and access control. The protection of privacy has been addressed by several research contributions proposing efficient solutions such as encrypted databases and blind queries over encrypted data, called blind processing. In this latter context, almost all proposed schemes consider an architecture of a single user (the data owner) that requests the database server for encrypted records while he is the only one capable of decrypting. From a practical perspective, a database system is set up to support not only a single user but multiple users initiating multiple queries. However, managing various accesses to an encrypted database introduces several challenges by itself, like key sharing, key revocation, and data re-encryption. In this article, we propose a simple and efficient blind processing protocol that allows multiple users to query the same encrypted data and decrypt the retrieved results without getting access to the secret key.