Browse by author
Lookup NU author(s): Dr Syh Yuan TanORCiD,
Dr Ioannis SfyrakisORCiD,
Professor Thomas Gross
This is the authors' accepted manuscript of a report published in its final definitive form in 2020. For re-use rights please refer to the publishers terms and conditions.
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 ecient 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 o↵ers 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.
Author(s): Tan SY, Sfyrakis I, Gross T
Publication type: Report
Publication status: Published
Type: ePrint Report
Online publication date: 17/11/2020
Acceptance date: 10/11/2020
Report Number: 2020/1403
Place Published: Cryptology ePrint Archive