This paper introduces the notion of a secret set - a basic construct for communication with groups of mutually suspicious entities. A set is secret if any entity can test its membership in the set but can determine neither the other set members nor the cardinality of the set. A number of possible secret set constructions are presented, analyzed and contrasted according to criteria such as: security (strength) as well as bandwidth and processing overheads. Example applications of secret sets are discussed.
Secret sets and applications
Information processing letters, Volume 65, N°1, April 1998
© Elsevier. Personal use of this material is permitted. The definitive version of this paper was published in Information processing letters, Volume 65, N°1, April 1998 and is available at : http://dx.doi.org/10.1016/S0020-0190(97)80449-8
PERMALINK : https://www.eurecom.fr/publication/355