On the Size of Pairing-Based Non-interactive Arguments

On the Size of Pairing-Based Non-interactive Arguments

Explore a comprehensive analysis of pairing-based non-interactive arguments presented at Eurocrypt 2016 by Jens Groth. Delve into key concepts including additive notation, pairing-based notation, and lower bounds. Examine a simple example and construction, compare different approaches, and gain valuable insights into the size and efficiency of these cryptographic arguments. Enhance your understanding of advanced cryptography through this in-depth 28-minute lecture, which covers everything from introductory concepts to a final summary of the topic.