A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer

LI Meng; YU Jia; HAO Rong

doi:10.1049/cje.2017.01.026

Volume 26 Issue 2

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2017 > 26(2): 313-318

LI Meng, YU Jia, HAO Rong, “A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer,” Chinese Journal of Electronics, vol. 26, no. 2, pp. 313-318, 2017, doi: 10.1049/cje.2017.01.026

Citation:

LI Meng, YU Jia, HAO Rong, “A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer,” Chinese Journal of Electronics, vol. 26, no. 2, pp. 313-318, 2017, doi: 10.1049/cje.2017.01.026

Citation:

PDF( 219 KB)

A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer

doi: 10.1049/cje.2017.01.026

LI Meng¹,
YU Jia^{1,2
,},
HAO Rong¹

1.
College of Computer Science and Technology, Qingdao University, Qingdao 266071, China;
2.
Shandong Provincial Key Laboratory of Computer Network, Jinan 250014, China

Funds: This research is supported by the National Natural Science Foundation of China (No.61572267, No.61272425, No.61402245), Shandong provincial Key Laboratory of Computer Network (No.SDKLCN-2013-03), PAPD and CICAEET.

More Information

Corresponding author: YU Jia (corresponding author) was born in 1976. He received Ph. D. degree in Institute of Network Security from Shandong University. He is a professor of the College of Information Engineering and the department director of Information Security at Qingdao University. His research interests include cloud computing security, key evolving cryptography, digital signature, security protocol, and network security. (Email:qduyujia@gmail.com)
Received Date: 2014-11-18
Rev Recd Date: 2015-07-01
Publish Date: 2017-03-10

Abstract

Abstract

We proposed a verifiable multi-secret sharing scheme without a dealer. We use cellular automata, having the properties of linear computations and parallel computations, to construct our scheme. The linear computational property makes it possible to build a scheme without the assistance of a trusted dealer, and the parallel computational property contributes to the high efficiency of the scheme. Hash function is used to realize the verification of shares, which also makes our scheme more efficient. The security of the scheme is also analyzed.
- Multi-secret sharing,
- Verifiability,
- Trusted dealer,
- Cellular automata,
- Hash function

FullText(HTML)

References(26)

References

A. Shamir, "How to share a secret", Communications of the ACM, Vol.22, No.11, pp.612-613, 1979.

G.R. Blakley, "Safeguarding cryptographic keys", Proceeding of the 1979 AFIPS National Computer Conference, AFIPS Press, pp.313-317, 1979.

J. Li, X.L. Li, B. Yang, X.M. Sun, "Segmentation-based image copy-move forgery detection scheme", IEEE Transactions on Information Forensics and Security, Vol.10, No.3, pp.507-518, 2015.

J. Yu, K. Ren, C. Wang, V. Varadharajan, "Enabling cloud storage auditing with key-exposure resistance", IEEE Transactions on Information Forensics and Security, Vol.10, No.6, pp.1167-1179, 2015.

J. Yu, K. Ren, C. Wang, "Enabling cloud storage auditing with verifiable outsourcing of key updates", IEEE Transactions on Information Forensics and Security, 2016, Vol.11, No.5. DOI 10.1109/TIFS.2016.2528500.

S. Iftene, "General secret sharing based on the Chinese remainder theorem with applications in e-voting", Electronic Notes in Theoretical Computer Science, Vol.186, pp.67-84, 2007.

R. Cramer, I. Damgard and U. Maurer, "General secure multi-party computation from any linear secret-sharing scheme", Computer Science, Vol.1807, pp.316-334, 2000.

P. Guo, J. Wang, B. Li, S. Lee, "A variable threshold-value authentication architecture for wireless mesh networks", Journal of Internet Technology, Vol.15, No.6, pp.929-936, 2014.

J. Shen, H.W. Tan, J. Wang, J.W. Wang, S. Lee, "A novel routing protocol providing good transmission reliability in underwater sensor networks", Journal of Internet Technology, Vol.16, No.1, pp.171-178, 2015.

Y.J. Ren, J. Shen, J. Wang, J. Han, S. Lee, "Mutual verifiable provable data auditing in public cloud storage", Journal of Internet Technology, Vol.16, No.2, pp.317-323, 2015.

S.D. Xie, Y.X. Wang, "Construction of tree network with limited delivery latency in homogeneous wireless sensor networks", Wireless Personal Communications, Vol.78, No.1, pp.231-246, 2014.

J. He and E. Dawson, "Multistage secret sharing based on one-way function", Electronics Letter, Vol.30, No.19, pp.1591-1592, 1994.

J. He and E. Dawson, "Multi secret-sharing scheme based on one-way function", Electronics Letter, Vol.31, No.2, pp.93-95, 1995.

M.H. Dehkordi and S. Mashhadi, "An efficient threshold verifiable multi-secret sharing", Computer Standards & Interfaces, Vol.30, No.3, pp.187-190, 2008.

H. Zhao, J.Z. Sun, F.Y. Wang and L. Zhao, "A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial", Security Communication Networks, Vol.6, No.9, pp.1169-1175, 2013.

J. Herranz, A. Ruiz and G. Sáez, "New results and applications for multi-secret sharing schemes", Designs, Codes and Cryptography, Vol.73, No.3, pp.841-864, 2013.

B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, "Verifiable secret sharing and achieving simultaneity in the presence of faults", Proceeding of 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, IEEE, pp.383-395, 1985.

P. Feldman, "A practical scheme for non-interactive verifiable secret sharing", Proceeding of 28th IEEE Symposium on Foundations of Computer Science, Los Angeles, IEEE, pp.427-437, 1987.

T.P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing", Advances in Cryptology-CRYPTO'91, Berlin Heidelberg, Springer, Vol.576, pp.129-140, 1992.

I. Ingemarsson and G.J. Simmons, "A protocol to set up shared secret schemes without the assistance of a mutually trusted party", Advances in Cryptology-CRYPTO'90, Berlin Heidelberg, Springer, Vol.473, pp.226-282, 1991.

T.P. Pedersen, "A threshold cryptosystem without a trusted party", Advances in Cryptology-CRYPTO'91, Berlin Heidelberg, Springer, Vol.547, pp.522-526, 1991.

S.Wolfram, "Random sequence generation by cellular automata", Advances in Applied Mathematics, Vol.7, No.2, pp.123-169, 1986.

A. Martíndel Rey, J. Pereira Mateus and G. Rodríguez Sánchez, "A secret sharing scheme based on cellular automata", Applied Mathematics and Computation, Vol.170, No.2, pp.1356-1364, 2005.

G. Alvarez, L.H. Encinas and A. Martin del Rey,"A multisecret sharing scheme for color images based on cellular automata", Information Sciences, Vol.178, No.22, pp.4382-4395, 2008.

Z. Eslami and J.Z. Ahmadabadi, "A verifiable multi-secret sharing scheme based on cellular automata", Information Sciences, Vol.180, No.15, pp.2889-2894, 2010.

J. Yu, Y.K. Chen, R. Hao, F.Y. Kong, X.G. Cheng, and Z.K. Pan, "Publicly verifiable multi-secret sharing without trusted centers", Chinese Journal of Computers, Vol.37, No.5, pp.1030-1038, 2014.

Relative Articles

Supplements(0)

Cited By

Proportional views