Combinatorial lower bounds for secret sharing schemes

DOI10.1016/S0020-0190(96)00178-0zbMATH Open1336.94080MaRDI QIDQ286957FDOQ286957

Authors: Kaoru Kurosawa, Koji Okada 

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1024085
• Secret Sharing and Non-Shannon Information Inequalities
• On secret sharing schemes
• On the size of shares for secret sharing schemes
• scientific article; zbMATH DE number 1088899

zbMATH Keywords

safety/security in digital systemssecret sharingshare size

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How to share a secret
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On secret sharing systems

Cited In (7)

• On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
• On secret sharing schemes
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• On the bound for anonymous secret sharing schemes
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
• Secret Sharing and Non-Shannon Information Inequalities

This page was built for publication: Combinatorial lower bounds for secret sharing schemes

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