Non-Interactive Verifiable Secret Sharing For Monotone Circuits

Ge Bai; Ivan Damgård; Claudio Orlandi; Yu Xia

Paper 2016/078

Non-Interactive Verifiable Secret Sharing For Monotone Circuits

Ge Bai, Ivan Damgård, Claudio Orlandi, and Yu Xia

Abstract

We propose a computationally secure and non-interactive verifiable secret sharing scheme that can be efficiently constructed from any monotone Boolean circuit. By non-interactive we mean that the dealer needs to be active only once, where he posts a public message as well as a private message to each shareholder. In the random oracle model, we can even avoid interaction between shareholders. By efficient, we mean that we avoid generic zero-knowledge techniques. Such efficient constructions were previously only known from linear secret sharing schemes (LSSS). It is believed that the class of access structures that can be handled with polynomial size LSSS is incomparable to the class that can be recognized by polynomial size monotone circuits, so in this sense we extend the class of access structures with efficient and non-interactive VSS.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. AFRICACRYPT 2016
Keywords: computational secret-sharing
Contact author(s): orlandi @ cs au dk
History: 2016-01-28: received
Short URL: https://ia.cr/2016/078
License: CC BY

BibTeX

@misc{cryptoeprint:2016/078,
      author = {Ge Bai and Ivan Damgård and Claudio Orlandi and Yu Xia},
      title = {Non-Interactive Verifiable Secret Sharing For Monotone Circuits},
      howpublished = {Cryptology ePrint Archive, Paper 2016/078},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/078}},
      url = {https://eprint.iacr.org/2016/078}
}