1362 search results - page 272 / 273 » Means, Correlations and Bounds |
IACR
2011
12 years 10 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
PODS
2012
ACM
12 years 1 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
CRYPTO
2012
Springer
12 years 1 months ago
2012
Springer
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
PODC
2012
ACM
12 years 1 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...