University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Pairing-based succinct non-interactive zero-knowledge arguments

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Pairing-based succinct non-interactive zero-knowledge arguments

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Semantics and Syntax: A Legacy of Alan Turing

A non-interactive zero-knowledge argument enables a prover to convince a verifier that a statement is true without revealing any other private information. We consider succinct arguments that are smaller than the size of the statement. Succinct arguments are known in the random oracle model. The goal of this talk is to present alternative pairing-based methods that can be used instead of the random oracle model relying on different and perhaps more plausible cryptographic assumptions.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre, CRUK Cambridge Research Institute Yusuf Hamied Lecture Theatre, Christ's College, Cambridge Zoom and Seminar Room 2, Department of History and Philosophy of Science

Other talks

Morning Break Group Work Kirk Public Lecture | A proxy window into the beautiful and challenging world of causal attribution Necessary mechanisms for super AI and stopping hallucinations: The consistent reasoning paradox and the indeterminacy function Clonal haematopoiesis, early detection and pre-leukemia to leukemia development Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity