This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
RSA (Abschn. 2.3.1) basiert auf der Trapdoor-Einwegfunktion der Multiplikation zweier großer Primzahlen; die Umkehrung (also die Primfaktorzerlegung) ist ohne Zusatzwissen nicht effizient durchführbar.
- 2.
Die Sicherheit beruht auf der Schwierigkeit, Quadratwurzeln im Restklassenring \(\mathbb {Z}_{n}\) zu berechnen.
- 3.
Man spricht in diesem Zusammenhang auch von einem „Selective Disclosure“.
Literatur
Pierre Baldi, Roberta Baronio, Emiliano De Cristofaro, Paolo Gasti, and Gene Tsudik. Countering gattaca: Efficient and secure testing of fully-sequenced human genomes. In Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS '11, pages 691–702, New York, NY, USA, 2011. ACM.
Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael Schwartzbach, and Tomas Toft. Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23–26, 2009. Revised Selected Papers, chapter Secure Multiparty Computation Goes Live, pages 325–343. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.
Ernie Brickell, Jan Camenisch, and Liqun Chen. Direct anonymous attestation. In Proceedings of the 11th ACM Conference on Computer and Communications security (CCS '04), pages 132–145. ACM, 2004.
Jan Camenisch and Anna Lysyanskaya. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, pages 93–118. Springer Berlin Heidelberg, Berlin, Heidelberg, 2001.
David Chaum. Security without identification: transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030–1044, Oct. 1985.
Emiliano De Cristofaro and Gene Tsudik. Practical private set intersection protocols with linear complexity. In Financial Cryptography and Data Security, 14th International Conference, FC 2010, Tenerife, Canary Islands, January 25–28, 2010, Revised Selected Papers, pages 143–159, 2010.
Sky Faber, Ronald Petrlic, and Gene Tsudik. UnLinked: Private Proximity-based Off-line OSN Interaction. In Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, WPES '15, pages 121–131, New York, NY, USA, 2015. ACM.
Amos Fiat and Adi Shamir. Advances in Cryptology — CRYPTO' 86: Proceedings, chapter How To Prove Yourself: Practical Solutions to Identification and Signature Problems, pages 186–194. Springer Berlin Heidelberg, Berlin, Heidelberg, 1987.
Dominik Leibenger, Frederik Möllers, Anna Petrlic, Ronald Petrlic, and Christoph Sorge. Privacy Challenges in the Quantified Self Movement - An EU Perspective. Proceedings on Privacy Enhancing Technologies, 2016(4), 2016. Conference Presentation at PETS 2016.
Ronald Rivest, Adi Shamir, and Yael Tauman. How to leak a secret. In Advances in Cryptology - ASIACRYPT 2001, volume 2248 of LNCS, pages 552–565, 2001.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 Der/die Autor(en), exklusiv lizenziert an Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature
About this chapter
Cite this chapter
Petrlic, R., Sorge, C., Ziebarth, W. (2022). Weitere kryptographische Verfahren für PETs. In: Datenschutz. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-39097-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-658-39097-6_10
Published:
Publisher Name: Springer Vieweg, Wiesbaden
Print ISBN: 978-3-658-39096-9
Online ISBN: 978-3-658-39097-6
eBook Packages: Computer Science and Engineering (German Language)