Concept

Deniable encryption

Related lectures (14)
E-Voting: Research and Challenges
Explores e-voting research, digital algorithms, privacy challenges, and cryptographic methods in ensuring legitimacy and participation.
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
Cryptographic Primitives: Theory and Practice
Explores fundamental cryptographic primitives, security models, and the relationship between decryption security and key recovery security.
Symmetric Encryption: Physical Limits
Explores the physical limits and security aspects of symmetric encryption schemes, including energy consumption, key recovery, and distinguisher security.
RSA Cryptography: Primality Testing and Quadratic Residues
Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.
Cryptographic Security Models
Explores Cryptographic Security Models, including Diffie-Hellman and ElGamal Security, RSA, and practical encryption problems.
Cryptographic Security Fundamentals
Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.
Diffie-Hellman Cryptography: Key Exchange & ElGamal
Covers Diffie-Hellman key exchange, DDH problem, ElGamal cryptosystem, and security implications.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.