Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ

DOI10.1007/978-3-030-84252-9_21MaRDI QIDQ2129013zbMATHOpenAlexFDO

Authors Benny Applebaum, Oded Nir

Publication date 22 April 2022

Full work available at URL https://doi.org/10.1007/978-3-030-84252-9_21

zbMATH Keywords

random mixture of upslicessecret-sharing complexity

Mathematics Subject Classification ID

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

Recommendations

• Towards breaking the exponential barrier for general secret sharing
• Breaking the circuit-size barrier in secret sharing
• Publication:3202940
• Secret sharing lower bound: either reconstruction is hard or shares are long
• The share size of secret-sharing schemes for almost all access structures and graphs

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 176567 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 503242 (Why is no real title available?)
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• scientific article; zbMATH DE number 1024000 (Why is no real title available?)
• A minimal model for secure computation (extended abstract)
• Advances in Cryptology - EUROCRYPT 2004
• Alternative Protocols for Generalized Oblivious Transfer
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
• Distribution design
• Generalized oblivious transfer by secret sharing
• How to share a secret
• Lifting Nullstellensatz to monotone span programs over any field
• Linear secret-sharing schemes for forbidden graph access structures
• Multiple assignment scheme for sharing secret
• Secret sharing and duality
• Secret-Sharing Schemes: A Survey
• Secret-sharing schemes for general and uniform access structures
• Strongly exponential lower bounds for monotone computation
• The share size of secret-sharing schemes for almost all access structures and graphs
• The size of a share must be large
• Towards breaking the exponential barrier for general secret sharing
• Zero-information protocols and unambiguity in Arthur-Merlin communication

Cited in

(4)

• Cryptography with weights: MPC, encryption and signatures
• Succinct computational secret sharing
• Improved polynomial secret-sharing schemes
• How to prove statements obliviously?

This page was built for publication: Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)

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