Data Sovereignty The importance of geolocating data in the cloud - - PowerPoint PPT Presentation

data sovereignty
SMART_READER_LITE
LIVE PREVIEW

Data Sovereignty The importance of geolocating data in the cloud - - PowerPoint PPT Presentation

HotCloud 2011 Data Sovereignty The importance of geolocating data in the cloud Zachary N J Peterson Mark Gondree Rob Beverly Your Data is Here But, maybe it should be here Or Here? Breaking the Abstraction Is data within some political


slide-1
SLIDE 1

Data Sovereignty

The importance of geolocating data in the cloud Zachary N J Peterson Mark Gondree Rob Beverly

HotCloud 2011

slide-2
SLIDE 2

Your Data is Here

slide-3
SLIDE 3

But, maybe it should be here

slide-4
SLIDE 4

Or Here?

slide-5
SLIDE 5

Breaking the Abstraction

Is data within some political boundary Privacy protections Intellectual property protections Regulatory compliance Has data been replicated

slide-6
SLIDE 6

Existing Notions of Location in the Cloud

Regions of service Content-distribution networks Location guaranteed only by service-level agreements and quality of service metrics No interfaces or external techniques for establishing the location of remote data

slide-7
SLIDE 7

Data Sovereignty

slide-8
SLIDE 8

Data Sovereignty

Protocols for establishing the location and authenticity of data in the cloud In scope: Efficiently positioning some copy of data within some geopolitical boundary Not in scope: the location of any copy of data

slide-9
SLIDE 9

State of the Art

slide-10
SLIDE 10

Geolocation

Geolocation of hosts (NICs) Evidence gathering (whois, extrinsic evidence) Delay-based measurements Wang et al. NSDI ‘10: Street-level geolocation

slide-11
SLIDE 11

Possession of Data

Provable Data Possession (PDP) & Proofs of Retrievability (POR) Probabilistic challenge & response protocols Designed to minimize storage, computation, communication complexity Techniques: Homomorphic signatures, PRFs, BLS signatures, MACs

slide-12
SLIDE 12

Naïve Composition

Naïvely composing geolocation & PDP (e.g. serially) provides limited assurance Data exists somewhere, and the responder is within some physical bound (Not: the data exists within some physical bound)

slide-13
SLIDE 13

Adversaries

DS considers a more powerful adversary One who may actively fool the challenger e.g. act as proxy for remote storage, cache subsets of data, manipulate delay measurements Adding delay increases perceived distance

slide-14
SLIDE 14

An Initial Approach

slide-15
SLIDE 15

An Initial Approach

Leverage MAC-PDP: Tag: ti = HMACk(Di) Store: <Di, ti> Challenge: <Dc, tc> for c indices Verify: HMACk(Dc) =? tc

slide-16
SLIDE 16

An Initial Approach

Augment MAC-PDP with network delay measurements Query blocks one at a time, randomly Measure the response time Single response verifies data authenticity and calculates distance

slide-17
SLIDE 17

? ? 68ms

Single Challenger

slide-18
SLIDE 18

68ms

Multiple Challengers

slide-19
SLIDE 19

An Initial Approach

Requires no server-side computation Can be implemented on existing infrastructure, as part of an SLA compliance tool But, at a high communication cost And, susceptible to honest, variable overheads

slide-20
SLIDE 20

Future Directions

Evaluation of our initial idea Landmark placement and operation More efficient and less adversarial DS schemes Given existing infrastructure Given some future infrastructure Ways to bind computation to a location