MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves

Details MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves

2006-08-14

arxiv.org/abs/cs/0608055v2

Computer Science

Cryptography and Security

Scientific paper

For a secret sharing scheme, two parameters $d_{min}$ and $d_{cheat}$ are defined in [12] and [13]. These two parameters measure the error-correcting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [12,[9] and [13]. The MDS secret-sharing scheme was defined in [12] and it is proved that MDS perfect secret sharing scheme can be constructed for any monotone access structure. The famous Shamir $(k,n)$ threshold secret sharing scheme is the MDS with $d_{min}=d_{cheat}=n-k+1$. In [3] we proposed the linear secret sharing scheme from algebraic-geometric codes. In this paper the linear secret sharing scheme from AG-codes on elliptic curves is studied and it is shown that many of them are MDS linear secret sharing scheme.

Affiliated with

Also associated with

No associations

Rating

MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242626