%0 Conference Proceedings
%T Analysis of VMSS Schemes for Group Key Transfer Protocol
%+ Central China Normal University [Wuhan, China]
%+ Wuhan Technology and Business University
%A Hsu, Ching-Fang
%A Wu, Shan
%Z Part 6: Poster Sessions
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Network and Parallel Computing (NPC)
%C Ilan, Taiwan
%Y Ching-Hsien Hsu
%Y Xuanhua Shi
%Y Valentina Salapura
%I Springer
%3 Network and Parallel Computing
%V LNCS-8707
%P 555-558
%8 2014-09-18
%D 2014
%R 10.1007/978-3-662-44917-2_51
%Z Computer Science [cs]Conference papers
%X Known group key transfer protocols in group communications using classical secret sharing require that a t-degree interpolating polynomial be computed in order to encrypt and decrypt the secret group key. Secret sharing plays an important role in ensuring the group communications security. A verifiable multi-secret sharing (VMSS) scheme is a multi-secret sharing scheme with the verifiable property. Recently, Zhao et al. and Dehkordi et al. successively proposed two threshold VMSS schemes. Shortly, using the same verification mechanism, Dehkordi et al. presented another two VMSS schemes. In these schemes, authors claimed that the dealer was absolutely impossible to become a cheater. In this paper, we show that in both Zhao scheme and Dehkordi scheme, a dishonest dealer may distribute a fake share to a certain participant, and then that participant would subsequently never obtain the true secret. Indeed, verification mechanism should be improved in these schemes; and furthermore our results highlight that extra cautions still be exercised when constructing schemes in this direction.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01403141/document
%2 https://inria.hal.science/hal-01403141/file/978-3-662-44917-2_51_Chapter.pdf
%L hal-01403141
%U https://inria.hal.science/hal-01403141
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-LNCS-8707
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3