Skip to main content
SpringerLink
Log in

Homomorphe Verschlüsselung

  • Chapter
  • First Online:
Grundlagen der Kryptographie

  • 476 Accesses

Zusammenfassung

Kurz nach dem ursprünglichen RSA-Papier [1] stellten Rivest, Adleman und Dertouzos eine Frage [2]: Wäre es möglich, eine Datenbank mit verschlüsselten Informationen (wie Finanz- oder Gesundheitsdaten) zu haben, die an einem externen Ort gespeichert sind, die dennoch Berechnungen an den verschlüsselten Daten ohne deren Entschlüsselung ermöglichen würde? Dies würde beispielsweise eine externe Speicherung und Berechnung an den verschlüsselten Daten an der externen Stelle ermöglichen, ohne dass der Eigentümer oder Betreiber der externen Stelle vertraut werden muss.\(\mathbb {R}^{3}\)

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

Access this chapter

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Literatur

  1. R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 120–126 (1978)

    Google Scholar 

  2. R.L. Rivest, L. Adleman, M. Dertouzos, On data banks and privacy homo-morphisms. Foundations of Secure Computation 169–180 (1978)

    Google Scholar 

  3. C. Gentry, A fully homomorphic encryption scheme, Ph.D. thesis (Stanford University, 2009)

    Google Scholar 

  4. C. Gentry, Fully homomorphic encryption using ideal lattices, in Symposium on the Theory of Computing (STOC ’09), Hrsg. von M. Mitzenmacher (2009), S. 169–178

    Google Scholar 

  5. C. Gentry, Toward basing fully homomorphic encryption on worst-case hardness, in Advances in cryptology – CRYPTO 2010, Bd. 6223, Lecture notes in computer science, Hrsg. von T. Rabin (2010), S. 116–137

    Google Scholar 

  6. Z. Brakerski, V. Vaikuntanathan, Efficient fully homomorphic encryption from (sta dard) LWE, in 52nd Annual Symposium on Foundations of Computer Science (2011), S. 97–106

    Google Scholar 

  7. Z. Brakerski, V. Vaikuntanathan, C. Gentry, Fully homomorphic encryption without botstrapping, in Innovations in theoretical computer science (2012)

    Google Scholar 

  8. M. van Dijk, C. Gentry, S. Halevi, V. Vaikuntanathan, Fully homomorphic encryption over the integers, in Advances in cryptology – EUROCRYPT 2010, Hrsg. von H. Gilbert (2010), S. 24–43

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA

    Duncan Buell

Authors
  1. Duncan Buell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Duncan Buell .

Rights and permissions

Reprints and permissions

Copyright information

© 2024 Der/die Autor(en), exklusiv lizenziert an Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Buell, D. (2024). Homomorphe Verschlüsselung. In: Grundlagen der Kryptographie. Springer Vieweg, Cham. https://doi.org/10.1007/978-3-031-50432-7_16

Download citation

Publish with us

Policies and ethics

Search

Navigation