Group items tagged

A newly published patent application from Microsoft takes an interesting spin on presenting information, pulling together news from a mix of sources to present topics in storylines, and providing ways to have that information delivered to us over computers, smart phones, watch interfaces, and in other ways.

Two Google scientists presented a paper at WWW 2008 held in Beijing last week that outlines their vision for the future of image search.

The presentation give by Charlene Li.

Videos of KDD'08 presentations

Attacks that exploit memory errors are still a serious problem. We present data randomization, a new technique that provides probabilistic protection against these attacks by xoring data with random masks. Data randomization uses static analysis to partition instruction operands into equivalence classes: it places two operands in the same class if they may refer to the same object in an execution that does not violate memory safety. Then it assigns a random mask to each class and it generates code instrumented to xor data read from or written to memory with the mask of the memory operand's class. Therefore, attacks that violate the results of the static analysis have unpredictable results. We implemented a data randomization prototype that compiles programs without modifications and can preventmany attacks with low overhead. Our prototype prevents all the attacks in our benchmarks while introducing an average runtime overhead of 11% (0%to 27%) and an average space overhead below 1%.