An efficient group-based secret sharing scheme

Authors:
Chunli Lv;Xiaoqi Jia;Jingqiang Lin;Jiwu Jing;Lijun Tian
Affiliations:
State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences and College of Information and Electrical Engineering, China Agricultural University;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences;College of Information and Electrical Engineering, China Agricultural University
Venue:
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Year:
2011

Citing 11
Cited 0

Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group

SIAM Journal on Discrete Mathematics
How to share a secret

Communications of the ACM
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Byzantine-Tolerant Erasure-Coded Storage

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
An approach for fault tolerant and secure data storage in collaborative work environments

Proceedings of the 2005 ACM workshop on Storage security and survivability
A Strong Ramp Secret Sharing Scheme Using Matrix Projection

WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
A New (k,n)-Threshold Secret Sharing Scheme and Its Extension

ISC '08 Proceedings of the 11th international conference on Information Security
Unidirectional key distribution across time and space with applications to RFID security

SS'08 Proceedings of the 17th conference on Security symposium
RFID privacy using spatially distributed shared secrets

UCS'07 Proceedings of the 4th international conference on Ubiquitous computing systems
Secret-sharing based secure communication protocols for passive RFIDs

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A Secure Storage System Combining Secret Sharing Schemes and Byzantine Quorum Mechanisms

CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology

Quantified Score

Hi-index	0.00

Visualization

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.