Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation. Cafaro, M. & Pellè, P. IEEE Trans. Cloud Computing, 6(2):453–463, 2018. 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
{"_id":"bh6oTMPBM4tCmzTSW","bibbaseid":"cafaro-pell-spaceefficientverifiablesecretsharingusingpolynomialinterpolation-2018","downloads":0,"creationDate":"2018-11-29T22:52:56.333Z","title":"Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation","author_short":["Cafaro, M.","Pellè, P."],"year":2018,"bibtype":"article","biburl":"https://dblp.org/pid/c/MassimoCafaro.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Massimo"],"propositions":[],"lastnames":["Cafaro"],"suffixes":[]},{"firstnames":["Piergiuseppe"],"propositions":[],"lastnames":["Pellè"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/tcc/CafaroP18,\n author = {Massimo Cafaro and\n Piergiuseppe Pell{\\`{e}}},\n title = {Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation},\n journal = {{IEEE} Trans. Cloud Computing},\n volume = {6},\n number = {2},\n pages = {453--463},\n year = {2018},\n url = {https://doi.org/10.1109/TCC.2015.2396072},\n doi = {10.1109/TCC.2015.2396072},\n timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/journals/tcc/CafaroP18},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Cafaro, M.","Pellè, P."],"key":"DBLP:journals/tcc/CafaroP18","id":"DBLP:journals/tcc/CafaroP18","bibbaseid":"cafaro-pell-spaceefficientverifiablesecretsharingusingpolynomialinterpolation-2018","role":"author","urls":{"Paper":"https://doi.org/10.1109/TCC.2015.2396072"},"downloads":0},"search_terms":["space","efficient","verifiable","secret","sharing","using","polynomial","interpolation","cafaro","pellè"],"keywords":[],"authorIDs":[],"dataSources":["fq2DsbCb52dGPpijo"]}