SECRET SETS AND APPLICATIONS

Authors
Citation
R. Molva et G. Tsudik, SECRET SETS AND APPLICATIONS, Information processing letters, 65(1), 1998, pp. 47-55
Citations number
11
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
ISSN journal
00200190
Volume
65
Issue
1
Year of publication
1998
Pages
47 - 55
Database
ISI
SICI code
0020-0190(1998)65:1<47:>2.0.ZU;2-T
Abstract
This paper introduces the notion of a secret set - a basic construct f or communication with groups of mutually suspicious entities. A set is secret if any entity can test its membership in the set but can deter mine neither the other set members nor the cardinality of the set. A n umber 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. (C) 1998 Elsevier Science B.V.