Lecture

Mixnet based on Paillier

Description

This lecture discusses a mixnet based on a provably secure and efficient verifiable shuffle, focusing on the modified PyEcrypto system and the security objectives of the proposed mixnet. It explains the key generation, encryption, decryption, and re-encryption algorithms, as well as the proof system for the verifiable shuffle. The lecture also covers the construction of the mixnet, the applications of the proposed system in e-voting and privacy-preserving data mining, and the advancements made since the publication of the paper.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.