Two cooperative versions of the guessing secrets problem
From MaRDI portal
Recommendations
- The Guessing Secrets problem: a probabilistic approach
- Guessing secrets. (Extended abstract)
- scientific article; zbMATH DE number 25183
- Zero-knowledge cooperation in dilemma games
- Almost optimum secret sharing with cheating detection
- A secret sharing scheme based on group presentations and the word problem
- Secret Correlation in Repeated Games with Imperfect Monitoring
- Publication:4952627
- Secret sharing and duality
Cites work
- scientific article; zbMATH DE number 2119668 (Why is no real title available?)
- scientific article; zbMATH DE number 795167 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Guessing secrets
- Guessing secrets efficiently via list decoding
- Information Security Practice and Experience
- Searching with lies under error cost constraints
- Selling multiple secrets to a single buyer
- Solution of Ulam's problem on searching with a lie
- Static Bayesian games with finite fuzzy types and the existence of equilibrium
- The Guessing Secrets problem: a probabilistic approach
- Ulam's searching game with a fixed number of lies
- Ulam's searching game with lies
Cited in
(3)
This page was built for publication: Two cooperative versions of the guessing secrets problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730944)