Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)

DOI10.1007/978-3-030-84252-9_21zbMath1487.94147OpenAlexW3158616655MaRDI QIDQ2129013

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)

Related Items (1)

Cryptography with weights: MPC, encryption and signatures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• Generalized oblivious transfer by secret sharing
• Multiple assignment scheme for sharing secret
• The size of a share must be large
• Towards breaking the exponential barrier for general secret sharing
• Linear secret-sharing schemes for forbidden graph access structures
• Secret sharing and duality
• The share size of secret-sharing schemes for almost all access structures and graphs
• Secret-sharing schemes for general and uniform access structures
• Distribution Design
• A minimal model for secure computation (extended abstract)
• Secret-Sharing Schemes: A Survey
• How to share a secret
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
• Strongly exponential lower bounds for monotone computation
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Lifting Nullstellensatz to monotone span programs over any field
• Advances in Cryptology - EUROCRYPT 2004
• Alternative Protocols for Generalized Oblivious Transfer

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