"Many-out-of-Many" Proofs and Applications to Anonymous Zether
Offered By: IEEE via YouTube
Course Description
Overview
Explore the concept of "Many-out-of-Many" proofs and their applications to Anonymous Zether in this 15-minute IEEE conference talk. Delve into the privacy challenges faced by standard cryptocurrencies and understand how Anonymous Zether addresses these issues. Learn about the requirements for Zero-Knowledge Proofs (ZKP) in this context and discover the innovative "Many-out-of-Many" proof system. Gain technical insights into the workings of this new ZKP approach, examine practical examples, and explore its implementation. Enhance your understanding of advanced cryptographic techniques used to improve privacy in blockchain systems.
Syllabus
Standard cryptocurrencies lack privacy
How does Anonymous Zether work?
What must the ZKP prove?
New ZKP: Many-out-of-Many proofs
How does it work, technically?
Examples of many-out-of-many proofs
Implementation
Taught by
IEEE Symposium on Security and Privacy
Tags
Related Courses
Applied CryptographyUniversity of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera