University of Birmingham > Talks@bham > Computer Security Seminars > Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

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

If you have a question about this talk, please contact Andreea Radu.

In this talk, I will describe a zero-knowledge argument for arithmetic circuit satisfiability with a communication complexity that grows logarithmically in the size of the circuit. The security of our argument relies solely on the well-established discrete logarithm assumption, and a crucial component is a new proof-of-knowledge for openings of committed values. I will provide some intuition about how the argument works, details of our implementation, and challenges for future research.

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.

Other lists

'Roles' Postgraduate Gender and Sexuality Network Discussion Dinner Table Terrorism - Achieving Food Security PIPS - Postgraduate Informal Physics Seminars

Other talks

TBA Life : it’s out there, but what and why ? TBA TBC Horizontal Mean Curvature Flow and stochastic optimal controls The tragic destiny of Mileva Marić Einstein
 

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