BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Computer Security Seminars
SUMMARY:Shorter QA-NIZK Proofs For Quadratic Equations - J
avier Silva
DTSTART:20181018T100000Z
DTEND:20181018T110000Z
UID:TALK3355AT
URL:/talk/index/3355
DESCRIPTION:Proofs of satisfiability of quadratic equations in
bilinear groups often arise naturally in the cons
truction of zero-knowledge protocols. Examples of
this are range proofs or shuffles\, used in crypto
currencies or electronic voting. Current proofs ar
e either slow or based on very strong assumptions.
In this talk\, I will present an approach that dr
aws techniques from both sides and manages to find
some middle ground\, improving upon the first typ
e while keeping away from these strong assumptions
. I will also discuss how these proofs relate to a
pplications. Minimal crypto background is required
\, I will introduce most of the necessary ideas. \
nJoint work with Alonso González\, Zaira Pindado a
nd Carla Ràfols.
LOCATION:Room 245\, School of Computer Science
CONTACT:Mani Bhesania
END:VEVENT
END:VCALENDAR