Fakultät für Informatik | KIT |  Deutsch  | English

Kontakt

Am Fasanengarten 5
Geb. 50.34

D-76131 Karlsruhe

Tel.: + 49 721 608-44205
Fax: + 49 721 608-55022

E-Mail: crypto-info(at)iti.kit.edu

Aktuelles

Prof. Jörn Müller-Quade in "SWR Landesschau aktuell Baden-Württemberg"

In der "SWR Landesschau aktuell Baden-Württemberg"-Sendung vom 7.4.14 sprach Prof. Jörn Müller-Quade zum Thema "Information zu Datenklau" über die Zwei-Faktor-Authentifizierung.

CeBIT 2014: KASTEL stellte Projekt "Sichere Kombination von Firewalls" vor

Das Kompetenzzentrum für angewandte Sicherheitstechnologie (KASTEL) stellte auf der CeBIT 2014, die vom 10.3. bis zum 14.3.14 in Hannover stattfand, im Rahmen des gemeinsamen CeBIT-2014-Auftritts des Karlsruher Instituts für Technologie (KIT) und des FZI Forschungszentrum Informatik das Projekt "Sichere Kombination von Firewalls" vor. In Zusammenarbeit mit dem FZI Forschungszentrum Informatik wurde ein Prototyp entwickelt und ebenso ausgestellt, der die Funktionsweise der sicher-kombinierten Firewalls anschaulich demonstriert.

"Woche der IT-Sicherheit", 2. Staffel der Anti-Prism-Party und Kryptologikumausstellung

In der Woche vom 10.2. bis zum 14.2.14 fand die "Woche der IT-Sicherheit" statt. Im Rahmen dessen erschien jeweils an jedem dieser Tage ein Artikel über ein Thema aus dem Bereich der Kryptographie und IT-Sicherheit auf der Homepage der Informatik-Fakultät. Die zweite Staffel der Anti-Prism-Party am 12.2.14 und das Kryptologikum im ZKM vom 12.2. bis zum 14.2.14 rundeten die "Woche der IT-Sicherheit" ab.

Vortrag auf 6. Trendkongress net economy

Prof. Jörn Müller-Quade hielt auf dem 6. Trendkongresses net economy, der am Mittwoch, den 5.2.14 im Rahmen der CLOUDZONE in der Messe Karlsruhe stattfand, einen Vortrag mit dem Titel "Woher weiß ich, ob es sicher ist?".

2. Staffel der Anti-Prism-Party und Kryptologikumausstellung

Am Mittwoch, dem 12.2.14, ab 18.00 Uhr, fand die 2. Staffel der Anti-Prism-Party, die von der KA-IT-Si, dem ZKM Karlsruhe, dem CyberForum und KASTEL organisiert wurde, im ZKM in Karlsruhe statt. Im Rahmen dessen war die Ausstellung des Kryptologikums vom 12.2. bis 14.2.14 ebenfalls im ZKM zu sehen.

SWR-Landesschau-Beitrag und Baden-TV-Interview

Ein Beitrag der Sendung "SWR Landesschau aktuell Baden-Württemberg" vom 22.1.14 berichtet über das Thema "Digitale Schwachstellen in den eigenen vier Wänden" und über die Forschung auf diesem Gebiet am KIT.

In der "Baden TV Aktuell am Abend"-Sendung vom 22.1.14 sprach Prof. Jörn Müller-Quade zudem über den "Millionenfachen Identitätsdiebstahl".

"KIT im Rathaus"

Im Rahmen der Veranstaltung "KIT im Rathaus", die am Mittwoch, dem 22.1.14, ab 18.30 Uhr, im Rathaus Karlsruhe stattfindet, hielt Prof. Jörn Müller-Quade einen Vortrag mit dem Titel "Ist Sicherheit beweisbar?".

Alle Nachrichten

CrySTALS

Cryptographic Solutions To Achieve Long-term Security

 

 

Objectives

The project CrySTALS aims at developing cryptographic protocols to guarantee long-term security. Therefore a rigorous modelling of security properties allowing formals proofs of security are needed as well as new approaches like temporary security assumptions.

Research

  • The Worlds First Bank Transfer secured by Quantum Cryptography was Insecure ([BMQS05b])
  • Modular Design of Secure Protocols (Building Protocols from Primitives)
    • universally composable protocols in the random oracle model ([HMQ04b])
    • a composable notion of security for public key cryptography is equivalent to the established notion of IND-CCA ([HMQS06])
    • how to use the one time pad ([RSMQ05])
    • oblivious transfer is not the most powerful primitive if the underlying network is reliable ([HMQ04a])
    • oblivious transfer is not the most powerful primitive if deniability is a concern ([MQRU05])
  • Additional Security Concerns for Digital Signatures
    • how to avoid subliminal channels in digital signatures ([BS05])
    • beware of key substitution attacks with malicious signers (BRS06)
  • How to Define Security
    • what security is depends on the underlying network
    • how to define computational security without (artifical) explicit runtime bounds ([HMQU05])

