DOCSLIB.ORG

Techniques and Solutions for Addressing Ransomware Attacks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Techniques and Solutions for Addressing Ransomware Attacks Ph.D. Thesis Proposal Techniques and Solutions for Addressing Ransomware Attacks Amin Kharraz College of Computer and Information Science Northeastern University Ph.D. Committee Engin Kirda Advisor, Northeastern University William Robertson Advisor, Northeastern University Manuel Egele External Member, Boston University Long Lu Northeastern University – Stony Brook University July 2017 Abstract Ransomware is a form of extortion-based attack that locks the victim’s digital resources and requests money to release them. Although the concept of ransomware is not new (i.e., such attacks date back at least as far as the 1980s), this type of malware has recently experienced a resurgence in popularity. In fact, over the last few years, a number of high-profile ransomware attacks were reported. Very recently, WannaCry ransomware infected thousands of vulnerable machines around the world, and substantially disrupted critical services such as British healthcare system. Given the size and variety of threats we are facing today, having solutions to effectively detect and analyze unknown ransomware attacks seems necessary. In this thesis, we argue that it is possible to extend existing defense mechanisms, and protect user data from a large number of ransomware attacks with zero data loss. To support this claim, in the first part of the thesis, we perform an evolutionary-based analysis to understand the destructive behavior of ransomware attacks. We show that by monitoring the interaction of malicious processes with the operating system, it is possible to design practical defense mechanisms that could stop even very successful cryptographic ransomware attacks. In the second part, we propose a novel dynamic analysis system, called Unveil, that is designed to analyze ransomware attacks, and model their interactions. In the third and the last part, we propose an end-point framework, called Redemption, to protect user data from ransomware attacks. We present an operating system-independent design, and also provide implementation details which show that such lightweight solutions could be integrated into existing operating systems while achieving zero data loss in a large number of successful ransomware attacks. Contents 1 Introduction 1 1.1 Focus of this Work . 2 1.2 Related Work . 3 2 An Analysis on Current Ransomware Attacks 4 2.1 Ransomware Dataset . 4 2.2 Developing the Monitoring Tool . 5 2.3 Characterization and Evolution . 6 3 A Dynamic Analysis Approach to Detecting Ransomware 6 3.1 System Design . 7 3.2 Analysis and Findings . 10 3.3 Detecting Zero-Day Ransomware . 12 4 Protecting End-Points from Ransomware Attacks 14 4.1 System Design . 15 4.2 Dataset . 16 4.3 Analysis on Labeled Data . 16 5 Future Work and Timeline 18 5.1 Evaluating the Redemption Prototype . 18 5.2 Timeline . 18 II 1 Introduction Malware attacks continue to remain one of the most popular attack vectors in the wild [60, 47]. Among all classes of malware, ransomware has recently become very popular among malware au- thors [9, 16, 20, 26]. Ransomware is a kind of scareware that locks the victims’ computers until they make a payment to re-gain access to their data. In fact, this class of malware is not a new concept (such attacks have been in the wild since the last decade), but the growing number of high- profile ransomware attacks has resulted in increasing concerns on how to defend against this class of malware. In 2016, several public and private sectors, including the healthcare industry, were impacted by ransomware [13, 10, 66]. Lately, US officials have also expressed their concerns about ran- somware [23, 30], and even asked the U.S. government to focus on fighting ransomware under the Cybersecurity National Action Plan [30]. Very recently, WannaCry ransomware, the most re- cent successful ransomware attack, impacted thousands of users around the world by exploiting the EternalBlue vulnerability, encrypting user data, and demanding bitcoin payments in exchange for unlocking files [48]. In response to the increasing number of ransomware attacks, users are often advised to create backups of their critical data. Certainly, having a reliable data backup policy minimizes the potential costs of being infected with ransomware, and is an important part of the IT management process. However, the growing number of paying victims [11, 51, 24] suggests that technically unsophisticated users – who are the main target of these attacks – do not follow these recommendations, and easily become a paying victim of ransomware. Hence, ransomware authors continue to create new attacks and evolve their creations as evidenced by the emergence of more sophisticated ransomware every day [62, 8, 60, 53]. Unfortunately, many of the recent security reports about ransomware [19, 31, 32, 60, 61, 47] mainly focus on the advancements in ransomware attacks and their levels of sophistication, rather than providing some insights about effective defense techniques that should be adopted against this threat. Furthermore, the current defense mechanisms to detect, analyze, and defend against ransomware are not very different from the ones that are used to detect other types of evasive malware. Perhaps, the main assumption here is that this class of malware employs all possible evasion techniques, similar to other classes of malware, to bypass detection tools, reach end-users, and successfully launch attacks. While we agree that this is a valid assumption, we claim that these mechanisms cannot lead to the best defense mechanisms against ransomware, as evidenced by the increasing number of very successful ransomware attacks in the wild. 1 1.1 Focus of this Work In this thesis, we investigate the feasibility of developing solutions to detect and analyze ransomware attacks. In fact, the thesis of this dissertation is that, unlike other malware, the nature of ransomware attacks is not very broad, and protecting against a large number of ransomware attacks is possible. We argue that ransomware attacks follow very similar patterns in order to be successful and force victims to pay the ransom fee. For example, unlike other classes of malware that aims to be stealthy to collect banking credentials or keystrokes without raising suspicion, ransomware notifies victims that they are infected. Moreover, a successful ransomware usually needs to prevent user’s access to his own data by performing encryption and/or deletion operations, and repeating these destructive actions during an attack. This thesis aims to show that if we use these insights in the defense side, and accurately model these behaviors, we can reliably detect a significant number of ransomware attacks in the wild. In the first part of this thesis, we perform an evolutionary-based analysis on ransomware attacks to understand the main characteristics of these attacks. This work is motivated by our need to study the core functionalities of these attacks from a filesystem perspective. To this end, we created a dataset of ransomware samples that covers the majority of the existing ransomware families which have been observed in the wild. We design and implement a kernel level module to closely monitor the interaction of user mode processes with the filesystem. Our analysis shows that different classes of ransomware attacks with multiple levels of sophistication share very similar characteristics from a filesystem perspective due to the nature of these attacks. In the second part of this thesis, we present a novel dynamic analysis system, called Unveil, that is designed to analyze ransomware attacks and model their behaviors. In our approach, the system automatically creates an artificial, realistic execution environment and monitors how ransomware interacts with that environment. We evaluate Unveil using more than 148,000 distinct samples belonging to different malware families. The evaluation of Unveil shows that our approach was able to correctly detect 13,637 ransomware samples from multiple ransomware families in a real- world data feed with zero false positives. Our analysis shows that Unveil can significantly enhance the current anti-malware solutions with regard to ransomware. In the third part of the thesis, we investigate the possibility of protecting user data from ran- somware attacks at end-hosts with zero data loss. To this end, we propose a general framework, called Redemption, to augment the operating system with ransomware protection capabilities. Re- demption does not require performing any significant changes in the semantics of the underlying filesystem functionality, or modifying the architecture of the operating systems. 2 1.2 Related Work Malware attacks are important problems. They have been extensively investigated in security re- search over the last couple of years. For example, a number of approaches have been proposed to describe program behavior from analyzing byte patterns [42, 59, 57, 67] to transparently running programs in malware analysis systems [6, 36, 35, 63]. Early steps to analyze and capture the main intent of a program focused on analysis of control flow. Kruegel et al. [40] and Bruschi et al. [14] showed that by modeling programs based on their instruction-level control flow, it is possible to bypass some forms of obfuscation. Similarly, Christodorescu et al. [18] used instruction-level control flow to design obfuscation-resilient detection systems. Later work focused on analyzing and detect- ing malware using higher-level semantic characterizations of their runtime behavior derived from sequences of system call invocations and OS resource accesses [37, 38, 17, 46, 58, 68]. In order to analyze the malicious behavior of malware samples, dynamic analysis tools have be- come popular over the last few years. Most of these techniques depend on extracting system calls or Windows API call traces using sandboxing techniques. For example, CWSandbox [65] and Norman Sandbox [5] trace API calls, while Anubis [12] and Panorama [68] are examples of emulation-based malware analysis systems that can perform data-flow analysis. More recently, BareCloud [36] has been proposed which is a bare-metal analysis system to detect evasive malware samples.
Load more

