Secure Computation: Part II

Por: Swayam . en: , ,

Week 1: Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds Week 2:Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.) Week 3:Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.) Week 4:Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.) Week 5:Reed-Solomon codes, perfectly secure message transmission protocols Week 6:Verifiable Secret-Sharing (VSS): definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds Week 7:Verifiable Secret-Sharing (VSS): definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.) Week 8:Verifiable Secret-Sharing (VSS): definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.) Week 9:Classic protocols for actively-secure MPC: BenOr-Goldwasser-Wigderson (BGW), Rabin-BenOr (RB), detailed analysis Week 10:Classic protocols for actively-secure MPC: BenOr-Goldwasser-Wigderson (BGW), Rabin-BenOr (RB), detailed analysis (contd.) Week 11:State-of-the-art actively-secure protocols, player-elimination, actively-secure MPC for small number of parties and applications Week 12:State-of-the-art actively-secure protocols, player-elimination, actively-secure MPC for small number of parties and applications (contd.)

Plataforma