oaioai:eprints.ucl.ac.uk.OAI2:1453275

Square span programs with applications to succinct NIZK arguments

Authors
Publication date
14 November 2014
Publisher
Springer Berlin Heidelberg
Doi

    Abstract

    We use SSPs to construct succinct non-interactive zero-knowledge arguments of knowledge. For performance, our proof system is defined over Type III bilinear groups; proofs consist of just 4 group elements, verified in just 6 pairings. Concretely, using the Pinocchio libraries, we estimate that proofs will consist of 160 bytes verified in less than 6 ms

    Similar works

    Full text

    thumbnail-image

    This paper was published in UCL Discovery.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.