Probabilistic Algorithms for Defeating Adversaries
Feigenbaum, Joan
Statist. Sci., Tome 8 (1993) no. 4, p. 26-30 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Randomization appears to be an essential ingredient in algorithms for maintaining some form of privacy. This article discusses probabilistic algorithms for authenticating a user and for allowing the private use of shared resources.
Publié le : 1993-02-14
Classification:  Authentication,  instance hiding,  private computation,  zero-knowledge 
@article{1177011080,
     author = {Feigenbaum, Joan},
     title = {Probabilistic Algorithms for Defeating Adversaries},
     journal = {Statist. Sci.},
     volume = {8},
     number = {4},
     year = {1993},
     pages = { 26-30},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1177011080}
}

Feigenbaum, Joan. Probabilistic Algorithms for Defeating Adversaries. Statist. Sci., Tome 8 (1993) no. 4, pp.  26-30. http://gdmltest.u-ga.fr/item/1177011080/