GSL: A Cryptographic Library for the strong RSA Graph Signature Scheme

TL;DR

This paper introduces GSL, a Java-based cryptographic library implementing the Graph Signature scheme, enabling privacy-preserving certification and proof of graph-structured data without revealing sensitive topology details.

Contribution

The paper presents the design, implementation, and benchmarking of GSL, a novel cryptographic library for the strong RSA Graph Signature scheme.

Findings

Successfully implemented GSL in Java

Demonstrated efficient performance through benchmarking

Enables privacy-preserving proofs over graph topologies

Abstract

Current cloud and network infrastructures do not employ privacy-preserving methods to protect their assets. Anonymous credential schemes are a cryptographic building block that enables the certification of data structures and prove properties over their representations without disclosing the innards of their data structures in zero-knowledge. The GRaph Signature (GRS) scheme enables the certification and proof methods to sign infrastructure topologies represented as graph data structures and use zero-knowledge to prove properties over their certificates. As such, they represent a powerful privacy-preserving method that proves properties over a signed topology graph to another party without disclosing the blueprint of its topology. In this paper, we report our efforts in designing, implementing and benchmarking a Graph Signature Library (GSL). GSL is a cryptographic library realized in Java that implements the graph signature scheme.