We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
Previous efforts involving picture-based passwords have not focused on maintaining a measurably high level of entropy. Since password systems usually allow user selection of passw...
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
This work presents a cross-layer modification to the DSR protocol which discovers high throughput paths on multi-hop wireless mesh networks. The modified DSR incorporates a metric...
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...