Teaching

  • Lectures
    • Public Key Kryptographie (Public Key Cryptography, Winter 2005/06)
    • Formale Sicherheitsmodelle: Was bedeutet Sicherheit in der Kryptographie (Formal Security Models: On the Meaning of Cryptographic Security, Winter 2005/06)
    • Grundlagen der Computersicherheit (Foundations of Computer Security, Summer 2005)
    • Signale, Codes und Chiffren I (Signals, Codes and Cyphers I, Summer 2005)
    • Grenzen formaler Sicherheitsmodelle (Limits of Formal Security Models, Winter 2004/05)
    • Formale Sicherheitsmodelle in der Kryptographie (Formal Security Models in Cryptography, Summer 2004)
    • Bedrohung und Sicherheit in der Kryptographie (Threats and Security in Cryptography, Summer 2003)
    • Primitive, Protokolle und Annahmen in der Kryptographie (Primitives, Protocolls, and Assumptions in Cryptography, Winter 2002/03)
  • Seminars

Publications

[BRS06] Jens-Matthias Bohli, Stefan Röhrich, and Rainer Steinwandt. Key substitution attacks revisited: Taking into account malicious signers. International Journal of Information Security, 5(1):30-36, April 2006.
[ bib | http ]
[BMQR05a] Jens-Matthias Bohli, Jörn Müller-Quade, and Stefan Röhrich. Fairness and Correctness in Case of a Premature Abort. In Subhamoy Maitra, C. E. Veni Madhavan, and Ramarathnam Venkatesan, editors, Progress in Cryptology - INDOCRYPT 2005: 6th International Conference on Cryptology in India, volume 3797 of Lecture Notes in Computer Science, pages 322-331. Springer, December 2005.
[ bib | http ]
[MQ05] Jörn Müller-Quade. Temporary Assumptions-Quantum and Classical. In The 2005 IEEE Information Theory Workshop On Theory and Practice in Information Theoretic Security. Proceedings, pages 31-33, Awaji, Japan, October 2005.
[ bib ]
[BHMQU05] Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. On Fairness in Simulatability-based Cryptographic Systems. In Ralf Küsters and John Mitchell, editors, Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering, pages 13-22. ACM Press, 2005. Full version as IACR ePrint 2005/294.
[ bib ]
[BMQR05b] Jens-Matthias Bohli, Jörn Müller-Quade, and Stefan Röhrich. On Group Key Agreement with Cheater Identification. WEWoRC Western European Workshop on Research in Cryptology 2005, Leuven, July 2005.
[ bib ]
[HMQU05a] Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. Polynomial Runtime in Simulatability Definitions. In Computer Security Foundations Workshop Proceedings, 2005.
[ bib ]
[HMQU05b] Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. Universally Composable Zero-Knowledge Arguments and Commitments from Signature Cards. In Proceedings of the 5th Central European Conference on Cryptology, MoraviaCrypt 2005, June 2005.
[ bib ]
[MQRU05] Jörn Müller-Quade, Stefan Röhrich, and Dominique Unruh. Oblivious Transfer is Incomplete for Deniable Protocols. Workshop on The Past, Present and Future of Oblivious Transfer, Satellite workshop of the Fifth Haifa Workshop on Interdisciplinary Applications of Graph theory, Combinatorics, and Algorithms, Honoring Michael O. Rabin, Turing Award Winner, Haifa, May 2005.
[ bib ]
[BMQS05] Th. Beth, Jörn Müller-Quade, and Rainer Steinwandt. Cryptanalysis of a Practical Quantum Key Distribution With Polarization-Entangled Photons. Quantum Information & Computation (QIC), 5(3):181-186, May 2005.
[ bib ]
[BS05] Jens-Matthias Bohli and Rainer Steinwandt. On Subliminal Channels in Deterministic Signature Schemes. In Choonsik Park and Seongtaek Chee, editors, Information Security and Cryptology - ICISC 2004, volume 3506 of Lecture Notes in Computer Science, pages 182-194. Springer, 2005.
[ bib | http ]
[RSMQ05] Dominik Raub, Rainer Steinwandt, and Jörn Müller-Quade. On the Security and Composability of the One Time Pad. In SOFSEM 2005: Theory and Practice of Computer Science: 31st Conference on Current Trends in Theory and Practice of Computer Science, volume 3381 of Lecture Notes in Computer Science, pages 288-297. Springer, January 2005.
[ bib | http ]
[HMQS06] Dennis Hofheinz, Jörn Müller-Quade, and Rainer Steinwandt. On modeling IND-CCA security in cryptographic protocols. Tatra Mountains Mathematical Publications, to appear 2006. full version of [HMQS04].
[ bib ]
[BMQS06] Thomas Beth, Jörn Müller-Quade, and Rainer Steinwandt. Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm. Journal of Symbolic Computation, 41(3-4):372-380, 2006.
[ bib ]
[HMQ04a] Dennis Hofheinz and Jörn Müller-Quade. A Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer. In Proceedings of Foundations of Computer Security - FCS'04, Turku, 2004.
[ bib ]
[HIMQ+04] G. Hanaoka, Hideki Imai, Jörn Müller-Quade, Anderson Nascimento, A. Otsuka, and Andreas Winter. Information Theoretically Secure Oblivious Polynomial Evaluation: Model, Bounds, and Constructions. In Proceedings of Information Security and Privacy: 9th Australasian Conference, ACISP 2004, Sydney, Australia, volume 3108 of Lecture Notes in Computer Science. Springer, 2004.
[ bib ]
[HMQS04] Dennis Hofheinz, Jörn Müller-Quade, and Rainer Steinwandt. On Modeling IND-CCA Security in Cryptographic Protocols. In Proceedings der 4th Central European Conference on Cryptology, WARTACRYPT '04, Poznan, July 2004.
[ bib ]
[NMQO+04] Anderson Nascimento, Jörn Müller-Quade, A. Otsuka, G. Hanaoka, and Hideki Imai. Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model. In Proceedings of ACNS 2004, Yellow Mountain, China, Lecture Notes in Computer Science. Springer, June 2004.
[ bib ]
[NMQI04] Anderson Nascimento, Jörn Müller-Quade, and Hideki Imai. Bit String Commitment Reductions with a Non-Zero Rate. In Proceedings of CT-RSA 04, volume 2964 of Lecture Notes in Computer Science, 2004.
[ bib ]
[HMQ04b] Dennis Hofheinz and Jörn Müller-Quade. Universally Composable Commitments Using Random Oracles. In Proceedings of TCC, Boston, volume 2951 of Lecture Notes in Computer Science. Springer, 2004.
[ bib ]
[IMQNW04a] Hideki Imai, Jörn Müller-Quade, Anderson Nascimento, and Andreas Winter. Rates for bit commitment and coin tossing from noisy correlation. In International Symposium on Information Theory, 2004. ISIT 2004. Proceedings, page 47. IEEE, 2004.
[ bib ]
[IMQNW04b] Hideki Imai, Jörn Müller-Quade, Anderson Nascimento, and Andreas Winter. Rates for bit commitment and coin tossing from noisy correlations. In Proceedings of the 2004 Symposium on Cryptography and Information Security (SCIS2004), Iwate, Japan, January 2004.
[ bib ]
[IMQN+04] Hideki Imai, Jörn Müller-Quade, Anderson Nascimento, Pim Tuyls, and Andreas Winter. An information theoretical model for quantum secret sharing schemes. Quantum Information & Computation (QIC), 5(1):069-080, January 2004. Preprint on quant-ph/0311136.
[ bib | http ]
[MQS03] Jörn Müller-Quade and Rainer Steinwandt. On the problem of authentication in a quantum protocol to detect traffic analysis. Quantum Information & Computation (QIC), 3(1):48-54, 2003.
[ bib ]
[NMQO+03] Anderson Nascimento, Jörn Müller-Quade, A. Otsuka, G. Hanaoka, and Hideki Imai. Unconditionally Secure Pre-Distributed Homomorphic Commitments and Secure Two-Party Computations. In Proceedings of ISC 03, volume 2851 of Lecture Notes in Computer Science, pages 151-164. Springer, 2003.
[ bib ]
[HMQS03] Dennis Hofheinz, Jörn Müller-Quade, and Rainer Steinwandt. Initiator-Resilient Universally Composable Key Exchange. In E. Snekkenes und D. Gollmann, editor, 8th European Symposium on Research in Computer Security, ESORICS 2003 Proceedings, volume 2808 of Lecture Notes in Computer Science, pages 61-84. Springer, 2003.
[ bib ]
[NOMQI03] Anderson Nascimento, A. Otsuka, Jörn Müller-Quade, and Hideki Imai. Unconditionally Secure Two-Party Computations. In Proceedings of the 2003 Symposium on Cryptography and Information Security (SCIS2003), Hamamatsu, Japan, January 2003.
[ bib ]