Browse Definitions:
Definition

Melbourne shuffle algorithm

Contributor(s): Matthew Haughn, Michael Cobb

The Melbourne shuffle algorithm is a sequence of actions intended to obscure the patterns by which cloud-based data is accessed. The goal is to make it difficult for unauthorized parties to draw conclusions about what type of data is being stored in the cloud by observing patterns that emerge as the data is accessed.

Even when data is encrypted, details about how often the data is accessed or what action is taken after the data has been accessed can be revealing. By analyzing digital footprints, an outsider can predict such things as who is likely to own a particular data set or what business announcement is likely to correlate with a particular access pattern.

As with a deck of cards, a data shuffle rearranges the array to achieve a random permutation of its elements. The Melbourne shuffle moves small amounts of data from the cloud server to the user's local memory, where it is rearranged before being returned to the server. Even when the same user repeatedly accesses the same data, shuffling ensures the access path will not be consistent.

The algorithm, which obfuscates access patterns by making them look quite random, was written by computer scientists at Brown University in 2014. It is named for another kind of shuffle -- a popular dance move in Australia during the 1990s.

This was last updated in August 2017

Continue Reading About Melbourne shuffle algorithm

Join the conversation

3 comments

Send me notifications when other members comment.

By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy

Please create a username to comment.

What strategies do you use to keep your data safe in the cloud?
Cancel
This is good and clever enough to actually work. It's a fine start, a fix for a piece of the puzzle, but it only chips away at one tiny bit of a huge (and growing) problem.

We already know our patch-a-day whack-a-mole approach doesn't work very well. How many breaches do we have to suffer before we start dealing with the core problem instead of fixing all the edges...?
Cancel
This is good and clever enough to actually work. It's a fine start, a fix for a piece of the puzzle, but it only chips away at one tiny bit of a huge (and growing) problem.

We already know our patch-a-day whack-a-mole approach doesn't work very well. How many breaches do we have to suffer before we start dealing with the core problem instead of fixing all the edges...?
Cancel

-ADS BY GOOGLE

Extensions de fichiers et formats de fichiers

Motorisé par:

SearchCompliance

  • internal audit (IA)

    An internal audit (IA) is an organizational initiative to monitor and analyze its own business operations in order to determine ...

  • pure risk (absolute risk)

    Pure risk, also called absolute risk, is a category of threat that is beyond human control and has only one possible outcome if ...

  • risk assessment

    Risk assessment is the identification of hazards that could negatively impact an organization's ability to conduct business.

SearchSecurity

  • phishing

    Phishing is a form of fraud in which an attacker masquerades as a reputable entity or person in email or other communication ...

  • vulnerability disclosure

    Vulnerability disclosure is the practice of publishing information about a computer security problem, and a type of policy that ...

  • incident response

    Incident response is an organized approach to addressing and managing the aftermath of a security breach or cyberattack, also ...

SearchHealthIT

SearchDisasterRecovery

  • business continuity and disaster recovery (BCDR)

    Business continuity and disaster recovery (BCDR) are closely related practices that describe an organization's preparation for ...

  • business continuity plan (BCP)

    A business continuity plan (BCP) is a document that consists of the critical information an organization needs to continue ...

  • call tree

    A call tree -- sometimes referred to as a phone tree -- is a telecommunications chain for notifying specific individuals of an ...

SearchStorage

  • flash memory

    Flash memory, also known as flash storage, is a type of nonvolatile memory that erases data in units called blocks.

  • NAND flash memory

    NAND flash memory is a type of nonvolatile storage technology that does not require power to retain data.

  • NOR flash memory

    NOR flash memory is one of two types of nonvolatile storage technologies.

SearchSolidStateStorage

  • hybrid hard disk drive (HDD)

    A hybrid hard disk drive is an electromechanical spinning hard disk that contains some amount of NAND Flash memory.

Close