An Efficient Group-Based Secret Sharing Scheme

  • Chunli Lv
  • Xiaoqi Jia
  • Jingqiang Lin
  • Jiwu Jing
  • Lijun Tian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6672)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chunli Lv
    • 1
    • 3
  • Xiaoqi Jia
    • 2
  • Jingqiang Lin
    • 1
  • Jiwu Jing
    • 1
  • Lijun Tian
    • 3
  1. 1.State Key Laboratory of Information SecurityGraduate University of Chinese Academy of SciencesChina
  2. 2.State Key Laboratory of Information SecurityInstitute of Software, Chinese Academy of SciencesChina
  3. 3.College of Information and Electrical EngineeringChina Agricultural UniversityChina

Personalised recommendations