Skip to main content
SpringerLink
Log in

Partially Homomorphic Encryption

  • Book
  • © 2021

Overview

Authors:
  1. Çetin Kaya Koç

    1. Dept. of Computer Science, University of California, Santa Barbara, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Funda Özdemir

    1. Faculty of Engineering and Natural Sciences, Istinye University, Istanbul, Turkey

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Zeynep Ödemiş Özger

    1. Faculty of Engineering and Architecture, Kâtip Çelebi University, İzmir, Turkey

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Applies a unified mathematical notation
  • Algorithms can be applied to private computation problems in healthcare, finance and national security
  • Researchers have addressed issues related to these algorithms' formulation, arithmetic, efficiency and security

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Introduction

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 1-2

  3. Mathematical Background

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 3-36

  4. Rivest-Shamir-Adleman Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 37-41

  5. Goldwasser-Micali Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 43-49

  6. ElGamal Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 51-62

  7. Benaloh Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 63-69

  8. Naccache-Stern Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 71-82

  9. Okamoto-Uchiyama Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 83-93

  10. Paillier Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 95-105

  11. Damgård-Jurik Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 107-121

  12. Boneh-Goh-Nissim Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 123-133

  13. Sander-Young-Yung Algorithm

    • Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
    Pages 135-140

  14. Back Matter

    Pages 141-146
    Download chapter PDF
Back to top

Keywords

About this book

This monograph describes and implements partially homomorphic encryption functions using a unified notation. After introducing the appropriate mathematical background, the authors offer a systematic examination of the following known algorithms: Rivest-Shamir-Adleman; Goldwasser-Micali; ElGamal; Benaloh; Naccache-Stern; Okamoto-Uchiyama; Paillier; Damgaard-Jurik; Boneh-Goh-Nissim; and Sander-Young-Yung.

Over recent years partially and fully homomorphic encryption algorithms have been proposed and researchers have addressed issues related to their formulation, arithmetic, efficiency and security. Formidable efficiency barriers remain, but we now have a variety of algorithms that can be applied to various private computation problems in healthcare, finance and national security, and studying these functions may help us to understand the difficulties ahead.


The book is valuable for researchers and graduate students in Computer Science, Engineering, and Mathematics who are engaged with Cryptology.


Reviews

“This book shows that it is always enjoyable to learn interesting algorithms and their underlying beautiful mathematics.” (Ioan Tomescu, zbMATH 0741.4774, 2021)

Authors and Affiliations

  • Dept. of Computer Science, University of California, Santa Barbara, USA

    Çetin Kaya Koç

  • Faculty of Engineering and Natural Sciences, Istinye University, Istanbul, Turkey

    Funda Özdemir

  • Faculty of Engineering and Architecture, Kâtip Çelebi University, İzmir, Turkey

    Zeynep Ödemiş Özger

Bibliographic Information

  • Book Title: Partially Homomorphic Encryption

  • Authors: Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger

  • DOI: https://doi.org/10.1007/978-3-030-87629-6

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer Nature Switzerland AG 2021

  • Hardcover ISBN: 978-3-030-87628-9Published: 30 September 2021

  • Softcover ISBN: 978-3-030-87631-9Published: 01 October 2022

  • eBook ISBN: 978-3-030-87629-6Published: 29 September 2021

  • Edition Number: 1

  • Number of Pages: X, 146

  • Topics: Cryptology, Systems and Data Security, Number Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation