Ecole d'ingénieur et centre de recherche en Sciences du numérique

Secret sets and applications

Molva, Refik;Tsudik, Gene

Information processing letters, Volume 65, N°1, April 1998

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.

Document Doi Bibtex

Titre:Secret sets and applications
Mots Clés:secret sets;secret multicast;location secrecy;mobile networks
Type:Journal
Langue:English
Ville:
Date:
Département:Sécurité numérique
Eurecom ref:355
Copyright: © 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
Bibtex: @article{EURECOM+355, doi = {http://dx.doi.org/10.1016/S0020-0190(97)80449-8}, year = {1998}, month = {04}, title = {{S}ecret sets and applications}, author = {{M}olva, {R}efik and {T}sudik, {G}ene}, journal = {{I}nformation processing letters, {V}olume 65, {N}°1, {A}pril 1998}, url = {http://www.eurecom.fr/publication/355} }
Voir aussi: