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. ...
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
Background: Correctly merged data sets that have been independently genotyped can increase statistical power in linkage and association studies. However, alleles from microsatelli...
Angela P. Presson, Eric M. Sobel, Paivi Pajukanta,...
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...