On the Power of Amortization in Secret Sharing

DOI10.1145/3417756MaRDI QIDQ5862286zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Barak Arkis

Publication date 7 March 2022

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3417756

zbMATH Keywords

conditional disclosure of secretssecret sharing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
• Brief announcement: Optimal amortized secret sharing with cheater identification
• On \(d\)-multiplicative secret sharing
• On the information rate of secret sharing schemes
• scientific article; zbMATH DE number 708803
• Tight bounds on the information rate of secret sharing schemes
• Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
• On the information rate of perfect secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• Secret Sharing, Rank Inequalities, and Information Inequalities

Cited in

(6)

• On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
• Quadratic secret sharing and conditional disclosure of secrets
• Randomness recoverable secret sharing schemes
• Cryptographic tests of the python's lunch conjecture
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• On the communication complexity of PSM and CDS for symmetric functions

This page was built for publication: On the Power of Amortization in Secret Sharing

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