A New (k, n)-Threshold Secret Sharing Scheme and Its Extension

@article{Kurihara2008AN,
  title={A New (k, n)-Threshold Secret Sharing Scheme and Its Extension},
  author={Jun Kurihara and Shinsaku Kiyomoto and Kazuhide Fukushima and Toshiaki Tanaka},
  journal={IACR Cryptology ePrint Archive},
  year={2008},
  volume={2008},
  pages={409}
}
Abstract. In Shamir’s (k, n)-threshold secret sharing scheme (threshold scheme), a heavy computational cost is required to make n shares and recover the secret. As a solution to this problem, several fast threshold schemes have been proposed. This paper proposes a new (k, n)threshold scheme. For the purpose to realize high performance, the proposed scheme uses just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret. We prove that the proposed scheme is a perfect secret sharing… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS
34 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

65 Citations

01020'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

On secret sharing systems using (k, L, n) threshold scheme,

  • H. Yamamoto
  • IEICE Trans. Fundamentals (Japanese Edition), vol…
  • 1985
Highly Influential
4 Excerpts

2, n)-threshold secret sharing systems based on binary matrices,

  • N. Hosaka, K. Tochikubo, Y. Fujii, M. Tada, T. Kato
  • Proc. SCIS2007,
  • 2007
1 Excerpt

A note on information rate for fast threshold schemes,

  • H. Kunii, M. Tada
  • Proc. CSS2006,
  • 2006
1 Excerpt

A fast (2, n)-threshold scheme and its application,

  • Y. Fujii, M. Tada, N. Hosaka, K. Tochikubo, T. Kato
  • Proc. CSS2005,
  • 2005
2 Excerpts

A study on long-term storage of electronic data,

  • H. Ishizu, T. Ogihara
  • Proc. IEICE General Conf., D-9-10,
  • 2004
1 Excerpt

How to convert 1-out-of-n proof into k-out-of-n proof,

  • N. Shiina, T. Okamoto, E. Okamoto
  • Proc. SCIS2004,
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…