Recent advances in non-perfect secret sharing schemes

DOI10.1007/978-3-319-40189-8_9MaRDI QIDQ3188243zbMATH OpenOpenAlexFDO

Authors 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

information ratiomatroidpolymatroidsecret sharingnon-perfect secret sharingideal secret sharing scheme

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1149914
• scientific article; zbMATH DE number 1543298
• Optimal non-perfect uniform secret sharing schemes
• On the information ratio of non-perfect secret sharing schemes
• scientific article; zbMATH DE number 1394291

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1023999 (Why is no real title available?)
• scientific article; zbMATH DE number 1024083 (Why is no real title available?)
• scientific article; zbMATH DE number 1149914 (Why is no real title available?)
• scientific article; zbMATH DE number 1394291 (Why is no real title available?)
• Atomic Secure Multi-party Multiplication with Low Communication
• Bounds on the Threshold Gap in Secret Sharing and its Applications
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
• How to share a secret
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Lossy chains and fractional secret sharing
• On secret sharing schemes, matroids and polymatroids
• On the classification of ideal secret sharing schemes
• Optimal non-perfect uniform secret sharing schemes
• Optimum general threshold secret sharing
• Polymatroidal dependence structure of a set of random variables
• Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
• Secret-Sharing Schemes: A Survey
• Secure Computation from Random Error Correcting Codes
• Security of Ramp Schemes
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• The size of a share must be large

Cited in

(6)

• On the information ratio of non-perfect secret sharing schemes
• Recent advances in function and homomorphic secret sharing (invited talk)
• Secret sharing schemes with general access structures
• Cutting-edge cryptography through the lens of secret sharing
• scientific article; zbMATH DE number 1394291 (Why is no real title available?)
• Optimal non-perfect uniform secret sharing schemes

This page was built for publication: Recent advances in non-perfect secret sharing schemes

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