Pairing-based Succinct Non-interactive Arguments

24 February 2016
15:00
Abstract
Zero-knowledge proofs enable a prover to convince a verifier that a statement is true without revealing anything but the truth of the statement. In recent years there has been a lot of effort in making the proofs succinct, i.e., the proof may be much smaller than the statement itself and be very easy for the verifier to check. The talk will give a general introduction to zero-knowledge proofs and a presentation of a new pairing-based succinct non-interactive argument system.
  • Cryptography Seminar