IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-18275-9_14.html
   My bibliography  Save this book chapter

Threshold Secret Sharing Through Multivariate Birkhoff Interpolation

In: Computation, Cryptography, and Network Security

Author

Listed:
  • Vasileios E. Markoutis

    (University of Patras, Department of Mathematics)

  • Gerasimos C. Meletiou

    (A.T.E.I. of Epirus)

  • Aphrodite N. Veneti

    (University of Piraeus, Department of Informatics)

  • Michael N. Vrahatis

    (University of Patras, Computational Intelligence Laboratory (CILab), Department of Mathematics)

Abstract

Secret sharing schemes have been well studied and widely used in different aspects of real life applications. The original secret sharing scheme was proposed by Adi Shamir in 1979. A similar scheme was also invented independently in the same year by George Blakley. Shamir’s scheme is based on Lagrange interpolation while Blakley’s approach uses principles of hyperplane geometry. In 2007, Tamir Tassa proposed a hierarchical secret sharing scheme through univariate Birkhoff interpolation (a generalization of Lagrangian and Hermitian interpolation). In the contribution at hand we investigate the idea of generalizing Tassa’s scheme through multivariate Birkhoff interpolation. We consider the problem of finding secret sharing schemes with multilevel structures and partially ordered sets of levels of participants. In order to ensure that our scheme meets the necessary requirements, we use totally nonsingular matrices.

Suggested Citation

  • Vasileios E. Markoutis & Gerasimos C. Meletiou & Aphrodite N. Veneti & Michael N. Vrahatis, 2015. "Threshold Secret Sharing Through Multivariate Birkhoff Interpolation," Springer Books, in: Nicholas J. Daras & Michael Th. Rassias (ed.), Computation, Cryptography, and Network Security, pages 331-350, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-18275-9_14
    DOI: 10.1007/978-3-319-18275-9_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-18275-9_14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.