✦ LIBER ✦

Using mincuts to design secret sharing schemes in graphs

✍ Scribed by Werner Poguntke

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 313 KB
Volume: 13
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00447-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New combinatorial designs and their appl

New combinatorial designs and their applications to authentication codes and secret sharing schemes

✍ Wakaha Ogata; Kaoru Kurosawa; Douglas R. Stinson; Hajime Saido 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 306 KB

This paper introduces three new types of combinatorial designs, which we call external difference families (EDF), external BIBDs (EBIBD) and splitting BIBDs. An EDF is a special type of EBIBD, so existence of an EDF implies existence of an EBIBD. We construct optimal splitting A-codes by using EDF.

More information theoretical inequalitie

More information theoretical inequalities to be used in secret sharing?

✍ Marten van Dijk 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 301 KB