Centralized vs decentralized multi-agent guesswork

Salman Salamatian, Ahmad Beirami, Asaf Cohen, Muriel Medard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We study a notion of guesswork, where multiple agents intend to launch a coordinated brute-force attack to find a single binary secret string, and each agent has access to side information generated through either a BEC or a BSC. The average number of trials required to find the secret string grows exponentially with the length of the string, and the rate of the growth is called the guesswork exponent. We compute the guesswork exponent for several multi-agent attacks. We show that a multi-agent attack reduces the guesswork exponent compared to a single agent, even when the agents do not exchange information to coordinate their attack, and try to individually guess the secret string using a predetermined scheme in a decentralized fashion. Further, we show that the guesswork exponent of two agents who do coordinate their attack is strictly smaller than that of any finite number of agents individually performing decentralized guesswork.

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
Number of pages5
ISBN (Electronic)9781509040964
StatePublished - 9 Aug 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings


Conference2017 IEEE International Symposium on Information Theory, ISIT 2017


  • Brute-force attack
  • Coordinated attack
  • Guesswork

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Centralized vs decentralized multi-agent guesswork'. Together they form a unique fingerprint.

Cite this