On secret sharing for graphs

Simple item page
dc.creatorKulesza, Kamil
dc.creatorKotulski, Zbigniew
dc.date2003-10-28
dc.date.accessioned2026-07-07T03:20:30Z
dc.date.available2026-07-07T03:20:30Z
dc.descriptionIn the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for "graph to number" conversion methods. Hence, the existing schemes can be used, without weakening their properties. Next, we show how graph properties can be used to extend capabilities of secret sharing schemes. This leads to proposal of using such properties for number based secret sharing.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/cs/0310052
dc.identifierhttp://arxiv.org/abs/cs/0310052
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31847
dc.subjectCryptography and Security
dc.subjectD.4.6; E.4
dc.titleOn secret sharing for graphs
dc.typetext

Files

Collections

arXiv