Lecture
Mixnet based on Paillier
Related lectures (44)
Perfect Secrecy: Diffie-Hellman System
Explores perfect secrecy, one-time pads, and the Diffie-Hellman key generation process.
Electronic Voting: Processes and Approaches
Explores electronic voting processes, approaches, and technologies, emphasizing integrity, fairness, and transparency in voting systems.
Symmetric Encryption Schemes
Explores symmetric encryption schemes, including block and stream ciphers, their vulnerabilities, and the importance of key lengths.
Moscow e-Voting: Encryption Scheme Breakdown
Explores the vulnerabilities of the Moscow Internet Voting System and the fixes implemented after attacks on the encryption scheme.
Chinese Remainders Theorem and RSA
Explores the Chinese Remainders Theorem, RSA, bijective maps, and key generation for encryption.
E-Voting: Decentralized Systems for Democracy
Delves into e-voting systems, emphasizing decentralized democracy, election phases, and challenges in ensuring verifiability and security.
Mobile Telephony Security
Explores 2G mobile telephony security, covering authentication, encryption, privacy concerns, and vulnerabilities in encryption algorithms.
Encryption Key Usage
Covers the usage of encryption keys in the context of image encryption using Scratch.
Anonymity in Communication: Tor and Cryptographic Protocols
Explores anonymity in communication, focusing on Tor, cryptographic protocols, and challenges in achieving perfect anonymity.
Exercise: Choosing Capsules
Covers a series of exercises related to encryption functions, starting with basic ones and progressing to modern encryption methods.