Skip to content

SAS

Seminar

Pairing-based succinct non-interactive zero-knowledge arguments

Groth, J (UCL)
Wednesday 11 April 2012, 11:30-12:30

Seminar Room 1, Newton Institute

Abstract

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.

Video

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