Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes

DOI10.1007/978-3-030-45721-1_18zbMath1479.94304OpenAlexW2982514851MaRDI QIDQ2055621

Ronald Cramer, Xing, Chaoping

Publication date: 1 December 2021

Full work available at URL: https://ir.cwi.nl/pub/30154

zbMATH Keywords

blackbox secret sharingfoundations of secret sharing

Mathematics Subject Classification ID

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

Related Items (2)

How to recover a secret with \(O(n)\) additions ⋮ On abelian and homomorphic secret sharing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the amortized complexity of zero-knowledge protocols
• On the asymptotic behaviour of some towers of function fields over finite fields
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Threshold Secret Sharing Requires a Linear Size Alphabet
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• Short monotone formulae for the majority function
• Algebraic Function Fields and Codes
• Construction of global function fields from linear codes and vice versa
• Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
• Bounds on the Threshold Gap in Secret Sharing and its Applications
• Secure Computation from Random Error Correcting Codes
• Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
• Secure Multiparty Computation and Secret Sharing
• Public Key Cryptography - PKC 2006

This page was built for publication: Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes