University of Birmingham > Talks@bham > Computer Security Seminars > Shorter QA-NIZK Proofs For Quadratic Equations

Shorter QA-NIZK Proofs For Quadratic Equations

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mani Bhesania.

Proofs of satisfiability of quadratic equations in bilinear groups often arise naturally in the construction of zero-knowledge protocols. Examples of this are range proofs or shuffles, used in cryptocurrencies or electronic voting. Current proofs are either slow or based on very strong assumptions. In this talk, I will present an approach that draws techniques from both sides and manages to find some middle ground, improving upon the first type while keeping away from these strong assumptions. I will also discuss how these proofs relate to applications. Minimal crypto background is required, I will introduce most of the necessary ideas. Joint work with Alonso González, Zaira Pindado and Carla Ràfols.

This talk is part of the Computer Security Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.