Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Mathematical Cryptology

Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran

Editorial Board: Blackburn, Simon R. / Blundo, Carlo / Burmester, Mike / Cramer, Ronald / Dawson, Ed / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Helleseth, Tor / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Lauter, Kristin / Lange, Tanja / Menezes, Alfred / Nguyen, Phong Q. / Pieprzyk, Josef / Rötteler, Martin / Safavi-Naini, Rei / Shparlinski, Igor E. / Stinson, Doug / Takagi, Tsuyoshi / Williams, Hugh C. / Yung, Moti

4 Issues per year


CiteScore 2017: 1.43

SCImago Journal Rank (SJR) 2017: 0.293
Source Normalized Impact per Paper (SNIP) 2017: 1.117

Mathematical Citation Quotient (MCQ) 2017: 0.51

Online
ISSN
1862-2984
See all formats and pricing
More options …
Volume 12, Issue 1

Issues

A survey and refinement of repairable threshold schemes

Thalia M. Laing
  • Corresponding author
  • Security Lab, HP Inc., Long Down Avenue, Stoke Gifford, Bristol, BS34 8QZ; and Information Security Group, Royal Holloway University of London, Egham, Surrey, TW20 0EX, United Kingdom
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Douglas R. Stinson
Published Online: 2018-02-09 | DOI: https://doi.org/10.1515/jmc-2017-0058

Abstract

We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers. We summarise and, where possible, refine existing RTSs and introduce a new parameter for analysis, called the repair metric. We then explore using secure regenerating codes as RTSs and find them to be immediately applicable. We compare all RTS constructions considered and conclude by presenting the best candidate solutions for when either communication complexity or information rate is prioritised.

Keywords: Threshold schemes; repairability; combinatorial designs; regenerating codes

MSC 2010: 94A62

References

  • [1]

    J. C. Benaloh, Secret sharing homomorphisms: Keeping shares of a secret secret, Advances in Cryptology – CRYPTO’ 86, Lecture Notes in Comput. Sci. 263 Springer, Berlin (1986), 251–260. Google Scholar

  • [2]

    G. R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference – AFIPS, Texas A&M University, College Station (1979), 313–317. Google Scholar

  • [3]

    G. R. Blakley and G. Kabatianski, Ideal perfect threshold schemes and MDS codes, Proceedings of IEEE International Symposium on Information Theory, IEEE, Piscataway (1995), 488–488. Google Scholar

  • [4]

    B. Chor and E. Kushilevitz, A communication-privacy tradeoff for modular addition, Inform. Process. Lett. 45 (1993), no. 4, 205–210. CrossrefGoogle Scholar

  • [5]

    A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright and K. Ramchandran, Network coding for distributed storage systems, IEEE Trans. Inform. Theory 56 (2010), no. 9, 4539–4551. Web of ScienceCrossrefGoogle Scholar

  • [6]

    S. Goparaju, S. El Rouayheb, R. Calderbank and H. Poor, Data secrecy in distributed storage systems under exact repair, Proceedings of International Symposium on Network Coding – NetCod, IEEE, Piscataway (2013), 1–6. Google Scholar

  • [7]

    S. Goparaju, A. Fazeli and A. Vardy, Minimum storage regenerating codes for all parameters, Proceedings of IEEE International Symposium on Information Theory – ISIT IEEE, Piscataway (2016), 76–80. Google Scholar

  • [8]

    X. Guang, J. Lu and F. Fu, Repairable threshold secret sharing schemes, preprint (2014), https://arxiv.org/abs/1410.7190.

  • [9]

    E. D. Karnin, J. W. Greene and M. E. Hellman, On secret sharing systems, IEEE Trans. Inform. Theory 29 (1983), no. 1, 35–41. CrossrefGoogle Scholar

  • [10]

    M. Nojoumian, Novel secret sharing and commitment schemes for cryptographic applications, Ph.D. thesis, University of Waterloo, 2012. Google Scholar

  • [11]

    M. Nojoumian, D. Stinson and M. Grainger, Unconditionally secure social secret sharing scheme, IET Inform. Secur. 4 (2010), no. 4, 202–211. Web of ScienceCrossrefGoogle Scholar

  • [12]

    S. Pawar, S. El Rouayheb and K. Ramchandran, On secure distributed data storage under repair dynamics, Proceedings of the IEEE Symposium on Information Theory Proceedings – ISIT, IEEE, Piscataway (2010), 2543–2547. Google Scholar

  • [13]

    K. Rashmi, N. Shah and P. Kumar, Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction, IEEE Trans. Inform. Theory 57 (2011), no. 8, 5227–5239. Web of ScienceCrossrefGoogle Scholar

  • [14]

    A. Rawat, A note on secure minimum storage regenerating codes, preprint (2016), https://arxiv.org/abs/1608.01732.

  • [15]

    N. Shah, K. Rashmi and P. V. Kumar, Information-theoretically secure regenerating codes for distributed storage, Proceedings of IEEE Global Telecommunications Conference – GLOBECOM, IEEE, Piscataway (2011), 1–5. Google Scholar

  • [16]

    A. Shamir, How to share a secret, Commun. ACM 22 (1979), no. 11, 612–613. CrossrefGoogle Scholar

  • [17]

    D. Stinson, Combinatorial Designs: Constructions and Analysis, Springer, New York, 2004. Google Scholar

  • [18]

    D. Stinson and R. Wei, Combinatorial repairability for threshold schemes, Des. Codes Cryptogr. 86 (2017), no. 1, 1–16. Google Scholar

  • [19]

    M. Ye and A. Barg, Explicit constructions of high-rate MDS array codes with optimal repair bandwidth, IEEE Trans. Inform. Theory 63 (2017), no. 4, 2001–2014. Web of ScienceCrossrefGoogle Scholar

About the article

Received: 2017-11-28

Revised: 2018-01-22

Accepted: 2018-02-02

Published Online: 2018-02-09

Published in Print: 2018-03-01


Funding Source: Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada

Award identifier / Grant number: RGPIN-03882

Research supported by NSERC discovery grant RGPIN-03882.


Citation Information: Journal of Mathematical Cryptology, Volume 12, Issue 1, Pages 57–81, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: https://doi.org/10.1515/jmc-2017-0058.

Export Citation

© 2018 Walter de Gruyter GmbH, Berlin/Boston.Get Permission

Comments (0)

Please log in or register to comment.
Log in