Found 15 relevant results in 7.20s where lecturer="Ueli Maurer"
In a cryptographic protocol, a set of parties wants to achieve some common goal, while some of the parties are dishonest. Most prominent example of a cryptographic protocol is multi-party computation, where the parties compute an arbitrary (but fixed) function of their inputs, while maintaining the secrecy of the inputs and the correctness of the outputs even if some of the parties try to cheat.
Cryptographic Protocols
Kryptographische Protokolle
The course presents a selection of hot research topics in cryptography. The choice of topics varies and may include provable security, interactive proofs, zero-knowledge protocols, secret sharing, secure multi-party computation, e-voting, etc.
Fundamentals and applications of cryptography. Topics include: cryptographic thinking (reductions, simulation-based security, composition, security proofs), one-way and hash functions, pseudo-randomness, symmetric encryption and authentication, public-key encryption, digital signature schemes, some cryptographic protocols, and some cryptanalytic techniques. Some applications and case studies.
Cryptography
Kryptographie
Latest Topics in Cryptography will be discussed.
Cryptography
Kryptographie
LatestTopics in Cryptography will be discussed.
In this seminar course, students present and discuss a variety of recent research papers in Cryptography.
The seminar covers various topics in information security: security protocols (models, specification & verification), trust management, access control, non-interference, side-channel attacks, identity-based cryptography, host-based attack detection, anomaly detection in backbone networks, key-management for sensor networks.
The seminar covers various topics in information security: security protocols (models, specification & verification), trust management, access control, non-interference, side-channel attacks, identity-based cryptography, host-based attack detection, anomaly detection in backbone networks, key-management for sensor networks.
Discrete Mathematics
Diskrete Mathematik
Content: Mathematical reasoning and proofs, abstraction. Sets, relations (e.g. equivalence and order relations), functions, (un-)countability, number theory, algebra (groups, rings, fields, polynomials, subalgebras, morphisms), logic (propositional and predicate logic, proof calculi).
Discrete Mathematics
Diskrete Mathematik
The topics include: inductive proofs, sets, functions, relations, equivalence and order relations, graph theory, combinatorics, combinatorial counting, algebra (groups, rings, fields, polynomials, subalgebras, morphisms), number theory, etc.
Discrete Mathematics
Diskrete Mathematik
Content: Mathematical reasoning and proofs, sets, relations (e.g. equivalence and order relations), functions, combinatorics, (un-)countability, graph theory, number theory, algebra (groups, rings, fields, polynomials, subalgebras, morphisms), logic (propositional and predicate logic, proof calculi).
This course provides an introduction to Information Security. The focusis on fundamental concepts and models, basic cryptography, protocols and system security, and privacy and data protection. While the emphasis is on foundations, case studies will be given that examine different realizations of these ideas in practice.
This course provides an introduction to Information Security. The focusis on fundamental concepts and models, basic cryptography, protocols and system security, and privacy and data protection. While the emphasis is on foundations, case studies will be given that examine different realizations of these ideas in practice.