Data Integrity Proofs in Cloud Storage Author: Sravan Kumar R and Ashutosh Saxena. Source: The Third International Conference on Communication Systems.

Slides:



Advertisements
Similar presentations
Trusted Data Sharing over Untrusted Cloud Storage Provider Gansen Zhao, Chunming Rong, Jin Li, Feng Zhang, and Yong Tang Cloud Computing Technology and.
Advertisements

PROOFS OF RETRIEVABILITY VIA HARDNESS AMPLIFICATION Yevgeniy Dodis, Salil Vadhan and Daniel Wichs.
Secure Data Storage in Cloud Computing Submitted by A.Senthil Kumar( ) C.Karthik( ) H.Sheik mohideen( ) S.Lakshmi rajan( )
Cloud Computing Security Monir Azraoui, Kaoutar Elkhiyaoui, Refik Molva, Melek Ӧ nen, Pasquale Puzio December 18, 2013 – Sophia-Antipolis, France.
Cryptanalysis of a Communication-Efficient Three-Party Password Authenticated Key Exchange Protocol Source: Information Sciences in review Presenter: Tsuei-Hung.
ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
Henry C. H. Chen and Patrick P. C. Lee
HAIL (High-Availability and Integrity Layer) for Cloud Storage
CS470, A.SelcukCryptographic Authentication1 Cryptographic Authentication Protocols CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
Building web applications on top of encrypted data using Mylar Presented by Tenglu Liang Tai Liu.
Data Integrity Proofs in Cloud Storage Sravan Kumar R, Ashutosh Saxena Communication Systems and Networks (COMSNETS), 2011 Third International Conference.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
1 Secure Credit Card Transactions on an Untrusted Channel Source: Information Sciences in review Presenter: Tsuei-Hung Sun ( 孫翠鴻 ) Date: 2010/9/24.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
PORs: Proofs of Retrievability for Large Files
Ragib Hasan University of Alabama at Birmingham CS 491/691/791 Fall 2011 Lecture 10 09/15/2011 Security and Privacy in Cloud Computing.
Efficient Private Techniques for Verifying Social Proximity Michael J. Freedman and Antonio Nicolosi Discussion by: A. Ziad Hatahet.
Implementation of a Two-way Authentication Protocol Using Shared Key with Hash CS265 Sec. 2 David Wang.
Using Auxiliary Sensors for Pair-Wise Key Establishment in WSN Source: Lecture Notes in Computer Science (2010) Authors: Qi Dong and Donggang Liu Presenter:
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Apr 22, 2003Mårten Trolin1 Agenda Course high-lights – Symmetric and asymmetric cryptography – Digital signatures and MACs – Certificates – Protocols Interactive.
Security in Wireless LAN Layla Pezeshkmehr CS 265 Fall 2003-SJSU Dr.Mark Stamp.
SSH : The Secure Shell By Rachana Maheswari CS265 Spring 2003.
Privacy and Integrity Preserving in Distributed Systems Presented for Ph.D. Qualifying Examination Fei Chen Michigan State University August 25 th, 2009.
DSAC (Digital Signature Aggregation and Chaining) Digital Signature Aggregation & Chaining An approach to ensure integrity of outsourced databases.
1 Hidden Exponent RSA and Efficient Key Distribution author: He Ge Cryptology ePrint Archive 2005/325 PDFPDF 報告人:陳昱升.
DSAC (Digital Signature Aggregation and Chaining) Digital Signature Aggregation & Chaining An approach to ensure integrity of outsourced databases.
Chapter 3 Encryption Algorithms & Systems (Part C)
PRIAM: PRivate Information Access Management on Outsourced Storage Service Providers Mark Shaneck Karthikeyan Mahadevan Jeff Yongdae Kim.
Team CMD Distributed Systems Team Report 2 1/17/07 C:\>members Corey Andalora Mike Adams Darren Stanley.
Practical Techniques for Searches on Encrypted Data Yongdae Kim Written by Song, Wagner, Perrig.
Authentication Approaches over Internet Jia Li
Cong Wang1, Qian Wang1, Kui Ren1 and Wenjing Lou2
Construction of efficient PDP scheme for Distributed Cloud Storage. By Manognya Reddy Kondam.
.Net Security and Performance -has security slowed down the application By Krishnan Ganesh Madras.
Wireless security & privacy Authors: M. Borsc and H. Shinde Source: IEEE International Conference on Personal Wireless Communications 2005 (ICPWC 2005),
An Efficient Identity-based Cryptosystem for
A Survey on Secure Cloud Data Storage ZENG, Xi CAI, Peng
DATA DYNAMICS AND PUBLIC VERIFIABILITY CHECKING WITHOUT THIRD PARTY AUDITOR GUIDED BY PROJECT MEMBERS: Ms. V.JAYANTHI M.E Assistant Professor V.KARTHIKEYAN.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
LT Codes-based Secure and ReliableCloud Storage Service
SecureMR: A Service Integrity Assurance Framework for MapReduce Author: Wei Wei, Juan Du, Ting Yu, Xiaohui Gu Source: Annual Computer Security Applications.
An Authenticated Payword Scheme without Public Key Cryptosystems Author: Chia-Chi Wu, Chin-Chen Chang, and Iuon-Chang Lin. Source: International Journal.
Phosphor A Cloud based DRM Scheme with Sim Card th International Asia-Pacific Web Conference Author : Peng Zou, Chaokun Wang, Zhang Liu, Dalei.
Kerberos Named after a mythological three-headed dog that guards the underworld of Hades, Kerberos is a network authentication protocol that was designed.
Speaker: Meng-Ting Tsai Date:2010/11/16 Toward Publicly Auditable Secure Cloud Data Storage Services Cong Wang and Kui Ren..etc IEEE Communications Society.
WEP Protocol Weaknesses and Vulnerabilities
Strong Security for Distributed File Systems Group A3 Ka Hou Wong Jahanzeb Faizan Jonathan Sippel.
Practical Byzantine Fault Tolerance
MSRC: (M)icropayment (S)cheme with Ability to (R)eturn (C)hanges Source: Journal of Information Science and Engineering in review Presenter: Tsuei-Hung.
Authentication of Signaling in VoIP Applications Authors: Srinivasan et al. (MIT Campus of Anna University, India) Source: IJNS review paper Reporter:
Denial-of-Service, Address Ownership,and,Early Authentication in IPv6 World (An Approach) Aditya Vutukuri From article by Pekka Nikander Ericsson Research.
Merkle trees Introduced by Ralph Merkle, 1979 An authentication scheme
Secure Communication between Set-top Box and Smart Card in DTV Broadcasting Authors: T. Jiang, Y. Hou and S. Zheng Source: IEEE Transactions on Consumer.
Speaker : YUN–KUAN,CHANG Date : 2010/08/05 Scalable and Efficient Provable Data Possession.
Authentication protocol providing user anonymity and untraceability in wireless mobile communication systems Computer Networks Volume: 44, Issue: 2, February.
Presented by Sharan Dhanala
User authentication schemes with pseudonymity for ubiquitous sensor network in NGN Authors: Binod Vaidya, Joel J. Rodrigues and Jong Hyuk Park Source:
多媒體網路安全實驗室 Practical Searching Over Encrypted Data By Private Information Retrieval Date: Reporter: Chien-Wen Huang 出處: GLOBECOM 2010, 2010 IEEE.
Interleaving and Collusion Attacks on a Dynamic Group Key Agreement Scheme for Low-Power Mobile Devices * Junghyun Nam 1, Juryon Paik 2, Jeeyeon Kim 2,
多媒體網路安全實驗室 Anonymous Authentication Systems Based on Private Information Retrieval Date: Reporter: Chien-Wen Huang 出處: Networked Digital Technologies,
1 An Ordered Multi-Proxy Multi-Signature Scheme Authors: Min-Shiang Hwang, Shiang-Feng Tzeng, Shu-Fen Chiou Speaker: Shu-Fen Chiou.
Threshold password authentication against guessing attacks in Ad hoc networks ► Chai, Zhenchuan; Cao, Zhenfu; Lu, Rongxing ► Ad Hoc Networks Volume: 5,
TOMIN: Trustworthy Mobile Cash with Expiration-date Attached Author: Rafael Martínez-Peláez and Francisco Rico-Novella. Source: Journal of Software, 2010,
Ari Juels, Burton S. Kaliski Jr 14th ACM conference on Computer and communications security,2007 Cited:793 Presenter: 張哲豪 Date:2014/11/24.
Database Laboratory Regular Seminar TaeHoon Kim Article.
SDSM IN MOBILE CLOUD COMPUTING By- ID NO-1069 K.C. SHARMILAADEVI Sethu Institute Of Tech IV year-ECE Department CEC Batch: AUG 2012.
Cryptography CSS 329 Lecture 13:SSL.
How can we prove that cloud files are encrypted.?
Reporter:Chien-Wen Huang
Presentation transcript:

