A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing

@inproceedings{Tyagi2014ABF,
  title={A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing},
  author={Himanshu Tyagi and Shun Watanabe},
  booktitle={IACR Cryptology ePrint Archive},
  year={2014}
}
We consider secret key agreement by multiple parties observing correlated data and communicating interactively over an insecure communication channel. Our main contribution is a single-shot upper bound on the length of the secret keys that can be generated, without making any assumptions on the distribution of the underlying data. Heuristically, we bound the secret key length in terms of “how far” is the joint distribution of the initial observations of the parties and the eavesdropper from a… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

Citations

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

Asymptotic converse bound for secret key capacity in hidden Markov model

2017 IEEE International Symposium on Information Theory (ISIT) • 2017
View 4 Excerpts
Highly Influenced

Interactive Communication for Data Exchange

IEEE Transactions on Information Theory • 2015
View 6 Excerpts
Highly Influenced

Secret Key Agreement: General Capacity and Second-Order Asymptotics

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

On the Secret Key Capacity of Sibling Hidden Markov Models

IEEE Transactions on Information Forensics and Security • 2019
View 3 Excerpts
Highly Influenced

Impossibility bounds for secure computing

2015 IEEE International Symposium on Information Theory (ISIT) • 2015
View 5 Excerpts
Method Support
Highly Influenced

Extra Samples can Reduce the Communication for Independence Testing

2018 IEEE International Symposium on Information Theory (ISIT) • 2018
View 1 Excerpt

On Private Lossy Function Computation

2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) • 2018

References

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

When Is a Function Securely Computable?

IEEE Transactions on Information Theory • 2011
View 5 Excerpts
Highly Influenced

Secrecy capacities for multiple terminals

IEEE Transactions on Information Theory • 2004
View 13 Excerpts
Highly Influenced

Secret Key Agreement by Public Discussion from Common Information

M. Maurer
2004
View 10 Excerpts
Highly Influenced

How Many Queries Will Resolve Common Randomness?

IEEE Trans. Information Theory • 2013
View 2 Excerpts

Agreement of a restricted secret key

2012 IEEE International Symposium on Information Theory Proceedings • 2012
View 1 Excerpt