Fully Homomorphic Encryption in Real World Applications

Description

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. Front Matter ....Pages i-vii Introduction (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 1-7 Literature Survey (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 9-21 Sorting on Encrypted Data (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 23-47 Translating Algorithms to Handle Fully Homomorphic Encrypted Data (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 49-70 Secure Database Handling (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 71-86 FURISC: FHE Encrypted URISC Design (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 87-115 Conclusion and Future Work (Ayantika Chatterjee, Khin Mi Mi Aung)....Pages 117-118 Back Matter ....Pages 119-141