Results 231 to 240 of about 211,108 (260)

Multi secret sharing with unexpanded meaningful shares

Multimedia Tools and Applications, 2017
Traditional Visual Cryptography (VC) facilitates a technique to protect only one secret image using single set of shares. Recent researches enhance the capabilities of traditional VC by providing the feature of Multi Secret Sharing (MSS), where more than one secret image can be protected at a time.
openaire   +1 more source

Linear multi-secret sharing schemes

Science in China Series F, 2005
In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access structures by using linear multi-secret sharing schemes is shown.
openaire   +1 more source

A scheme for threshold multi-secret sharing

Applied Mathematics and Computation, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chan, Chao-Wen, Chang, Chin-Chen
openaire   +1 more source

CRT based multi-secret sharing schemes: revisited

International Journal of Security and Networks, 2018
Secret sharing is a cryptographic primitive, which is used to distribute a secret among a set of participants in such a way that an authorised subset of participants can uniquely reconstruct the secret and an unauthorised subset can get no information about the secret.
Appala Naidu Tentu, V.Ch. Venkaiah, V. Kamakshi Prasad   +2 more
openaire   +2 more sources

A practical verifiable multi-secret sharing scheme

Computer Standards & Interfaces, 2007
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483-490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification.
Jianjie Zhao, Jianzhong Zhang, Rong Zhao
openaire   +1 more source

An efficient threshold verifiable multi-secret sharing

Computer Standards & Interfaces, 2008
In 2004, C.-C. Yang, T.-Y. Chang and M.-S. Hwang proposed an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir's secret sharing. In order to add the verifiable property into previous scheme, J. Shao and Z. Cao proposed an efficient (t,n) verifiable multi-secret sharing based on YCH [C.-C. Yang, T.-Y.
Massoud Hadian Dehkordi, Samaneh Mashhadi   +1 more
openaire   +1 more source

Verifiable Rational Multi-secret Sharing Scheme

2011
In this paper we mainly focus on the cheating problem and the incapability problem existed in rational secret sharing schemes. Based on current schemes and the related knowledge of bit commitment agreement, we proposed a verifiable rational multi-secret sharing scheme in which players can verify the identity of the dealer.
Yongquan Cai, Zhanhai Luo, Yi Yang
openaire   +1 more source

A practical dynamic multi-secret sharing scheme

2010 IEEE International Conference on Information Theory and Information Security, 2010
In this paper, we propose a practical dynamic multi-secret sharing scheme based on the intractability of the discrete logarithm and one way hash functions, the exclusive OR operation. Security analysis shows that our scheme could correctly reconstruct the shared secret, and our scheme is as secure as Lin-Yeh's scheme.
null Juan Qu, null Limin Zou, Jianzhong Zhang   +2 more
openaire   +1 more source

A hierarchical threshold multi-secret sharing scheme

2008 2nd International Conference on Anti-counterfeiting, Security and Identification, 2008
This paper first proposes a hierarchical threshold multi-secret sharing scheme based on solving the linearly independent equations. This scheme has the same power as T.Tassapsilas scheme, in which the participants of any authorized subset in the hierarchical threshold access structure can reconstruct the shared secret and the non-authorized subset ...
null Shi Runhua, null Zhong Hong
openaire   +1 more source

Sharing Multi-Secret Based on Circle Properties

2008 International Conference on Computational Intelligence and Security, 2008
A (t, n) threshold multi-secret sharing scheme based on the properties of a circle in multi-dimensional space is proposed in this paper. Only t or more shadows can reconstruct the secrets; while any less than t shadows cannot obtain any information of the secrets.
Lina Ge, Shaohua Tang
openaire   +1 more source