Paper 2020/1403 Original: eprint.iacr.org/2020/1403 ↗
A q-SDH-based Graph Signature Scheme on Full-Domain Messages with Efficient Protocols
Abstract
A graph signature scheme is a digital signature scheme that allows a recipient to obtain a signature on a graph and subsequently prove properties thereof in zero-knowledge proofs of knowledge. While known to be expressive enough to encode statements from NP languages, one main use of graph signatures is in topology certification and confidentiality-preserving security assurance. In this paper, we present an efficient and provably secure graph signature scheme in the standard model with tight reduction. Based on the MoniPoly attribute-based credential system, this new graph signature scheme offers zero-knowledge proofs of possession of the signature itself as well as confidentiality-preserving show proofs on logical statements such as the existence of vertices, graph connectivity or isolation.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2020-11-17: last updated
- 2020-11-15: published
- Short URL
- https://ia.cr/2020/1403
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/1403,
author = {Syh-Yuan Tan and Ioannis Sfyrakis and Thomas Gross},
title = {A q-SDH-based Graph Signature Scheme on Full-Domain Messages with Efficient Protocols},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/1403},
year = {2020},
url = {https://eprint.iacr.org/2020/1403}
}