An Efficient Group-Based Secret Sharing Scheme
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.
Unable to display preview. Download preview PDF.