Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben

2019 | Buch

Introduction Kapitel lesen Erstes Kapitel lesen

Fully Homomorphic Encryption in Real World Applications

verfasst von: Dr. Ayantika Chatterjee, Dr. Khin Mi Mi Aung

Verlag: Springer Singapore

Buchreihe : Computer Architecture and Design Methodologies

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten
insite
SUCHEN

Über dieses Buch

This book explores the latest developments in fully homomorphic encryption (FHE), an effective means of performing arbitrary operations on encrypted data before storing it in the ‘cloud’. The book begins by addressing perennial problems like sorting and searching through FHE data, followed by a detailed discussion of the basic components of any algorithm and adapting them to handle FHE data. In turn, the book focuses on algorithms in both non-recursive and recursive versions and discusses their realizations and challenges while operating in the FHE domain on existing unencrypted processors. It highlights potential complications and proposes solutions for encrypted database design with complex queries, including the basic design details of an encrypted processor architecture to support FHE operations in real-world applications.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Introduction
Abstract
This is the era of communication and data sharing, which requires secure and confidential transactions. Cryptography is the science that concerns the maintenance and analysis of security, which allows authorized access to information. Cloud computing is one of the new applications, where cryptography is expected to unveil its power to provide desired security solutions. In particular, fully homomorphic encryption (FHE) is one of the main pillars to exploit the complete advantages of cloud computing.
Ayantika Chatterjee, Khin Mi Mi Aung
Chapter 2. Literature Survey
Abstract
Fully homomorphic encryption (FHE) scheme enables computation of arbitrary functions on encrypted data, hence considered as “holy grail” of modern cryptography. This chapter presents the relevance of FHE in present day cloud computing, a brief history of different homomorphic encryption schemes and formally defines fully homomorphic encryption along with basic idea behind Gentry’s construction. Gradually, few recent works will be described in this area those are proposed following Gentry’s scheme but with simpler constructions and better efficiency.
Ayantika Chatterjee, Khin Mi Mi Aung
Chapter 3. Sorting on Encrypted Data
Abstract
Sorting is an age old problem of rearrangement. Since arrangement of items has profound influence on speed and simplicity of algorithms, sorting has attracted great deal of importance in computer science literature. Recently with the advent of cloud computing we revisit problem of sorting on encrypted data. Sorting network consists of comparators and swapping operations. The difference between classical comparison-based sorting algorithms and sorting networks on encrypted inputs are discussed in this chapter. The interesting fact for encrypted domain is that all operations must be data independent in the flow of the algorithm steps in sorting networks. Hence, in spite of the fact that data dependent algorithms may be faster, they may not suitable for encrypted data.
Ayantika Chatterjee, Khin Mi Mi Aung
Chapter 4. Translating Algorithms to Handle Fully Homomorphic Encrypted Data
Abstract
An algorithm is defined as a self-contained step-by-step set of operations to be performed to solve a particular problem. The concept of simplicity and elegance related to any algorithm informally appears in Knuth’s saying “\(\ldots \) we want good algorithms in some loosely defined aesthetic sense. One criterion is the length of time taken to perform the algorithm... Other criteria are adaptability of the algorithm to computers...” In this chapter, we discuss how to develop suitable synthesis techniques and methodologies to handle algorithms which operate on encrypted data and to be executed on underlying unencrypted processor.
Ayantika Chatterjee, Khin Mi Mi Aung
Chapter 5. Secure Database Handling
Abstract
Onset of cloud computing allowed various IT services to be outsourced to cloud service providers (CSP). This includes the management and storage of users’ structured or unstructured data called Database as a Service (DBaaS). However, users need to trust the CSP to protect their data, which is inherent in all cloud-based services. Enterprises and Small-to-Medium Businesses (SMB) see this as a roadblock in adopting cloud services because they do not have full control of the security of the stored data on the cloud. Due to these security issues, one possible solution for the data owners is to store their sensitive data in encrypted form. However, to take full advantage of cloud database as service, FHE enabled SQL processing is a promising solution, which will be elaborated in this chapter.
Ayantika Chatterjee, Khin Mi Mi Aung
Chapter 6. FURISC: FHE Encrypted URISC Design
Abstract
As stated by Gosser, “ Securing a computer system has traditionally been a battle of wits: the penetrator tries to find the holes, and the designer tries to close them”. Hence, for any secure program execution, the instruction flow should also be encrypted. However, finding suitable solution to determine the termination point of any encrypted program is still an open challenge. Encrypted termination requires handling of encrypted condition, which is infeasible by existing unencrypted processors. Thus, for outsourcing computations and achieving privacy, designs of processors which operate on encrypted data as well as address are extremely important. This chapter provides some insight on this issue.
Ayantika Chatterjee, Khin Mi Mi Aung
Chapter 7. Conclusion and Future Work
Abstract
In this book, we have analyzed the prospect of realizing practical algorithms while working on FHE data. In this regard, we briefly reiterate our main contributions in this chapter.
Ayantika Chatterjee, Khin Mi Mi Aung
Backmatter
Metadaten
Titel
Fully Homomorphic Encryption in Real World Applications
verfasst von
Dr. Ayantika Chatterjee
Dr. Khin Mi Mi Aung
Copyright-Jahr
2019
Verlag
Springer Singapore
Electronic ISBN
978-981-13-6393-1
Print ISBN
978-981-13-6392-4
DOI
https://doi.org/10.1007/978-981-13-6393-1

Neuer Inhalt

    Bildnachweise