A secret-sharing scheme is a method by which a dealer distributes shares to parties such
that only authorized subsets of parties can reconstruct the secret. Secret-sharing schemes …

This book is an evolution from my book A First Course in Information Theory published in
2002 when network coding was still at its infancy. The last few years have witnessed the …

A First Course in Information Theory is an up-to-date introduction to information theory. In
addition to the classical topics discussed, it provides the first comprehensive treatment of the …

A secret sharing scheme permits a secret to be shared among participants of an n-element
group in such a way that only qualified subsets of participants can recover the secret. If any …

This paper will present the authors' own techniques of secret data management and
protection, with particular attention paid to techniques securing data services. Among the …

Explicit data graph execution (EDGE) architectures offer the possibility of high instruction-
level parallelism with energy efficiency. In EDGE architectures, the compiler breaks a …

A perfect secret sharing scheme is a system for the protection of a secret among a number of
participants in such a way that only certain subsets of these participants can reconstruct the …

A secret sharing scheme is a protocol by means of which a dealer distributes a secret s
among a set of participants P in such a way that only qualified subsets of P can reconstruct …

We study the complexity of realizing the “worst” functions in several standard models of
information-theoretic cryptography. In particular, for the case of security against passive …

A secret-sharing scheme enables a dealer to share a secret s among n parties such that
only authorized subsets of parties, specified by a monotone access structure f:{0, 1} n→{0 …