Recent Advances in Non-perfect Secret Sharing Schemes

DOI10.1007/978-3-319-40189-8_9zbMath1479.94316OpenAlexW2462222983MaRDI QIDQ3188243

Oriol Farràs

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_9

zbMATH Keywords

matroidideal secret sharing schemesecret sharingpolymatroidinformation rationon-perfect secret sharing

Mathematics Subject Classification ID

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

Related Items (1)

On the information ratio of non-perfect secret sharing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the classification of ideal secret sharing schemes
• The size of a share must be large
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
• Optimal Non-perfect Uniform Secret Sharing Schemes
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Security of Ramp Schemes
• Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Secret-Sharing Schemes: A Survey
• How to share a secret
• On secret sharing schemes, matroids and polymatroids
• Polymatroidal dependence structure of a set of random variables
• Optimum General Threshold Secret Sharing
• Bounds on the Threshold Gap in Secret Sharing and its Applications
• Secure Computation from Random Error Correcting Codes
• Atomic Secure Multi-party Multiplication with Low Communication
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves

This page was built for publication: Recent Advances in Non-perfect Secret Sharing Schemes