Skip to main content
Log in

Abstreitbarkeit bei eID-Lösungen

Ein weiterer Aspekt zum Schutz der Privatsphäre

  • Schwerpunkt
  • Published:
Datenschutz und Datensicherheit - DuD Aims and scope Submit manuscript

Zusammenfassung

Verfahren zu elektronischen Identitäten sollen persönliche Daten schützen und Missbrauch im Internet-Verkehr verhindern. Dabei ist der Schutz der Privatsphäre der Anwender ein wichtiger Gesichtspunkt. Wir betrachten hier speziell die sogenannte Abstreitbarkeit als einen Teil der Privatsphären-Aspekte von eID-Lösungen.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literatur

  1. European Commission: Digital Agenda for Europe: e-Identification. http://ec.europa.eu/digital-agenda/en/e-identification, 2014.

    Google Scholar 

  2. Marc Fischlin. Vergleich von eID-Privacy-Konzepten aus kryptographischer Sicht. 24. Fraunhofer SIT SmartCard-Workshop, Fraunhofer Verlag Stuttgart, 2014.

    Google Scholar 

  3. Marc Fischlin. Privacy-Konzepte für den Personalausweis aus kryptographischer Sicht. 22. Fraunhofer SIT SmartCard-Workshop, Fraunhofer Verlag Stuttgart, 2012

    Google Scholar 

  4. Özgür Dagdelen, Marc Fischlin, Tommaso Gagliardoni, Giorgia Azzurra Marson, Arno Mittelbach, Cristina Onete: A Cryptographic Analysis of OPACITY. ESORICS 2013, LNCS, Springer, 2013.

    Book  Google Scholar 

  5. International Civil Aviation Organization (ICAO): Machine readable travel documents. Technical Report Doc 9303, Part 1, Machine Readable Passports, Sixth Edition, 2006.

    Google Scholar 

  6. TrueCrypt, http://www.truecrypt.org/, 2014.

  7. The OTR Development Team. Off-the-Record Messaging. https://otr.cypherpunks.ca/, 2014.

    Google Scholar 

  8. Danny Dolev, Cynthia Dwork, und Moni Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391–437, 2000.

    Article  MathSciNet  Google Scholar 

  9. Cynthia Dwork, Moni Naor, und Amit Sahai. Concurrent zero-knowledge. J. ACM 51(6): 851–898, 2004.

    Article  MathSciNet  Google Scholar 

  10. Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish: Composability and On-Line Deniability of Authentication. TCC 2009, LNCS, Springer, 2009.

    Book  Google Scholar 

  11. Mario Di Raimondo, Rosario Gennaro: New Approaches for Deniable Authentication. J. Cryptology 22(4): 572–615, 2009.

    Article  MathSciNet  Google Scholar 

  12. Mario Di Raimondo, Rosario Gennaro, Hugo Krawczyk: Deniable authentication and key exchange. ACM Conference on Computer and Communications Security 2006, ACM Press, 2006

    Google Scholar 

  13. Bundesamt für Sicherheit in der Informationstechnik: Advanced security mechanism for machine readable travel documents, Part 1, Technical Report (BSI-TR-03110-1), Version 2.10, 2012

  14. ISO/IEC 13888-1:2009. Information technology — Security techniques — Non-repudiation — Part 1: General, 2009.

    Google Scholar 

  15. Amir Herzberg. Rump Session, Crypto 1991.

    Google Scholar 

  16. Josh Cohen Benaloh, Dwight Tuinstra: Receipt-free secret-ballot elections (extended abstract). STOC 1994, ACM Press, 1994.

    Book  Google Scholar 

  17. Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky: Deniable Encryption. CRYPTO 1997, LNCS, Springer, 1997.

    Book  Google Scholar 

  18. Ran Canetti, Rosario Gennaro: Incoercible Multiparty Computation (extended abstract). FOCS 1996, IEEE, 1996.

    Google Scholar 

  19. Stephanie Delaune, Steve Kremer, Mark Ryan: Coercion-Resistance and Receipt-Freeness in Electronic Voting. CSFW 2006, LNCS, Springer, 2006.

    Book  Google Scholar 

  20. Jens Bender, Özgür Dagdelen, Marc Fischlin, Dennis Kügler: The PACE|AA Protocol for Machine Readable Travel Documents, and Its Security. Financial Cryptography 2012, LNCS, Springer, 2012.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marc Fischlin.

Additional information

Marc Fischlin ist Heisenberg-Professor für Kryptographie und Komplexitätstheorie an der Technischen Universität Darmstadt.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fischlin, M. Abstreitbarkeit bei eID-Lösungen. Datenschutz Datensich 38, 462–466 (2014). https://doi.org/10.1007/s11623-014-0207-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11623-014-0207-5

Navigation