Fully anonymous secret sharing

DOI10.1007/978-3-032-01884-7_12MaRDI QIDQ6863900zbMATH OpenFDO

Authors Allison Bishop, Matthew D. Green, Yuval Ishai, Abhishek Jain, Paul Lou

Publication date 4 February 2026

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

zbMATH Keywords

Reed-Solomon codesanonymous reconstruction

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 1024000 (Why is no real title available?)
• scientific article; zbMATH DE number 1775399 (Why is no real title available?)
• scientific article; zbMATH DE number 7559047 (Why is no real title available?)
• A Combinatorial Approach to Threshold Schemes
• A Pseudorandom Generator from any One-way Function
• Anonymous secret sharing schemes
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Covert two-party computation
• Distribution design
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• Fuzzy Identity-Based Encryption
• Hardness of non-interactive differential privacy from one-way functions
• Hierarchical Predicate Encryption for Inner-Products
• How to share a secret
• Lockable obfuscation
• Obfuscating compute-and-compare programs under LWE
• On cryptographic anonymity and unpredictability in secret sharing
• On lattices, learning with errors, random linear codes, and cryptography
• On pseudorandom encodings
• On the bound for anonymous secret sharing schemes
• Predicate encryption for circuits from LWE
• Privacy-preserving blueprints
• Providing anonymity in unconditionally secure secret sharing schemes
• Secret sharing lower bound: either reconstruction is hard or shares are long
• Secret sharing with certified deletion
• Secret-sharing schemes for general and uniform access structures
• Strongly exponential lower bounds for monotone computation
• Strongly ideal secret sharing schemes
• Succinct computational secret sharing
• Superpolynomial lower bounds for monotone span programs
• The size of a share must be large
• Tools for simulating features of composite order bilinear groups in the prime order setting
• Traceable secret sharing and applications
• Traceable secret sharing: strong security and efficient constructions

This page was built for publication: Fully anonymous secret sharing

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