Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation. Cafaro, M. & Pellè, P. IEEE Trans. Cloud Computing, 6(2):453–463, 2018.
Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation [link]Paper  doi  bibtex   
@article{DBLP:journals/tcc/CafaroP18,
  author    = {Massimo Cafaro and
               Piergiuseppe Pell{\`{e}}},
  title     = {Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation},
  journal   = {{IEEE} Trans. Cloud Computing},
  volume    = {6},
  number    = {2},
  pages     = {453--463},
  year      = {2018},
  url       = {https://doi.org/10.1109/TCC.2015.2396072},
  doi       = {10.1109/TCC.2015.2396072},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcc/CafaroP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0