Search dblp for Publications

export results for "Nearly optimal robust secret sharing."

 download as .bib file

@inproceedings{DBLP:conf/crypto/ManurangsiSV20,
  author       = {Pasin Manurangsi and
                  Akshayaram Srinivasan and
                  Prashant Nalini Vasudevan},
  editor       = {Daniele Micciancio and
                  Thomas Ristenpart},
  title        = {Nearly Optimal Robust Secret Sharing Against Rushing Adversaries},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2020 - 40th Annual International
                  Cryptology Conference, {CRYPTO} 2020, Santa Barbara, CA, USA, August
                  17-21, 2020, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12172},
  pages        = {156--185},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-56877-1\_6},
  doi          = {10.1007/978-3-030-56877-1\_6},
  timestamp    = {Mon, 28 Aug 2023 21:17:50 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/ManurangsiSV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/Cheraghchi19,
  author       = {Mahdi Cheraghchi},
  title        = {Nearly optimal robust secret sharing},
  journal      = {Des. Codes Cryptogr.},
  volume       = {87},
  number       = {8},
  pages        = {1777--1796},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10623-018-0578-y},
  doi          = {10.1007/S10623-018-0578-Y},
  timestamp    = {Tue, 20 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/Cheraghchi19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ManurangsiSV19,
  author       = {Pasin Manurangsi and
                  Akshayaram Srinivasan and
                  Prashant Nalini Vasudevan},
  title        = {Nearly Optimal Robust Secret Sharing against Rushing Adversaries},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1131},
  year         = {2019},
  url          = {https://eprint.iacr.org/2019/1131},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/ManurangsiSV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/Cheraghchi16,
  author       = {Mahdi Cheraghchi},
  title        = {Nearly optimal robust secret sharing},
  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
                  Barcelona, Spain, July 10-15, 2016},
  pages        = {2509--2513},
  publisher    = {{IEEE}},
  year         = {2016},
  url          = {https://doi.org/10.1109/ISIT.2016.7541751},
  doi          = {10.1109/ISIT.2016.7541751},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isit/Cheraghchi16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Cheraghchi15,
  author       = {Mahdi Cheraghchi},
  title        = {Nearly Optimal Robust Secret Sharing},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {951},
  year         = {2015},
  url          = {http://eprint.iacr.org/2015/951},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/Cheraghchi15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics