Two cooperative versions of the Guessing Secrets problem

Authors:
G. Sergioli;A. Ledda;F. Paoli;R. Giuntini;T. Kowalski;F. Montagna;H. Freytes;C. Marini
Affiliations:
Dept. of Education, University of Cagliari, 09123 Cagliari, Italy;Dept. of Education, University of Cagliari, 09123 Cagliari, Italy;Dept. of Education, University of Cagliari, 09123 Cagliari, Italy;Dept. of Education, University of Cagliari, 09123 Cagliari, Italy;Dept. of Education, University of Cagliari, 09123 Cagliari, Italy;Dept. of Mathematics, University of Siena, Italy;Dept. of Education, University of Cagliari, 09123 Cagliari, Italy and Consejo Nacional de Investigaciones Cientificas y Tecnicas, Instituto Argentino de Matematica, Argentina;Dept. of Mathematics, University of Siena, Italy
Venue:
Information Sciences: an International Journal
Year:
2009

Citing 12
Cited 1

Solution of Ulam's problem on searching with a lie

Journal of Combinatorial Theory Series A
Ulam's searching game with lies

Journal of Combinatorial Theory Series A
Ulam's searching game with a fixed number of lies

Theoretical Computer Science
Guessing secrets with inner product questions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Recovery of Secrets

ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
The Guessing Secrets problem: a probabilistic approach

Journal of Algorithms
Guessing secrets efficiently via list decoding

ACM Transactions on Algorithms (TALG)
Searching with lies under error cost constraints

Discrete Applied Mathematics
Static Bayesian games with finite fuzzy types and the existence of equilibrium

Information Sciences: an International Journal
An analysis of privacy signals on the World Wide Web: Past, present and future

Information Sciences: an International Journal
Selling multiple secrets to a single buyer

Information Sciences: an International Journal
Tracing traitors by guessing secrets. the q-ary case

ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience

Quantum guessing via Deutsch-Jozsa

Quantum Information & Computation

Quantified Score

Hi-index	0.07

Visualization

Abstract

We investigate two cooperative variants (with and without lies) of the Guessing Secrets problem, introduced in [L. Chung, R. Graham, F.T. Leighton, Guessing secrets, Electronic Journal of Combinatorics 8 (2001)] in the attempt to model an interactive situation arising in the World Wide Web, in relation to the efficient delivery of Internet content. After placing bounds on the cardinality of the smallest set of questions needed to win the game, we establish that the algebra of all the states of knowledge induced by any designated game is a pseudocomplemented lattice. In particular, its join semilattice reduct is embeddable into the corresponding reduct of the Boolean algebra 2^N^-^1, where N is the cardinality of the search space.