Results 201 to 210 of about 4,432 (251)
Some of the next articles are maybe not open access.
A scheme for threshold multi-secret sharing
Applied Mathematics and Computation, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chin-Chen Chang, Chao-Wen Chan
exaly +2 more sources
An efficient threshold verifiable multi-secret sharing
Computer Standards and Interfaces, 2008In 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.
Samaneh Mashhadi +1 more
exaly +2 more sources
A practical verifiable multi-secret sharing scheme
Computer Standards and Interfaces, 2007C.-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.
Jian-jie Zhao +2 more
exaly +2 more sources
An ideal multi-secret sharing scheme based on MSP
Information Sciences, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bing Zeng, Chingfang Hsu
exaly +3 more sources
A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing
Applied Mathematics and Computation, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Min Wang
exaly +3 more sources
A New Approach to Weighted Multi-Secret Sharing
2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), 2011Secret sharing is important in information and network security and has broad applications in the real world. Since an elegant secret sharing mechanism was first proposed by Shamir in 1979, many schemes have appeared in literature. These schemes deal with either single or multiple secrets and their shares have either the same weight or different ...
Xukai Zou +5 more
openaire +2 more sources
Linear multi-secret sharing schemes
Science in China Series F, 2005In 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.
Liangliang Xiao, Mulan Liu
openaire +1 more source
A Threshold Multi-secret Sharing Scheme
2008 IEEE International Conference on Networking, Sensing and Control, 2008This paper proposes a threshold multi-secret sharing scheme. In such a scheme, many secrets are shared in such a way that all secrets can be reconstructed independently without refreshing the shares. Every share is of the same size as that of any single shared secret in the proposed scheme.
Runhua Shi +3 more
openaire +1 more source
Sharing visual multi-secrets using circle shares
Computer Standards & Interfaces, 2005Traditional visual cryptography technique has provided sufficient security to fulfill the purpose of protecting confidential messages. In current technology, the same set of shares can be embedded with many sets of secret messages after one of the shares is rotated at different degrees.
Hsien-Chu Wu, Chin-Chen Chang 0001
openaire +1 more source
A (t,n) multi-secret sharing scheme
Applied Mathematics and Computation, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chou Chen Yang +2 more
openaire +2 more sources