Recommended publications
  • The First Collision for Full SHA-1
    The first collision for full SHA-1 Marc Stevens1, Elie Bursztein2, Pierre Karpman1, Ange Albertini2, Yarik Markov2 1 CWI Amsterdam 2 Google Research [email protected] https://shattered.io Abstract. SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoretical attacks. Despite its deprecation, SHA-1 remains widely used in 2017 for document and TLS certificate signatures, and also in many software such as the GIT versioning system for integrity and backup purposes. A key reason behind the reluctance of many industry players to replace SHA-1 with a safer alternative is the fact that finding an actual collision has seemed to be impractical for the past eleven years due to the high complexity and computational cost of the attack. In this paper, we demonstrate that SHA-1 collision attacks have finally become practical by providing the first known instance of a collision. Furthermore, the prefix of the colliding messages was carefully chosen so that they allow an attacker to forge two PDF documents with the same SHA-1 hash yet that display arbitrarily-chosen distinct visual contents. We were able to find this collision by combining many special cryptanalytic techniques in complex ways and improving upon previous work. In total the computational effort spent is equivalent to 263:1 SHA-1 compressions and took approximately 6 500 CPU years and 100 GPU years. As a result while the computational power spent on this collision is larger than other public cryptanalytic computations, it is still more than 100 000 times faster than a brute force search.
    [Show full text]
  • FPGA Parallel-Pipelined AES-GCM Core for 100G Ethernet Applications
    FPGA Parallel-Pipelined AES-GCM Core for 100G Ethernet Applications Luca Henzen and Wolfgang Fichtner Integrated Systems Laboratory, ETH Zurich, Switzerland E-mail: {henzen, fw}@iis.ee.ethz.ch Abstract—The forthcoming IEEE 802.3ba Ethernet standard Exploiting the parallelization of four cores plus the extensive will provide data transmission at a bandwidth of 100 Gbit/s. Cur- utilization of pipelining, we were able to design three different rently, the fastest cryptographic primitive approved by the U.S. National Institute for Standard and Technology, that combines 100G AES-GCM implementations for Xilinx Virtex-5 FPGAs. data encryption and authentication, is the Galois/Counter Mode (GCM) of operation. If the feasibility to increase the speed of the II. GCM AUTHENTICATED ENCRYPTION GCM up to 100 Gbit/s on ASIC technologies has already been The GCM is a block cipher mode of operation that is demonstrated, the FPGA implementation of the GCM in secure able to encrypt or decrypt data, providing at the same time 100G Ethernet network systems arises some important structural issues. In this paper, we report on an efficient FPGA architecture authentication and data integrity . In practice, it combines a of the GCM combined with the AES block cipher. With the block cipher in the counter mode with universal hashing over parallelization of four pipelined AES-GCM cores we were able the binary field GF(2128). In this work, we used the Advanced to reach the speed required by the new Ethernet standard. Encryption Standard (AES) [4] for encryption and decryption, Furthermore, the time-critical binary field multiplication of the authentication process relies on four pipelined 2-step Karatsuba- supporting key sizes of 128, 192 and 256bits.
    [Show full text]
  • Julius: Secure Mode of Operation for Authenticated Encryption Based on ECB and Finite Field Multiplications
    Julius: Secure Mode of Operation for Authenticated Encryption Based on ECB and Finite Field Multiplications Lear Bahack∗ Submission to the CAESAR competition, version 1.0, March 2014 Gaius Julius Caesar, 100 BC – 44 BC. Source: Mcleclat, GNU, Creative Commons via Wikimedia Commons. ∗Weizmann Institute of Science, Rehovot, Israel. E-mail: [email protected] 1 Abstract We present two new blockcipher modes of operation for authenti- cated encryption with associated data, designed to achieve the maxi- mal possible security in case of misused IV, while being efficient as the Galois/Counter Mode (GCM). Both of the modes are provably secure up to the birthday bound, are suitable for both software and hard- ware, and are based on GF(2128) multiplications by a secret element of the field. The Julius-CTR mode can be viewed as a certain variation combin- ing the GCM, SIV and Unbalanced Feistel Network, while the Julius- ECB mode can be viewed as a certain variation of the Naor-Reingold mode. We specify two versions for each mode: a regular version and a compact version, having different ciphertexts redundancies. Sev- eral variants aimed to achieve increased security, parallelization, and efficiency are briefly explored. Based on the two Julius modes of operation and the AES-128 block- cipher, we propose a family of four specific algorithms for authenti- cated encryption with associated data to the CAESAR competition. 1 Introduction Symmetric key authenticated encryption (AE) is in a sense the most basic and fundamental usage of cryptography. Although today’s cryptography is far broader and contains complicated algorithms aiming to achieve other (more complicated) goals, the vast majority of applications use "compli- cated" cryptographic algorithms only in addition to a "basic" symmetric key AE algorithm.
    [Show full text]
  • Algebraic Frameworks for Cryptographic Primitives
    Algebraic Frameworks for Cryptographic Primitives by Navid Alamati A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Science and Engineering) in the University of Michigan 2020 Doctoral Committee: Associate Professor Chris Peikert, Chair Professor Jeffrey Lagarias Professor Quentin Stout Professor Martin Strauss “It must be admitted that the use of geometric intuition has no logical necessity in mathematics, and is often left out of the formal presentation of results. If one had to construct a mathematical brain, one would probably use resources more efficiently than creating a visual system. But the system is there already, it is used to great advantage by human mathematicians, and it gives a special flavor to human mathematics.” David Ruelle [Conversations on Mathematics with a Visitor from Outer Space, 1998] Navid Alamati [email protected] ORCID iD: 0000-0001-8621-7486 2020 Acknowledgments Undoubtedly, I was more than fortunate to be advised by Chris Peikert. He has guided me during the past five years with unwavering patience and unparalleled percipience. No words can adequately describe my appreciation for him. I thank the other members of the committee—Jeffrey Lagarias, Quentin Stout, and Martin Strauss. I was lucky to be interned twice at Fujitsu Labs of America, during which I have had the chance of working with wonderful researchers—Arnab Roy, Hart Montgomery, and Sikhar Patranabis. I am grateful to Hart and Sikhar for the innumerable hours of discussion and the countless moments of wonder through which I tried to do research in cryptography. I am also thankful to Luca De Feo for being a great companion for an attempt on isogenies for dummies, one of whom has written this thesis.
    [Show full text]
  • Cryptographic Sponge Functions
    Cryptographic sponge functions Guido B1 Joan D1 Michaël P2 Gilles V A1 http://sponge.noekeon.org/ Version 0.1 1STMicroelectronics January 14, 2011 2NXP Semiconductors Cryptographic sponge functions 2 / 93 Contents 1 Introduction 7 1.1 Roots .......................................... 7 1.2 The sponge construction ............................... 8 1.3 Sponge as a reference of security claims ...................... 8 1.4 Sponge as a design tool ................................ 9 1.5 Sponge as a versatile cryptographic primitive ................... 9 1.6 Structure of this document .............................. 10 2 Definitions 11 2.1 Conventions and notation .............................. 11 2.1.1 Bitstrings .................................... 11 2.1.2 Padding rules ................................. 11 2.1.3 Random oracles, transformations and permutations ........... 12 2.2 The sponge construction ............................... 12 2.3 The duplex construction ............................... 13 2.4 Auxiliary functions .................................. 15 2.4.1 The absorbing function and path ...................... 15 2.4.2 The squeezing function ........................... 16 2.5 Primary aacks on a sponge function ........................ 16 3 Sponge applications 19 3.1 Basic techniques .................................... 19 3.1.1 Domain separation .............................. 19 3.1.2 Keying ..................................... 20 3.1.3 State precomputation ............................ 20 3.2 Modes of use of sponge functions .........................
    [Show full text]
  • A Matter of Security, Privacy and Trust
    A matter of security, privacy and trust: A study of the principles and values of encryption in New Zealand Michael Dizon Ryan Ko Wayne Rumbles Patricia Gonzalez Philip McHugh Anthony Meehan Acknowledgements This study was funded by grants from the New Zealand Law Foundation and the University of Waikato. We would like to express our gratitude to our project collaborators and members of the Advisory Board – Prof Bert-Jaap Koops (Tilburg University), Prof Lyria Bennett Moses (UNSW Sydney), Prof Alana Maurushat (Western Sydney University), and Associate Professor Alex Sims (University of Auckland) – for their support as well as feedback on specific parts of this report. We would also like to thank Patricia Gonzalez, Joseph Graddy, Philip McHugh, Anthony Meehan, Jean Murray and Peter Upson for their valuable research assistance and other contributions to this study. Michael Dizon, Ryan Ko and Wayne Rumbles Principal investigators December 2019 Executive summary Cybersecurity is crucial for ensuring the safety and well-being of the general public, businesses, government, and the country as a whole. New Zealand has a reasonably comprehensive and well-grounded legal regime and strategy for dealing with cybersecurity matters. However, there is one area that deserves further attention and discussion – encryption. Encryption is at the heart of and underpins many of the technologies and technical processes used for computer and network security, but current laws and policies do not expressly cover this significant technology. The principal objective of this study is to identify the principles and values of encryption in New Zealand with a view to informing future developments of encryption- related laws and policies.
    [Show full text]
  • Chapter 1. Introducing Cryptography and ICSF
    z/OS Version 2 Release 3 Cryptographic Services Integrated Cryptographic Service Facility Overview IBM SC14-7505-06 Note Before using this information and the product it supports, read the information in “Notices” on page 83. This edition applies to ICSF FMID HCR77C0 and Version 2 Release 3 of z/OS (5650-ZOS) and to all subsequent releases and modifications until otherwise indicated in new editions. Last updated: 2019-06-24 © Copyright International Business Machines Corporation 1996, 2019. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Figures................................................................................................................ vii Tables.................................................................................................................. ix About this information.......................................................................................... xi ICSF features............................................................................................................................................... xi Who should use this information................................................................................................................ xi How to use this information........................................................................................................................ xi Where to find more information.................................................................................................................xii
    [Show full text]
  • Securing Audio Using AES-Based Authenticated Encryption with Python
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 9 August 2021 doi:10.20944/preprints202108.0185.v1 Article Securing Audio Using AES-based Authenticated Encryption with Python Jessy Ayala 1 1 New York University, Tandon School of Engineering; [email protected] Featured Application: Securing communication of audio files utilizing symmetric authenticated encryption. Abstract: The focus of this research is to analyze the results of encrypting audio using various au- thenticated encryption algorithms implemented in the Python cryptography library for ensuring authenticity and confidentiality of the original contents. The Advanced Encryption Standard (AES) is used as the underlying cryptographic primitive in conjunction with various modes including Gal- ois Counter Mode (GCM), Counter with Cipher Block Chaining Message Authentication Code (CCM), and Cipher Block Chaining (CBC) with Keyed-Hashing for encrypting a relatively small audio file. The resulting encrypted audio shows similarity in the variance when encrypting using AES-GCM and AES-CCM. There is a noticeable reduction in variance of the performed encodings and an increase in the amount of time it takes to encrypt and decrypt the same audio file using AES- CBC with Keyed-Hashing. In addition, the corresponding encrypted using this mode audio spans a longer duration. As a result, AES should either have GCM or CCM for an efficient and reliable authenticated encryption integration within a workflow. Keywords: AES; Audio analysis; Authenticated encryption; Cryptography; Python 1. Introduction Cryptography is used worldwide for adhering to the security CIA triad: confidenti- ality, integrity, and availability. In an environment where mobile devices have become ubiquitous, voice messages are more common than one may think.
    [Show full text]
  • Performance Analysis of Cryptographic Hash Functions Suitable for Use in Blockchain
    I. J. Computer Network and Information Security, 2021, 2, 1-15 Published Online April 2021 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis.2021.02.01 Performance Analysis of Cryptographic Hash Functions Suitable for Use in Blockchain Alexandr Kuznetsov1 , Inna Oleshko2, Vladyslav Tymchenko3, Konstantin Lisitsky4, Mariia Rodinko5 and Andrii Kolhatin6 1,3,4,5,6 V. N. Karazin Kharkiv National University, Svobody sq., 4, Kharkiv, 61022, Ukraine E-mail: [email protected], [email protected], [email protected], [email protected], [email protected] 2 Kharkiv National University of Radio Electronics, Nauky Ave. 14, Kharkiv, 61166, Ukraine E-mail: [email protected] Received: 30 June 2020; Accepted: 21 October 2020; Published: 08 April 2021 Abstract: A blockchain, or in other words a chain of transaction blocks, is a distributed database that maintains an ordered chain of blocks that reliably connect the information contained in them. Copies of chain blocks are usually stored on multiple computers and synchronized in accordance with the rules of building a chain of blocks, which provides secure and change-resistant storage of information. To build linked lists of blocks hashing is used. Hashing is a special cryptographic primitive that provides one-way, resistance to collisions and search for prototypes computation of hash value (hash or message digest). In this paper a comparative analysis of the performance of hashing algorithms that can be used in modern decentralized blockchain networks are conducted. Specifically, the hash performance on different desktop systems, the number of cycles per byte (Cycles/byte), the amount of hashed message per second (MB/s) and the hash rate (KHash/s) are investigated.
    [Show full text]
  • Analysis of Key Management in Matrix
    Bachelor thesis Computing Science Radboud University Analysis of key management in Matrix Author: First supervisor/assessor: Floris Hendriks Prof. J.J.C. Daemen s4749294 [email protected] Second supervisor: Dr. B.J.M. Mennink [email protected] Second assessor: Dr. C.E. Dobraunig [email protected] January 17, 2020 Abstract This thesis presents an analysis of Matrix’s key management. Matrix is an end-to-end encrypted and decentralised application layer proto- col, developed by The Matrix.org Foundation C.I.C. The protocol is used, among other applications, to end-to-end encrypt messages in a decen- tralised chat system. To date, Matrix is not equipped with a clear and well-described overview on how keys enable end-to-end encryption in a decentralised network. This thesis therefore describes how keys in Ma- trix are established, used, stored, exchanged and verified. Moreover, the analysis also explores the limitations of Matrix’s key management and potential improvements. Contents 1 Introduction3 1.1 Research questions........................5 1.2 Structure..............................6 2 Preliminaries7 2.1 Data formats used in Matrix...................7 2.2 Security principles........................8 2.2.1 Forward secrecy......................8 2.2.2 Backward secrecy.....................8 2.2.3 Deniability.........................8 2.2.4 Confidentiality.......................8 2.2.5 Integrity..........................9 2.2.6 Authentication.......................9 2.3 Cryptographic primitives used in Matrix............9 2.3.1 Cryptographic hash functions..............9 2.3.2 HMAC............................9 2.3.3 HKDF............................ 10 2.3.4 Cryptographic ratchets.................. 10 2.3.5 Curve25519........................ 11 2.3.6 EdDSA and Ed25519..................
    [Show full text]
  • School of Electrical Engineering & Computer Science Oregon State
    The Joy of Cryptography Mike Rosulek [email protected] School of Electrical Engineering & Computer Science Oregon State University, Corvallis, Oregon, USA Draft of January 3, 2021 > Preface The Joy of Cryptography is an undergraduate textbook in cryptography. This book evolved from lecture notes I developed for the cs427 course at Oregon State University (and before that, cs473 at the University of Montana). Yes, I know that the title is ridiculous. All of the serious titles were already taken. I hope you understand that actual joy is not guaranteed. What Is This Book About? This book is about the fundamentals of provable security. I Security: Cryptography is about controlling access to information. We break apart the nebulous concept of “security” into more specic goals: condentiality, authen- ticity, integrity. I Provable: We can formally dene what it means to be secure, and then mathemat- ically prove claims about security. One prominent theme in the book is the logic of composing building blocks together in secure ways. I Fundamentals: This is an introductory book on the subject that covers the basics. After completing this course, you will have a solid theoretical foundation that you can apply to most real-world situations. You will also be equipped to study more advanced topics in cryptography. This book is not a handbook telling you which cryptographic algorithm to use in every situation, nor a guide for securely implementing production-ready cryptographic libraries. We do not discuss specic cryptographic software (e.g., PGP, Tor, Signal, TrueCrypt) or cryptocurrencies like Bitcoin. You won’t learn how to become a hacker by reading this book.
    [Show full text]
  • Regeldokument
    REDUCED VECTOR TECHNIQUE HOMOMORPHIC ENCRYPTION WITH VERSORS A SURVEY AND A PROPOSED APPROACH by SUNEETHA TEDLA B.Sc, Osmania University, India 1993 M.C.A, Osmania University, India 1998 A dissertation submitted to the Graduate Faculty of the University of Colorado Colorado Springs in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Computer Science 2019 © 2019 SUNEETHA TEDLA ALL RIGHTS RESERVED ii This dissertation for the Doctor of Philosophy degree by Suneetha Tedla has been approved for the Department of Computer Science by Carlos Araujo, Co-Chair C. Edward Chow, Co-Chair T.S. Kalkur Jonathan Ventura Yanyan Zhuang Date: 3 May 2019 iii Tedla, Suneetha (Ph.D., Security) Reduced Vector Technique Homomorphic Encryption with Versors A Survey and a Proposed Approach Dissertation directed by Professors Carols Araujo and C. Edward Chow ABSTRACT In this research, a new type of homomorphic encryption technique, based on geometric algebra and versors, called Reduced Vector Technique Homomorphic Encryption (RVTHE) is designed, developed and analyzed. This new cipher method is optimized to be faster and compact in cipher length while preserving the security strength. Performance criteria are proposed to generate benchmarks to evaluate the homomorphic encryption for a fair comparison to benchmarks used for non-homomorphic encryption. The basic premise behind these performance criteria is to establish the understanding of the baseline to measure the variations of performance between different encryption methods for Cloud Storage type Solid State Drives (SSDs). Significant differences in throughput performances, up to 20-50% decreases, are observed among encryption software methods on Cloud storage SSD or encrypted SSDs.
    [Show full text]