✦ LIBER ✦

Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes

✍ Scribed by C. J. Mitchell, F. C. Piper, M. Walker, P. Wild

Book ID: 118771437
Publisher: Springer
Year: 1996
Tongue: English
Weight: 542 KB
Volume: 7
Category: Article
ISSN: 0925-1022
DOI: 10.1007/bf00125078

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive constructions for perfect secr

Recursive constructions for perfect secret sharing schemes

✍ Hung-Min Sun; Shiuh-Pyng Shieh 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 595 KB

A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information regarding the se

Perfect secret sharing schemes on five p

Perfect secret sharing schemes on five participants

✍ Wen-Ai Jackson, Keith M. Martin 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 210 KB

Weighted decomposition construction for

Weighted decomposition construction for perfect secret sharing schemes

✍ Hung-Min Sun; Bor-Liang Chen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 839 KB

The Combinatorics of Perfect Authenticat

The Combinatorics of Perfect Authentication Schemes

✍ Mitchell, Chris; Walker, Michael; Wild, Peter 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 752 KB

Linear codes from perfect nonlinear mapp

Linear codes from perfect nonlinear mappings and their secret sharing schemes

✍ Carlet, C.; Ding, C.; Yuan, J. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 382 KB

A perfect threshold secret sharing schem

A perfect threshold secret sharing scheme to identify cheaters

✍ Marco Carpentieri 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 337 KB