
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Efficient ZeroKnowledge Proofs of Graph Signature for Connectivity and Isolation Using BilinearMap Accumulator
Toru NAKANISHI Hiromi YOSHINO Tomoki MURAKAMI GuruVamsi POLICHARLA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E105A
No.3
pp.389403 Publication Date: 2022/03/01 Publicized: 2021/09/08 Online ISSN: 17451337
DOI: 10.1587/transfun.2021TAP0003 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Cryptography and Information Security Keyword: zeroknowledge proofs, signatures, graph, bilinear map, accumulator, pairing,
Full Text: PDF(2.3MB)>>
Summary:
To prove the graph relations such as the connectivity and isolation for a certified graph, a system of a graph signature and proofs has been proposed. In this system, an issuer generates a signature certifying the topology of an undirected graph, and issues the signature to a prover. The prover can prove the knowledge of the signature and the graph in the zeroknowledge, i.e., the signature and the signed graph are hidden. In addition, the prover can prove relations on the certified graph such as the connectivity and isolation between two vertexes. In the previous system, using integer commitments on RSA modulus, the graph relations are proved. However, the RSA modulus needs a longer size for each element. Furthermore, the proof size and verification cost depend on the total numbers of vertexes and edges. In this paper, we propose a graph signature and proof system, where these are computed on bilinear groups without the RSA modulus. Moreover, using a bilinear map accumulator, the prover can prove the connectivity and isolation on a graph, where the proof size and verification cost become independent from the total numbers of vertexes and edges.


