Abstract
A multiterminal secure source coding problem is proposed where multiple users discuss in public until they can recover a particular source as securely as possible. The model provides a unified framework that combines and generalizes the problems of multiterminal secret key agreement and secure computation. Bounds on the achievable discussion rate, level of secrecy and reliability are derived.
| Original language | English |
|---|---|
| Title of host publication | 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) |
| Publisher | IEEE |
| Pages | 188-195 |
| ISBN (Electronic) | 978-1-4577-1818-2 |
| ISBN (Print) | 978-1-4577-1817-5 |
| DOIs | |
| Publication status | Published - 2012 |
| Externally published | Yes |
| Event | 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - University of Illinois, Monticello, IL, United States Duration: 28 Sept 2011 → 30 Sept 2011 https://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=18913 https://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=18913 |
Publication series
| Name | Annual Allerton Conference on Communication, Control, and Computing |
|---|---|
| Publisher | IEEE |
Conference
| Conference | 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 |
|---|---|
| Abbreviated title | Allerton 2011 |
| Place | United States |
| City | Monticello, IL |
| Period | 28/09/11 → 30/09/11 |
| Internet address |