For privacy, ‘shuffle’ data on cloud servers

Grazed from Futurity.org. Author: Kevin Stacey-Brown.

To keep data safe in the cloud, a group of computer scientists suggests doing the Melbourne Shuffle—not the dance move, but the new computer algorithm. The computing version of the Melbourne Shuffle aims to hide patterns that may emerge as users access data on cloud servers. Patterns of access could provide important information about a dataset—information that users don’t necessarily want others to know—even if the data files themselves are encrypted.

“Encrypting data is an important security measure. However, privacy leaks can occur even when accessing encrypted data,” says Olga Ohrimenko, lead author of a new paper describing the algorithm. “The objective of our work is to provide a higher level of privacy guarantees, beyond what encryption alone can achieve."…

The paper is available on arXiv, an open-access repository for math and computer science papers. Ohrimenko, who recently received her Ph.D. from Brown University and now works at Microsoft Research, co-authored the work with Roberto Tamassia and Eli Upfal, professors of computer science at Brown, and Michael Goodrich from the University of California, Irvine…

Read more from the source @ http://www.futurity.org/privacy-shuffle-data-cloud-servers/

Subscribe to the CloudCow bi-monthly newsletter @ http://eepurl.com/smZeb