Data Integrity Proofs in Cloud Storage Author: Sravan Kumar R and Ashutosh Saxena. Source: The Third International Conference on Communication Systems and Networks (COMSNETS), 2011, Bangalore, India, pp. 1–4. Presenter: Tsuei-Hung Sun ( 孫翠鴻 ) Date: 2011/3/4

Outline Introduction Motivation Scheme Performance Evaluation Advantage vs. Drawback Comment

Introduction(1/3) Data outsourcing to cloud storage server –Data Authentication –Data Integrity Proof of retrievability (POR) –Obtain and verify data is not modified. –Using a keyed hash function h K (F). –Prevent the cloud storage archives modifying the data without the consent of the data owner. H(.): hash function K: Secret Key F: File

Introduction(2/3) Drawback of POR –It need high resource cost for the implementation. –It need to store secret key and hash value as many as file that stored at server. –It is a burdensome for server and some device.

Introduction(3/3) Proof of retrievability for large files using “sentinels.” –Only a single key can be used. –Access only a small portion of the file F. –Setup phase: Randomly embeds sentinels among the data blocks. –Verification phase: Verifier check the integrity of the data file F by challenge prover specifies positions and asking return the associated sentinel values. A. Juels and B. S. Kaliski, Jr., “Pors: proofs of retrievability for large files,” Proceedings of the 14th ACM conference on Computer and communications security, New York, USA, 2007, pp. 584–597.

