Skip to main navigation Skip to search Skip to main content

A non-interactive modular verifiable secret sharing scheme

  • Qiong Li*
  • , Zhifang Wang
  • , Xiamu Niu
  • , Shenghe Sun
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we prove that Asmuth et al.'s verifiable secret sharing scheme is not realizable although their basic modular secret sharing scheme is efficient and perfect. An efficient non-interactive modular verifiable secret sharing scheme is proposed based on their basic scheme. The verification needs about (2| q| n+(n-1))r multiplications. The secret recovery takes O(r) operations while Shamir's scheme takes O(r log2 r) operations. It is also shown that the scheme is a perfect secret sharing scheme.

Original languageEnglish
Title of host publication2005 International Conference on Communications, Circuits and Systems - Proceedings
Pages84-87
Number of pages4
StatePublished - 2005
Event2005 International Conference on Communications, Circuits and Systems - Hong Kong, China
Duration: 27 May 200530 May 2005

Publication series

Name2005 International Conference on Communications, Circuits and Systems - Proceedings
Volume1

Conference

Conference2005 International Conference on Communications, Circuits and Systems
Country/TerritoryChina
CityHong Kong
Period27/05/0530/05/05

Fingerprint

Dive into the research topics of 'A non-interactive modular verifiable secret sharing scheme'. Together they form a unique fingerprint.

Cite this