Communication complexity of key agreement on small ranges

DOI10.1007/3-540-59042-0_60MaRDI QIDQ4596608zbMATH OpenOpenAlexFDO

Authors

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_60

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the Communication Complexity of Key-Agreement Protocols.
• Communication complexity of the secret key agreement in algorithmic information theory
• Communication complexity with small advantage
• scientific article; zbMATH DE number 7250149
• Publication:4508382
• Communication and Randomness Lower Bounds for Secure Computation
• On the communication complexity of secure computation
• Communication Complexity and Quasi Randomness
• Bounds on tradeoffs between randomness and communication complexity
• scientific article; zbMATH DE number 4068270

Cited in

(4)

• The consequences of eliminating NP solutions
• On Pseudodeterministic Approximation Algorithms.
• Communication complexity of the secret key agreement in algorithmic information theory
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols

This page was built for publication: Communication complexity of key agreement on small ranges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596608)