Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing

@article{Nitinawarat2010PerfectOP,
  title={Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing},
  author={Sirin Nitinawarat and Prakash Narayan},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={6490-6500}
}
We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a perfect secret key shared by a given set of terminals… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 36 extracted citations

Coded Cooperative Data Exchange for a Secret Key

IEEE Transactions on Information Theory • 2014
View 4 Excerpts
Highly Influenced

On the communication complexity of secret key generation in the multiterminal source model

2014 IEEE International Symposium on Information Theory • 2014
View 13 Excerpts
Highly Influenced

Change of Multivariate Mutual Information: From Local to Global

IEEE Transactions on Information Theory • 2018
View 4 Excerpts
Highly Influenced

Achieving SK capacity in the source model: When must all terminals talk?

2014 IEEE International Symposium on Information Theory • 2014
View 4 Excerpts
Highly Influenced

On the secret key capacity of the Harary graph PIN model

2013 National Conference on Communications (NCC) • 2013
View 5 Excerpts
Highly Influenced

Fault-tolerant secret key generation

2012 IEEE International Symposium on Information Theory Proceedings • 2012
View 4 Excerpts
Highly Influenced

57 Citations

051015'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Perfect secrecy, perfect omniscience and steiner tree packing

2009 IEEE International Symposium on Information Theory • 2009
View 2 Excerpts

Common Randomness, Multiuser Secrecy and Tree Packing

2008 46th Annual Allerton Conference on Communication, Control, and Computing • 2008
View 1 Excerpt

Group Secret Key Generation Algorithms

2007 IEEE International Symposium on Information Theory • 2007
View 2 Excerpts

A unification of network coding and tree-packing (routing) theorems

IEEE Transactions on Information Theory • 2006
View 1 Excerpt

Extracting Secrecy from Jointly Gaussian Random Variables

2006 IEEE International Symposium on Information Theory • 2006
View 1 Excerpt

Secrecy Capacities for Multiterminal Channel Models

IEEE Transactions on Information Theory • 2005
View 2 Excerpts

Secrecy capacities for multiple terminals

IEEE Transactions on Information Theory • 2004
View 6 Excerpts

Similar Papers

Loading similar papers…