ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs

Amitabh Saxena

2007

Abstract

This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identification (eg. in smart-cards). Secondly, we extend the idea to multiple proofs and propose the notion of efficient Additive Non-Interactive Witness-Indistinguishable (A-NIWI) proofs. Intuitively an A-NIWI proof can be considered as a PoK of another A-NIWI proof. Our ideas are based on the aggregate signature scheme of Boneh et al. (proposed in Eurocrypt 2003).

Paper Citation

in Harvard Style

Saxena A. (2007). ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs . In Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007) ISBN 978-989-8111-12-8, pages 239-244. DOI: 10.5220/0002117102390244

in Bibtex Style

@conference{secrypt07,
author={Amitabh Saxena},
title={ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs},
booktitle={Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)},
year={2007},
pages={239-244},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002117102390244},
isbn={978-989-8111-12-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)
TI - ADDITIVE PROOFS OF KNOWLEDGE - A New Notion for Non-Interactive Proofs
SN - 978-989-8111-12-8
AU - Saxena A.
PY - 2007
SP - 239
EP - 244
DO - 10.5220/0002117102390244