Sciweavers

978 search results - page 15 / 196
» Knowledge, Probability, and Adversaries
Sort
View
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
12 years 11 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
IJCNN
2008
IEEE
14 years 1 months ago
A network model of rational versus irrational choices on a probability maximization task
─Humans have a drive to maximize knowledge of the world, yet decision making data also suggest a contrary drive to minimize cognitive effort using simplifying heuristics. The tra...
Daniel S. Levine, Leonid I. Perlovsky
TIME
1994
IEEE
13 years 11 months ago
Belief Revision in a Discrete Temporal Probability-Logic
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...
IEEESCC
2005
IEEE
14 years 1 months ago
Knowledge as a Service and Knowledge Breaching
In this paper, we introduce and explore a new computing paradigm we call knowledge as a service, in which a knowledge service provider, via its knowledge server, answers queries p...
Shouhuai Xu, Weining Zhang
CCS
2008
ACM
13 years 9 months ago
Open problems in the security of learning
Machine learning has become a valuable tool for detecting and preventing malicious activity. However, as more applications employ machine learning techniques in adversarial decisi...
Marco Barreno, Peter L. Bartlett, Fuching Jack Chi...