Sciweavers

2043 search results - page 118 / 409
» Reasoning About Security Models
Sort
View
ECSQARU
2005
Springer
15 years 6 months ago
Type Uncertainty in Ontologically-Grounded Qualitative Probabilistic Matching
This paper is part of a project to match real-world descriptions of instances of objects to models of objects. We use a rich ontology to describe s and models at multiple levels of...
David Poole, Clinton Smyth
116
Voted
AGENTS
1999
Springer
15 years 5 months ago
Learning to Remove Internet Advertisements
This paper discusses improving the methodology introduced in Kushmerick’s paper about learning to remove internet advertisements. The aim is to reduce the model build time as we...
Nicholas Kushmerick
106
Voted
FSE
1998
Springer
102views Cryptology» more  FSE 1998»
15 years 5 months ago
Cryptanalytic Attacks on Pseudorandom Number Generators
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
John Kelsey, Bruce Schneier, David Wagner, Chris H...
101
Voted
CCS
2009
ACM
16 years 1 months ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov
83
Voted
CSFW
2010
IEEE
15 years 4 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...