Sciweavers

503 search results - page 13 / 101
» An Independence Relation for Sets of Secrets
Sort
View
CSFW
1998
IEEE
15 years 2 months ago
Proving Security Protocols with Model Checkers by Data Independence Techniques
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
A. W. Roscoe
BMCBI
2006
119views more  BMCBI 2006»
14 years 9 months ago
Utilization of two sample t-test statistics from redundant probe sets to evaluate different probe set algorithms in GeneChip stu
Background: The choice of probe set algorithms for expression summary in a GeneChip study has a great impact on subsequent gene expression data analysis. Spiked-in cRNAs with know...
Zihua Hu, Gail R. Willsky
IPMU
2010
Springer
15 years 2 months ago
Independent Natural Extension
We introduce a general definition for the independence of a number of finite-valued variables, based on coherent lower previsions. Our definition has an epistemic flavour: it a...
Gert de Cooman, Enrique Miranda, Marco Zaffalon
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
15 years 10 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
IFIP
2005
Springer
15 years 3 months ago
Relative Trustworthiness
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Johan W. Klüwer, Arild Waaler