### Certification and Efficient Proofs of Committed Topology Graphs

Thomas Gross

##### Abstract

Digital signature schemes are a foundational cryptographic building block in certification and the projection of trust. Based on a signature scheme on committed graphs, we propose a toolkit of certification and proof methods to sign committed topology graphs and to prove properties of their certificates in zero-knowledge. This toolkit allows an issuer, such as an auditor, to sign the topology representation of an infrastructure. The prover, such as an infrastructure provider, can then convince a verifier of topology properties, such as partitions, connectivity or isolation, without disclosing the structure of the topology itself. By that, we can achieve the certification of the structure of critical systems, such as infrastructure clouds or outsourced systems, while still maintaining confidentiality. We offer zero-knowledge proofs of knowledge for a general specification language of security goals for virtualized infrastructures, such that high-level security goalscan be proven over the topology certificate. Our method builds upon the Camenisch-Lysyanskaya signature scheme, is based on honest-verifier proofs and the strong RSA assumption.

Available format(s)
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Graph signatures and proofs
Contact author(s)
thomas gross @ ncl ac uk
History
Short URL
https://ia.cr/2014/255

CC BY

BibTeX

@misc{cryptoeprint:2014/255,
author = {Thomas Gross},
title = {Certification and Efficient Proofs of Committed Topology Graphs},
howpublished = {Cryptology ePrint Archive, Paper 2014/255},
year = {2014},
note = {\url{https://eprint.iacr.org/2014/255}},
url = {https://eprint.iacr.org/2014/255}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.