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

## Shorter QA-NIZK Proofs For Quadratic EquationsAdd to your list(s) Download to your calendar using vCal - Javier Silva
- Thursday 18 October 2018, 11:00-12:00
- Room 245, School of Computer Science.
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. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Computer Security Seminars
- Room 245, School of Computer Science
Note that ex-directory lists are not shown. |
## Other listsFilling in the blank – I will be ….... in 2050’ Computer Science Distinguished Seminars Molecular and Medical Physics Seminar Series## Other talksThe CERN CLOUD experiment: Do cosmic rays influence Earth’s climate? RSC Corday-Morgan Prize Lecture Controlling electromagnetic fields with plasmonic metasurfaces: the effect of singularities Under the spell of gauge theory Possible high-temperature superconductivity in brain I2S Seminar |