Non-interactive verifiable secret sharing for monotone circuits

DOI10.1007/978-3-319-31517-1_12MaRDI QIDQ2814710zbMATH OpenOpenAlexFDO

Authors Ge Bai, Claudio Orlandi, Yu Xia, Ivan B. Damgård

Publication date 22 June 2016

Published in Progress in Cryptology – AFRICACRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-31517-1_12

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 176545
• Secure publicly verifiable and proactive secret sharing schemes with general access structure
• Applied Cryptography and Network Security
• Paillier-based publicly verifiable (non-interactive) secret sharing
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme

Cited in

(6)

• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• A verifiable secret sharing scheme using non-abelian groups
• Applied Cryptography and Network Security
• Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
• Non-interactive zero-sharing with applications to private distributed decision making
• Strong \((n, t, n)\) verifiable secret sharing scheme

This page was built for publication: Non-interactive verifiable secret sharing for monotone circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814710)