Name
Abstract | ||
|---|---|---|
In this paper, the degraded Gaussian Multiple-Input-Multiple-Output (MIMO) broadcast channel with layered decoding and secrecy constraints is investigated. In this model, there are in total K messages and K receivers that are ordered by the channel quality. Each receiver is required to decode one more message than the receiver with one level worse channel quality. Furthermore, this message should be kept secure from the receivers with worse channel qualities. The secrecy capacity region for this model is fully characterized. The converse proof relies on a novel construction of a series of covariance matrices. An application of this model to the problem of sharing multiple secrets, which is difficult to solve using number theoretic tools, is investigated. The secret sharing capacity region is characterized by reformulating the secret sharing problem as the secure communication problem over the K-receiver degraded Gaussian MIMO broadcast channel. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ISIT.2014.6874862 | ISIT |
Keywords | Field | DocType |
gaussian channels,broadcast channels,layered secure broadcasting,covariance matrices,channel coding,secure communication problem,gaussian mimo broadcast channel,mimo communication,secret sharing capacity region,telecommunication security,layered decoding,secrecy constraints,channel quality | Broadcasting,Secret sharing,3G MIMO,Computer science,Secrecy,Computer network,Communication channel,MIMO,Decoding methods,Secure communication | Conference |
Citations | PageRank | References |
1 | 0.37 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaofeng Zou | 1 | 53 | 14.20 |
| Yingbin Liang | 2 | 1646 | 147.64 |
| Lifeng Lai | 3 | 2289 | 167.78 |
| Shlomo Shamai | 4 | 4531 | 410.89 |