How to make any computational secret sharing scheme adaptively secure

DOI10.1007/978-3-032-01884-7_11MaRDI QIDQ6863901zbMATH OpenFDO

Authors George Lu, Brent Waters

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01884-7_11

zbMATH Keywords

computational secret sharing schemessecure secret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• An efficient existentially unforgeable signature scheme and its applications
• Be adaptive, avoid overcommitting
• Breaking the circuit size barrier for secure computation under DDH
• Foundations of homomorphic secret sharing
• Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
• Functional encryption: new perspectives and lower bounds
• How to share a secret
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1024051 (Why is no real title available?)
• scientific article; zbMATH DE number 4193603 (Why is no real title available?)
• Impossibility of simulation secure functional encryption even with random oracles
• Progress in Cryptology - INDOCRYPT 2003
• Secret sharing schemes for very dense graphs
• Secret-sharing for \(\mathbf {NP}\)
• Succinct computational secret sharing

This page was built for publication: How to make any computational secret sharing scheme adaptively secure

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