We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the ident...
Susan Stepney, John A. Clark, Colin G. Johnson, De...
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
We analyze the evolution of cumulative national shares of Nobel Prizes since 1901, properly taking into account that most prizes were divided among several laureates. We rank by c...
ed from context by seeing an explanation inferentially, much in the same way that early expert systems saw an explanation as chaining of inferences. This approach omitted, for the ...