Motivation The improve scheme need to insert sentinels and error correcting codes. The improve scheme need to store all sentinels. In the future, the owner of data maybe a small device (ex. PDA, mobile phone) Goal –Deal with the problem of implementing POR. –Proof without the need to access the entire file or client to retrieving the entire file from the server. –Minimizing the local computation and bandwidth consumed at the client.

Scheme(1/4) Assumption and Limit –Storage server might not be malicious. –The proof of data integrity protocol just checks the integrity of data. –Only apply to static storage of data. –The number of queries that can be asked by the client is fixed.

Scheme(2/4) Setup phase –Let file F consist of n blocks and create metadata to append on it. –Let each of n data blocks have m bits in them. Fig. A data file F with 6 data blocks.

Scheme(3/4) Setup phase (cont.) 1. Generation of meta-data  2. Encrypting the meta data  3. Appending of meta data k: The number of bits per data block which read as meta data. g: a function to generates a set of k bit positions. h: a function to generates a k bit integer α i for each i. M i : a encrypted m i by h.

Scheme(4/4) Verification phase Verifier (Client)Archive (Cloud) Challenges g(i,j) Using g(i,j) to find the corresponding meta data. k+1 bits Using α i to decrypt Compare decrypted bits and send by cloud bits

Performance Evaluation Storing only a single cryptographic key and two functions which using to generate a random sequence. Only encrypting a part of file, so it can save computational time of the client. Using XOR to instead hash function is more efficient. Verification just need to find and send few bits of data to the client. Network bandwidth is very less (k+1 bits for one proof).

Advantage vs. Drawback Advantage –Reducing the computational and storage overhead of the client. –Minimizing the computational overhead of the cloud. –Reducing the network bandwidth consumption. –It is advantageous to thin clients. Drawback –It not prevent the archive from modifying the data.

Comment The decryption and comparison are not very clear to check that the response is correct or not. It still need to store α i as many as number of files.