Master project kickoff presentation, Aaron Kimmig

Title: 

Bulletproofs have gained major attention as a versatile tool to prove mathematically expressed statements to a verifying party with zero-knowledge and logarithmic proof sizes.

Abstract :

Industries with high requirements in both privacy and computational integrity such as the financial sector therefore have been interested in optimized implementations, ready for deployment as fast as possible. (Consequently, these kinds of implementations are the easiest to find publicly available on the internet.) However, for educational purposes and mathematics-based research, an implementation with minimum lines of code, easy-to-prove correctness and full abstraction from memory, processor and other machine details should be considered the most suitable.

The goal of this project is to implement the basic parts of the bulletproof protocol – range proof and inner product proof – with the Wolfram Language (WL). As the WL is designed to map the mathematical world to computer language on the level of single expressions, such an end-to-end-implementation of the Bulletproof protocol yields a complete mathematical description of it. This can help making sense of certain properties of the system, like correctness, soundness, and completeness in an interactive manner.

​​​​​​​Zoom Link : 

https://uni-freiburg.zoom.us/j/87966925056?pwd=REQ4cjhkU29LYkRtemdtMGRMcXFXZz09
Meeting-ID: 879 6692 5056
password: WR6RriwYD

In-Presence :

 051-02-007