On secret sharing for graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.
11 pages

Keywords

Cryptography and Security, D.4.6; E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31847

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0310052
 http://arxiv.org/abs/cs/0310052

Collections

arXiv