Chapter

Information Security Practice and Experience

Volume 6672 of the series Lecture Notes in Computer Science pp 288-301

An Efficient Group-Based Secret Sharing Scheme

  • Chunli LvAffiliated withState Key Laboratory of Information Security, Graduate University of Chinese Academy of SciencesCollege of Information and Electrical Engineering, China Agricultural University
  • , Xiaoqi JiaAffiliated withState Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences
  • , Jingqiang LinAffiliated withState Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences
  • , Jiwu JingAffiliated withState Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences
  • , Lijun TianAffiliated withCollege of Information and Electrical Engineering, China Agricultural University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We propose a new secret sharing scheme which can be computed over an Abelian group, such as (Binary string, XOR) and (Integer, Addition). Therefore, only the XOR or the addition operations are required to implement the scheme. It is very efficient and fits for low-cost low-energy applications such as RFID tags. Making shares has a geometric presentation which makes our scheme be easily understood and analyzed.