Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Commitment Scheme: Key Derivation and Hash Function

Related lectures (32)

Commitment Scheme and PRNG

Explores the commitment scheme, key derivation function, and pseudorandom generator in cryptographic protocols, emphasizing their role in ensuring data integrity and authentication.

Semantic Security: Stream Ciphers

Explores semantic security in stream ciphers, emphasizing pseudorandom number generators and computational limitations in cryptography.

Public-Key Cryptography: Key Exchange and Signatures

Explores public-key cryptography, key exchange, and digital signatures, discussing practical applications and security mechanisms.

Applied Cryptography: Basics

Introduces applied cryptography basics, historical encryption methods, and the concept of perfect secrecy with the One Time Pad.

Stream Ciphers: Buteforce Inversion Algorithms

Explores stream ciphers, buteforce inversion algorithms, key recovery games, and attacks in cryptography.

Public-Key Cryptography: Standards and Applications

Discusses public-key cryptography, focusing on standards like RSA, DSA, and AES, and their applications in secure communications.

Random Number Generation

Explores the challenges of generating random numbers and secret key generation in secure communication.

Message Authentication Codes: Formalism

Explores message authentication codes and their formalism, with a focus on mobile telephony, covering topics like misuse attacks, security notions, and GSM architecture.

Proving Security: Random Oracle Model

Explores the Random Oracle Model, Hybrid ElGamal, and the Fujisaki Okamoto Transform in proving security.

Random Number Generators: Modulo Generator

Explores random number generators on computers, focusing on the Modulo generator and the criteria for pseudo random numbers.

Random Number Generators: Basics and Algorithms

Explores random number generators, from true random numbers to pseudo random algorithms, including the modulo generator and advanced techniques.

Asymmetric Cryptography: RSA, Elliptic Curves, Lattices

Explores RSA, elliptic curves, and lattice-based cryptography for secure communication.

RSA Encryption: Principles and Applications

Explores RSA encryption principles, factorization challenges, and practical applications in data security.

RSA: Trapdoor One-Way Functions

Explores RSA encryption, trapdoor functions, hash functions, and cryptographic standards, including a practical example with Apple's iMessage implementation.

Conditional Access II

Covers conditional access, encryption, decryption, authentication, and advanced encryption standards, exploring identity-based encryption, biometrics, and attribute-based encryption.

Introduction to Cryptography: Fundamentals and Applications

Covers the fundamentals of cryptography, including symmetric encryption, digital signatures, and secure communication standards.

Data Security: Hashing, Salting, and Password Storage

Emphasizes the significance of hashing, salting, and secure password storage in data security, highlighting the use of salt to prevent dictionary attacks and memory hard functions to slow down password cracking.

Homomorphic Encryption: Cloud and Aggregation

Explores homomorphic encryption for secure cloud computing and data aggregation.

Cryptography: Introduction

Explores the fundamentals of cryptography, its properties, historical development, and potential challenges from quantum computers.

Quantum Random Number Generation

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.