Paper 2010/609
The Round Complexity of General VSS
Ashish Choudhury, Kaoru Kurosawa, and Arpita Patra
Abstract
The round complexity of verifiable secret sharing (VSS) schemes has been studied extensively for threshold adversaries. In particular, Fitzi et al. showed an efficient 3-round VSS for
Metadata
- Available format(s)
-
PDF PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Round ComplexityVSSNon-thresholdByzantineUnbounded Computing Power.
- Contact author(s)
-
partho_31 @ yahoo co in
kurosawa @ mx ibaraki ac jp
arpitapatra10 @ gmail com
arpita @ cs au dk - History
- 2010-11-30: received
- Short URL
- https://ia.cr/2010/609
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/609, author = {Ashish Choudhury and Kaoru Kurosawa and Arpita Patra}, title = {The Round Complexity of General {VSS}}, howpublished = {Cryptology {ePrint} Archive, Paper 2010/609}, year = {2010}, url = {https://eprint.iacr.org/2010/609} }