Authentication and Integrity in Outsourced Databases Kanaka Rajanala.

Slides:



Advertisements
Similar presentations
Last Class: The Problem BobAlice Eve Private Message Eavesdropping.
Advertisements

Building web applications on top of encrypted data using Mylar Presented by Tenglu Liang Tai Liu.
Digital Signatures and Hash Functions. Digital Signatures.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
Authentication and Digital Signatures CSCI 5857: Encoding and Encryption.
Public-key based. Public-key Techniques based Protocols –may use either weak or strong passwords –high computation complexity (Slow) –high deployment.
CNS2010handout 10 :: digital signatures1 computer and network security matt barrie.
Cryptography Basic (cont)
Proactive Secure Mobile Digital Signatures Work in progress. Ivan Damgård and Gert Læssøe Mikkelsen University of Aarhus.
CMSC 414 Computer and Network Security Lecture 16 Jonathan Katz.
Privacy and Integrity Preserving in Distributed Systems Presented for Ph.D. Qualifying Examination Fei Chen Michigan State University August 25 th, 2009.
1 Intro To Encryption Exercise Analyze the following scenario: Sender:  Cipher1= Encrypt message with symmetric key algorithm  RSA_Encrypt (SHA1(message)
DSAC (Digital Signature Aggregation and Chaining) Digital Signature Aggregation & Chaining An approach to ensure integrity of outsourced databases.
DSAC (Digital Signature Aggregation and Chaining) Digital Signature Aggregation & Chaining An approach to ensure integrity of outsourced databases.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
Domain Name System Security Extensions (DNSSEC) Hackers 2.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Domain Name System | DNSSEC. 2  Internet Protocol address uniquely identifies laptops or phones or other devices  The Domain Name System matches IP.
CSCI 6962: Server-side Design and Programming
Chapter 31 Network Security
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Lecture 8 Digital Signatures. This lecture considers techniques designed to provide the digital counterpart to a handwritten signature. A digital signature.
Digital Cash By Gaurav Shetty. Agenda Introduction. Introduction. Working. Working. Desired Properties. Desired Properties. Protocols for Digital Cash.
Cong Wang1, Qian Wang1, Kui Ren1 and Wenjing Lou2
Construction of efficient PDP scheme for Distributed Cloud Storage. By Manognya Reddy Kondam.
CS555Topic 211 Cryptography CS 555 Topic 21: Digital Schemes (1)
SSL and https for Secure Web Communication CSCI 5857: Encoding and Encryption.
Security Security is a measure of the system’s ability to protect data and information from unauthorized access while still providing access to people.
Authentication: Owner and user OwnerUser Query: X > 6 Message m: Answer to X>6: X1, X5 Sign(m) DB.
Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.
Cryptography, Authentication and Digital Signatures
Secure Cloud Database with Sense of Security. Introduction Cloud computing – IT as a service from third party service provider Security in cloud environment.
Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.
Strong Security for Distributed File Systems Group A3 Ka Hou Wong Jahanzeb Faizan Jonathan Sippel.
 A Web service is a method of communication between two electronic devices over World Wide Web.
Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Network Security: Firewalls and VPNs.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Digital Signatures, Message Digest and Authentication Week-9.
Cryptography: Digital Signatures Message Digests Authentication
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Security in DNS(DNSSEC) Yalda Edalat Pramodh Pallapothu.
Database security Diego Abella. Database security Global connection increase database security problems. Database security is the system, processes, and.
Data Integrity Proofs in Cloud Storage Author: Sravan Kumar R and Ashutosh Saxena. Source: The Third International Conference on Communication Systems.
Deck 10 Accounting Information Systems Romney and Steinbart Linda Batch March 2012.
© Copyright 2009 SSLPost 01. © Copyright 2009 SSLPost 02 a recipient is sent an encrypted that contains data specific to that recipient the data.
The Hierarchical Trust Model. PGP Certificate Server details Fast, efficient key repository –LDAP, HTTP interfaces Secure remote administration –“Pending”
COM 5336 Lecture 8 Digital Signatures
Introduction to Core Database Concepts Getting started with Databases and Structure Query Language (SQL)
Security By Meenal Mandalia. What is ? stands for Electronic Mail. much the same as a letter, only that it is exchanged in a different.
Secure Instant Messenger in Android Name: Shamik Roy Chowdhury.
SECURITY. Security Threats, Policies, and Mechanisms There are four types of security threats to consider 1. Interception 2 Interruption 3. Modification.
Pertemuan #8 Key Management Kuliah Pengaman Jaringan.
Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.
Fragile Watermarking Scheme for Relational Database Fragile Watermarking Scheme for Relational Database.
Cryptography: an overview
Computer Communication & Networks
Cryptographic Hash Function
A Wireless LAN Security Protocol
NET 311 Information Security
NET 536 Network Security Lecture 8: DNS Security
Digital Signatures…!.
Best Digital Signature Service in Noida. Electronic Record 1.Very easy to make copies 2.Very fast distribution 3.Easy archiving and retrieval 4.Copies.
ONLINE SECURE DATA SERVICE
Instructor Materials Chapter 5: Ensuring Integrity
Diffie-Hellman Key Exchange
National Trust Platform
Presentation transcript:

Authentication and Integrity in Outsourced Databases Kanaka Rajanala

What is Outsourced Database Organizations outsource their data management needs to an external provider. Organizations outsource their data management needs to an external provider. The service provider hosts client database and offers mechanisms. The service provider hosts client database and offers mechanisms. Create databasesCreate databases UpdatingUpdating StoringStoring Accessing (querying)Accessing (querying)

Advantages of ODB The organizations can concentrate on their core tasks and operate their business applications via Internet. The organizations can concentrate on their core tasks and operate their business applications via Internet. Don’t worry about Don’t worry about Deployment, instillation, maintenance,upgrades.Deployment, instillation, maintenance,upgrades. Hire, train/retain people.Hire, train/retain people.

Challenges Overall performance Overall performance Scalability Scalability Usability Usability

Challenges Privacy/Security Privacy/Security Protection of outsourced data from intruders and attacks.Protection of outsourced data from intruders and attacks. Protecting clients from misuse of data by service providers.Protecting clients from misuse of data by service providers. Ensuring integrity+privacy+completeness of query replies.Ensuring integrity+privacy+completeness of query replies.

Goal This paper investigate techniques to help ODB client authenticate the origin and verify the integrity of data returned by the service provider in response to a posed query. This paper investigate techniques to help ODB client authenticate the origin and verify the integrity of data returned by the service provider in response to a posed query.

System Model ODB is an example of Client –Server model. ODB is an example of Client –Server model. Types of ODB Types of ODB Unified Client ModelUnified Client Model Multi Querier ModelMulti Querier Model Multi Owner ModelMulti Owner Model

1. Unified Owner Scenario Data Deposit + Queries A single entity creates, queries, manipulates the database. Owner/Querier Encrypted User Database Server Server Site

2. Multi-Querier Scenario Encrypted User Database Data Deposit & queries Server Server Site Data Queries Querier 1 Querier 3 Querier 2 Owner/Querier

3. Multi-Owner Scenario Owner 1 Encrypted User Database Server Server Site Data Queries Querier 2 Owner 2Owner 3 Querier 1 Data Deposit & queries

Why do we need Integrity In some occasions where we may not want secrecy but want integrity In some occasions where we may not want secrecy but want integrity Every one is allowed to read a messageEvery one is allowed to read a message But no one is allowed to modify it.But no one is allowed to modify it.

Why do we need Authentication To authenticate the source of data. To authenticate the source of data. The main goal is to assure ODB clients that the data they receive from the server has not be tampered from an external adversary or the server itself. The main goal is to assure ODB clients that the data they receive from the server has not be tampered from an external adversary or the server itself.

Granularity of Integrity Table level-impractical for large tables. Table level-impractical for large tables. Column level-very expensive for the owner in terms of computation. Column level-very expensive for the owner in terms of computation. Optimal is to provide integrity at row level. Optimal is to provide integrity at row level.

Overhead Factors and Desired Features Querier computation Querier computation Querier bandwidth Querier bandwidth Server computation Server computation Owner computation Owner computation Server storage Server storage

MAC’s or Signatures With MAC client can ask server to store record along with MAC. With MAC client can ask server to store record along with MAC. Works for Unified Client model where owner and querier are same. Works for Unified Client model where owner and querier are same. Cannot be worked with other models Cannot be worked with other models MAC key to be shared between all owners and queriers.MAC key to be shared between all owners and queriers. Non repudiation of queries cannot be achieved.Non repudiation of queries cannot be achieved.

Standard RSA

Condensed RSA Server : Server : Selects records matching posed querySelects records matching posed query Multiplies corresponding RSA signaturesMultiplies corresponding RSA signatures Returns single signature to querierReturns single signature to querier Given t record signatures: {σ 1, σ 2 … σ t }, compute combined signature σ 1,t = Π σ i mod n Send σ 1,t to the querier Server σ 1,t Given t messages: {m 1,m 2 … m t } and σ 1,t verify combined signature: (σ 1,t ) e = ? = Π h(m i ) (mod n) Querier

Condensed RSA Reduced querier computation costs Reduced querier computation costs Querier performs (t-1) mult-s and a one exponentiationQuerier performs (t-1) mult-s and a one exponentiation Constant bandwidth overhead Constant bandwidth overhead Querier receives a single RSA signatureQuerier receives a single RSA signature As secure as batch RSA (with FDH) As secure as batch RSA (with FDH) Not efficient for Multi-Owner model Not efficient for Multi-Owner model

Batch Verification of RSA Signatures Batching: useful when many signature verifications need to be performed simultaneously Batching: useful when many signature verifications need to be performed simultaneously Reduces computational overhead Reduces computational overhead By reducing the total number of modular exponentiationsBy reducing the total number of modular exponentiations Fast screening of RSA signatures : Fast screening of RSA signatures : Given a batch instance of signatures {σ 1, σ 2 … σ t } on distinct messages {m 1, m 2 … m t }Given a batch instance of signatures {σ 1, σ 2 … σ t } on distinct messages {m 1, m 2 … m t } where h() is a full domain hash function

Fast Screening Reduces (somewhat) querier computation but not bandwidth overhead Reduces (somewhat) querier computation but not bandwidth overhead Individual signatures are sent to the querier for verificationIndividual signatures are sent to the querier for verification Bandwidth overhead can be overwhelming Bandwidth overhead can be overwhelming Consider weak (anemic) queriersConsider weak (anemic) queriers Query reply can have thousands of recordsQuery reply can have thousands of records Each RSA signature is at least 1024 bits!Each RSA signature is at least 1024 bits!

Cost Comparisons Condensed RSA Batch DSA Sign 1 signature Verify t =1000 sigs, k=1 signer t =100 sigs, k=10 signers t =1000 sigs, k = 10 signers Parameters: For RSA: |n| = 1024 For DSA: |p| = 1024 and |q| = Querier computation: