A NEW (t , n) MULTI-SECRET SHARING SCHEME BASED ON LINEAR ALGEBRA

Seyed Hamed Hassani, Mohammad Reza Aref

2006

Abstract

In this paper, a new multi-secret threshold scheme based on linear algebra and matrices is proposed. Unlike many recently proposed methods, this method lets the use of conventional cryptographic algorithms in shar- ing multiple secrets. Our scheme is a multi-use scheme, which in some cases, the amount of computations is considerably reduced. Also, in this paper bounds on the maximum number of participants, for a given threshold value, are obtained.

Paper Citation

in Harvard Style

Hamed Hassani S. and Reza Aref M. (2006). A NEW (t , n) MULTI-SECRET SHARING SCHEME BASED ON LINEAR ALGEBRA . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006) ISBN 978-972-8865-63-4, pages 443-449. DOI: 10.5220/0002098704430449

in Bibtex Style

@conference{secrypt06,
author={Seyed Hamed Hassani and Mohammad Reza Aref},
title={A NEW (t , n) MULTI-SECRET SHARING SCHEME BASED ON LINEAR ALGEBRA},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006)},
year={2006},
pages={443-449},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002098704430449},
isbn={978-972-8865-63-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006)
TI - A NEW (t , n) MULTI-SECRET SHARING SCHEME BASED ON LINEAR ALGEBRA
SN - 978-972-8865-63-4
AU - Hamed Hassani S.
AU - Reza Aref M.
PY - 2006
SP - 443
EP - 449
DO - 10.5220/0002098704430449