The following pages link to Secret-Sharing Schemes: A Survey (Q3005578):
Displaying 39 items.
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Threshold Secret Sharing Through Multivariate Birkhoff Interpolation (Q2790437) (← links)
- A Study of Pair Encodings: Predicate Encryption in Prime Order Groups (Q2799098) (← links)
- Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
- Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing (Q2817480) (← links)
- Practical Fault-Tolerant Data Aggregation (Q2822685) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Secure Two-Party Computation: A Visual Way (Q2948250) (← links)
- How to share a secret (Q3050283) (← links)
- Secret Sharing for mNP: Completeness Results (Q3179496) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- How to Share a Secret, Infinitely (Q3181038) (← links)
- Recent Advances in Non-perfect Secret Sharing Schemes (Q3188243) (← links)
- Operations over Linear Secret Sharing Schemes (Q3297683) (← links)
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption (Q3457081) (← links)
- Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme (Q4975177) (← links)
- Probabilistic secret sharing (Q5005168) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- (Q5140836) (← links)
- Construction of arithmetic secret sharing schemes by using torsion limits (Q5160560) (← links)
- Simplifying Design and Analysis of Complex Predicate Encryption Schemes (Q5738892) (← links)
- Practically Efficient Secure Single-Commodity Multi-market Auctions (Q5857771) (← links)
- Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)
- Using multiobjective optimization to map the entropy region (Q5963309) (← links)
- Quantum attribute-based encryption: a comprehensive study (Q6050246) (← links)
- Access structures determined by uniform polymatroids (Q6085192) (← links)
- On ideal and weakly-ideal access structures (Q6112264) (← links)
- Bipartite secret sharing and staircases (Q6124455) (← links)
- Ideal uniform multipartite secret sharing schemes (Q6192308) (← links)
- Threshold secret sharing with geometric algebras (Q6496087) (← links)
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC (Q6581796) (← links)
- Improved polynomial secret-sharing schemes (Q6582181) (← links)
- Randomized data partitioning with efficient search, retrieval and privacy-preservation (Q6591482) (← links)
- Multi-recipient and threshold encryption based on hidden multipliers (Q6601464) (← links)
- Randomness recoverable secret sharing schemes (Q6617634) (← links)
- Dynamic collusion functional encryption and multi-authority attribute-based encryption (Q6635893) (← links)
- On Boolean functions derived from linear maps over \(\mathbb{Z}_4\) and their application to secret sharing (Q6651901) (← links)
- Secret sharing with certified deletion (Q6653007) (← links)
