Fully homomorphic encryption in real world applications

DOI10.1007/978-981-13-6393-1MaRDI QIDQ2188373zbMATH OpenOpenAlexFDO

Authors Ayantika Chatterjee, Khin Mi Mi Aung

Publication date 10 June 2020

Published in Computer Architecture and Design Methodologies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-13-6393-1

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Searching and sorting (68P10) Database theory (68P15) Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25)

Recommendations

• Homomorphic encryption and applications
• Multikey fully homomorphic encryption and applications
• Exploring the Feasibility of Fully Homomorphic Encryption
• Somewhat/fully homomorphic encryption: implementation progresses and challenges
• Fully homomorphic encryption over the integers
• Verifiable Decryption for Fully Homomorphic Encryption
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption
• Fully homomorphic encryption for mathematicians
• Fully homomorphic encryption with relatively small key and ciphertext sizes

Cited in

(7)

• Hedging public-key encryption in the real world
• Encrypted SQL arithmetic functions processing for secure cloud database
• Encryption scheduling for remote state estimation under an operation constraint
• Protecting privacy through homomorphic encryption. Based on 6 workshops on homomorphic encryption standardization
• Lattice-based public-key cryptography in hardware
• Homomorphic encryption and applications
• Searchable Encryption

This page was built for publication: Fully homomorphic encryption in real world applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188373)