Short Pairing-Based Non-interactive Zero-Knowledge Arguments

  • Jens Groth
Conference paper

DOI: 10.1007/978-3-642-17373-8_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6477)
Cite this paper as:
Groth J. (2010) Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In: Abe M. (eds) Advances in Cryptology - ASIACRYPT 2010. ASIACRYPT 2010. Lecture Notes in Computer Science, vol 6477. Springer, Berlin, Heidelberg

Abstract

We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive zero-knowledge arguments have sub-linear size and very efficient public verification. The size of the non-interactive zero-knowledge arguments can even be reduced to a constant number of group elements if we allow the common reference string to be large. Our constructions rely on groups with pairings and security is based on two new cryptographic assumptions; we do not use the Fiat-Shamir heuristic or random oracles.

Keywords

Sub-linear size non-interactive zero-knowledge arguments pairing-based cryptography power knowledge of exponent assumption computational power Diffie-Hellman assumption 
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2010

Authors and Affiliations

  • Jens Groth
    • 1
  1. 1.University College LondonUK

Personalised recommendations