5, 10 or 20 seats+ for your team - learn more
In this series of liveProjects, you’ll go hands-on with some of the advanced concepts of applied cryptography through easy-to-understand games. Don’t worry—even though you’ll be encountering complex cryptographic concepts, the games you’ll build will be simple, intuitive, and above all, fun! Each game covers both the math and cryptographic building blocks you’ll need to create it, in a way that you can easily transfer to real-world use cases.
In this liveProject, you’ll use the “dark magic” of secure multiparty computation (MPC) to create a dating game app. MPC lets a group of participants run a joint computation over their inputs while keeping these inputs private, and this dating game will stand as proof-of-concept for other uses for the technique. You’ll develop a game that matches participants if they both like each other, and use privacy-enhancing cryptography to make sure sensitive information cannot leak. Your project will be created using Rust, which is a perfect choice for cryptography thanks to its guaranteed memory safety and other low-level language features.
In this liveProject, your challenge is to plan a festive Secret Santa gift exchange for your co-workers, keeping their identities private. The catch is: They’re all working remotely thanks to the COVID-19 pandemic. Luckily, you’re no stranger to providing innovative solutions to “impossible” problems. You’ll implement MPC as you program in Rust, which is well-suited for cryptography applications thanks to its guaranteed memory safety. When you’re done, you’ll have developed a private mix method and randomly assigned each “gifter” exactly one “giftee” while keeping the identity of the “Santa” a secret!
In this liveProject, you’ll use zero-knowledge proof (ZKP) to reveal that a super hard Sudoku puzzle has been solved, but without sharing the answer. To do this you’ll implement a prover and a verifier that are sharing a Sudoku board. The prover will produce a proof for knowing a solution, while the verifier will use the proof to get convinced and catch a cheating prover. You’ll build a ZKP based on the classical GMW zero-knowledge proof of 3-Colorability of a graph, using the Rust language.
In this liveProject, you’ll use secure multiparty computation to reveal which of two millionnaires is richer without exposing how much either is worth. Your program will use the two-party computation for the “greater than” operator, and be written using the Rust language. Due to its unique set of features, such as guaranteed memory safety, Rust is well suited for programming cryptography applications.
In this liveProject, you’ll use cryptography to create a fair and secure coin tossing application. This simple-sounding task is surprisingly complex, and so you’ll implement a multi-step classical protocol to create a coin flipper where neither player can cheat or bias the result. You’ll use Rust to implement the computational steps of a coin toss construction, as this powerful low-level language has great features for cryptography.
In this liveProject, you’ll use the private set-intersection (PSI) protocol to develop a tool which can compare cancer patients for a blind trial without revealing their private details. PSI is a two-party protocol where each party holds a private set that it inputs to the protocol, and outputs a new set that contains only the elements in the intersection. You’ll implement PSI using three different techniques: the oblivious transfer (OT) cryptographic primitive, a standard Bloom filter, and a more complex garbled version of a Bloom filter.
This liveProject series is for beginner Rust developers. To begin this series you will need to be familiar with the following:TOOLS
In this liveProject series, you’ll explore cryptography for collaborative computation that offers privacy enhancement.
geekle is based on a wordle clone.