Batch Auditing for Multiclient Data in Multicloud Storage
|
|
- Alexia Carroll
- 6 years ago
- Views:
Transcription
1 Advaned Siene and Tehnology Letters, pp Bath Auditing for Multilient Data in Multiloud Storage Zhihua Xia, Xinhui Wang, Xingming Sun, Yafeng Zhu, Peng Ji and Jin Wang Jiangsu Engineering Center of Networ Monitoring, Nanjing University of Information Siene & Tehnology, Nanjing, 20044, China Shool of Computer & Software, Nanjing University of Information Siene & Tehnology, Nanjing, 20044, China Abstrat. Cloud storage enables users to outsoure their data to loud servers and enjoy the on-demand high-quality servies. However, this new paradigm also introdues many hallenges due to the seurity and integrity threats toward user outsoured data. Reently, various remote integrity auditing methods have been proposed, but most of them an only serve for the single loud environment or the individual auditing for eah data file. In this paper, we develop an effiient auditing mehanism, whih support bath auditing for multiple data files in multi-loud environment. By utilizing the bilinear map, the proposed protool ahieves full stateless and transparent verifiation. By onstruting a sequene-enfored Merle Hash Tree, the proposed protool an resist the replae atta. In addition, our protool protets the position information of the data blos by generating fae data blos to onfuse the organizer. By omputing intermediate values of the verifiation on loud servers, our method an greatly redue the omputing overhead of the auditor. The performane analysis proves the good effiieny of the proposed protool. Introdution Cloud storage servie is an important servie of loud omputing, whih has beome a new profit growth point by relieving individuals or enterprises burden for storage management and maintenane. By remotely storing data into the loud, users an aess their data via networs at anytime and from anywhere. However, many users are still hesitant to use this novel paradigm due to the seurity and integrity threats toward their outsoured data. This is beause data loss ould our in any infrastruture, whatever high degree of reliable measures the loud servie providers (CSPs) would tae []. Moreover, the CSPs ould be dishonest. They may hide data loss aidents to maintain the reputation, or even disard the data that has not been or rarely aessed to save the storage spae and laim the data is still orretly stored in the loud. Therefore, it is highly essential for the loud users to he the integrity and availability of their loud data. In order to address the issue above, various Provable Data Possession (PDP) protools have been proposed [2-4]. PDP is a probabilisti proof tehnique for heing ISSN: ASTL Copyright 204 SERSC
2 Advaned Siene and Tehnology Letters the availability and integrity of outsoured data with randomly sampling a few file blos. Ateniese et al. [2] first defined PDP model with publi verifiation. They utilized RSA-based homomorphi linear authentiators (HLA) and suggested randomly sampling a few blos of the file for verifiation. In order to support dynami operations, Ateniese et al.[3] developed a partially dynami version of salable PDP model based on symmetri ey ryptography. After that, Erway et al. [4] presented a sip list-based dynamis PDP model with fully data dynami operation. Wang et al. also proposed a dynamis PDP sheme based on ombining Boneh Lynn Shaham signature (BLS)-based HLA with Merle Hash Tree (MHT) struture [5, 6]. The sheme supports both the publi stateless verifiation and fully dynami data update. Their subsequent wor [7] proposed a sheme supporting privay-preserving publi auditing, whih was also extended to enable bath auditing. In other related wor, Juels and alisi [8] desribe a proofs of retrievability (POR) model, whih not only an verify data possession but also ensure retrievability of raw data files when abnormality is deteted. Most of the above PDP shemes mainly address integrity verifiation issues at a single CSP. As a more feasible appliation senario, users may store their data in multiloud with a distributed manner to redue the threats of data integrity and availability [9]. In this senario, multiloud is omposed of multiple private or publi louds. Eah CSP has a different level of quality of servie as well as a different ost assoiated with it. Hene, the users an store their data files on more than one CSP aording to the required level of seurity and their affordable budgets. Within multiloud, an organization an offer and manage in-house and out-house resoures [0, ]. In this paper, we develop an effiient auditing mehanism, whih support bath auditing for multiple data files in multi-loud environment. By utilizing the bilinear map, the proposed protool an aggregate the verifiation tas from different users to redue the omputing overhead of the auditor. By onstruting a sequene-enfored Merle Hash Tree, the proposed protool an resist the replae atta. In addition, our protool protets the position information of the data blos by generating fae data blos to onfuse the organizer, so as to ahieve full stateless and transparent verifiation. 2 Problem Statement We onsider a multiloud storage servie model whih is adopted by some previous wors [0, ]. The model involves three different entities loud users, multiloud and third party auditor. The loud users have a number of data files to be stored in multiple louds. They have the authority to aess and manipulate the stored data. The multi-loud onsists of multiple Cloud Server Providers (CSPs). They provide data storage servie and have enough storage spae and signifiant omputation resoures. In this paper, to redue the ommuniation burden of verifier, one of CSPs is designated as an organizer for auditing purpose. For example, the Zoho loud in Fig. is onsidered as an organizer. In our sheme, the organizer taes the responsibility to 68 Copyright 204 SERSC
3 Advaned Siene and Tehnology Letters distribute the auditing hallenge and aggregate the proof from multiple louds. In this paper, we suppose that the CSPs annot ommuniate with eah other apart from the organizer for the auditing issues, and also, the verifier an only ontat with the organizer. The Third Party Auditor (TPA) has a more powerful omputation and ommuniation ability than regular loud users. In loud storage system, none of loud servie providers or users ould be guaranteed to provide unbiased auditing result. Thus, third party auditing is a natural hoie. Moreover, by resorting to TPA, users an be relieved from the burden of heing the integrity of outsoure data. 3 The Bath Auditing CPDP Protool In the proposed protool, we need to use a bilinear map group system, two hash funtions and a signature funtion. Let S ( p, g, G, G, G, e ) be a bilinear map group 2 T system with generator g, where G, G 2 and G T are multipliative yli groups of * prime order p, and e : G G G is a bilinear map. Let H ( ) : {0,} G be a seure 2 T map-to-point hash funtion, h ( ) : G Z be another hash funtion whih maps ele- T p ment of G to Z T p, and S ig () be the signature funtion. Let { U } be the set of users, and { P } be the set of CSPs. The number of CSPs is denoted as C. 3. Setup Phase Eah user runs setup phase of the protool as follow: Step: e y G e n ( ). The th user U generates a signing ey pair ( ss, sp ). Se- let a random Z p, and ompute g. Selet s random elements { u, u,..., u } G,, 2, s publi parameters are p s p g u,. To sum up, the seret ey is s (, ss ) and the j j s (,,,{ } ). Step2: T a g G en ( s, F, P ). The user U splits his file F into n s setors F { m } Z n s, i, j i[, n ], l[, s ] p, where the i th blo of user U blo m onsists, i i i i s of s setors { m, m,..., m }. The user om-,,,, 2,, putes t n a m e n S ig ( n a m e n ) ss as the file tag for F, where n a m e is the file name. Next, the user U onstruts SMHT with a root R, where the leave nodes are an ordered hash values of data blos { ( )} as desribed in part 2.3. The,, [, ] user also signs R with the private ey : T H m i i i n. () S ig ( H ( R )) ( H ( R )) Copyright 204 SERSC 69
4 Advaned Siene and Tehnology Letters For eah data blo m ( i [, n ]), the user U omputes a data tag as, i, i,, ( s m i j T u ), i, i j, j. (2) Besides, the user U generates an additional random data blo denoted as, n ' m, whih is also divided into s setors { m }. Then the orresponding tag is omputed, n ', j j [, s ] as C, ', ( ( ) s m n j H R u ), n ' j, j. (3) After all the parameters have been prepared, the user U distributes the data blo and tag pairs ( m, ) to the orresponding loud servie providers, and sends the, i, i random data blo and its orresponding tag ( m, ) to eah loud servie provid-, n ', n ' er. In addition, the user U sends the parameters{s M H T, S ig ( H ( R )), t } to the organizer, and sends the publi parameters p to TPA. After data transmission, the user ass TPA to ondut the onfirmation auditing to mae sure that their data is orretly stored on all the servers. One onfirmed, the user an hoose to delete the loal opy of the data blos apart from the seret ey. By now, TPA ould run the sampling auditing periodially to he the data integrity for users. 3.2 Bath Audit Phase Suppose that TPA proess auditing sessions of distint data files simultaneously. The data files are stored on C CSPs ({ P } C ). The audit phase is exeuted as follows: Step: G en P ro o f ({ m, }, h a l ). It is an interative 5-move protool among CSPs, i i an organizer (O), and an Auditor (TPA). This proess is desribed in the following. ) Retrieve (O TPA): After reeiving the verifiation request, the organizer sends the file tags { t } to the TPA. The TPA [, ] ers { } [, ] n a m e and { n } by using publi eys { s s p }, and verifies all [, ] [, ] the signatures. The verifiation quit by emitting FALSE if the file name verifiation fails. 2) Challenge (O TPA): If the file name is suessful verified, the TPA generates hallenge index-oeffiient message { (, )} for [, ] Q i v i i I, where I [, n ] speifies the sampled blos that will be verified, and v i Z p is random element. TPA hooses a random element Z p and omputes the set of 70 Copyright 204 SERSC
5 Advaned Siene and Tehnology Letters hallenge stamps { H } [,. To sum up, TPA generates the hallenge as ] follow, and sent it to the organizer. (,{ } ). (4) [, ] hal Q H [, ] 3) Challenge2 (P O): Upon reeiving the hallenge hal from the TPA, the organizer forwards hal to eah P. 4) Response (P O): For eah Q, eah P pis out the symbol m P means that the data blo m, i, i Q { ( i, v )} Q,. Here, i m, i P is stored on P. Then, P al- ulates the linear ombination of speified data blos for eah file as = m,, j, n ', j v m Z, (5) i, i, j p ( i, vi ) Q, 5) and generates data proof DP and tag proof TP as s,, j D P (, ) e u H, j j T P v i ( ), n ', i, G ( i, vi ) Q,. (6) Finally, P returns ( D P, T P ) to the organizer. 6) Response2 (O TPA): Upon reeiving all the proofs from all the CSPs, the organizer aggregates all of the proof into a response ( D P, T P ), whih are alulated as (7) D P D P, T P T P. In addition, the organizer also provides the TPA with AAI { }, whih, i ii, [, ] are the siblings of the nodes on the path from the leaves { T } to the, i ii, [, ] root R of the S M H T. Finally, the organizer responds TPA with proof.,,, (8) i P r S ig H R ii, [, ] [, ] Step2: B a th V erifyp ro o f ( p, h a l, P r ). After reeiving proof Pr from the organizer, TPA starts to verify to proof. First, for eah [, ] and i I, TPA first verifies the position of { T } by heing if the, i fo r i I, [, ] tion, L E F T ( T ) i i holds or not. Seond, TPA onstruts a verifiation root R ' by Copyright 204 SERSC 7
6 Advaned Siene and Tehnology Letters using { T, } for [, ], and verifies values of R ' by heing Eq. (0)., i, i i I Third, if the both authentiation above sueeds, TPA verifies data integrity by heing Eq. (). e ( sig ( H ( R )), g ) e ( H ( R '), )? (9)? v i, i (0) ii e ( T P, g ) D P e ( H ( R ) T, H ) If the data blos are not damaged by the loud server, the equation () will be proved to be true. 4 Seurity Analysis Privay-preserving property: Before omputing and returning Response, CSPs will authentiate the hallenge requests with the ertifiate issued by user on TPA s publi ey. Thus, only TPA an send the authentiation request. Moreover, after reeive the final response from the organizer, TPA need to first validate the leaves of the SMHT whih is stored in the organizer. This guarantees only the organizer an ompute the final response. Besides, to protet the data privay, we use Eq. (6) to proess the linear ombination of speified data blos, whih is the same as the random mas tehnique. Transparent verifiation property: This paper introdues an organizer, who is responsible for interating with TPA. So, TPA annot learn the details of data storage. In this paper, it is onsidered that the organizer is also not trusted. In order to prevent the organizers from getting the loation of the data blo, user generates a pair of additional data-tag whih will be sent to eah CSP at setup phase of protool. At the audit phase, whihever data blos are in the hallenge request from the TPA, every CSP will send a response to the organizer, whih an oneal the details of data storage from the organizer. Thus, the proposed bath auditing protool oneals the storage details of multiple CSPs from both TPA and the organizer. 5 Conlusions In this paper, we explore ollaborative integrity auditing issue of remote data stored in the multiple louds. A bath auditing PDP mehanism for multi-loud environment is proposed. Our onstrution enables TPA to perform multiple auditing tass for multiple data files in multiple louds. Meanwhile, transparent verifiation, full stateless verifiation and seure are also important objetives of the protool. Utilizing the smht onstrution, the proposed protool ahieves full stateless verifiation and dynami data operation with integrity assurane. The paper uses BLS-based homo- 72 Copyright 204 SERSC
7 Advaned Siene and Tehnology Letters mophi authentiator to equip the verifiation protool, whih enable the TPA to perform bath audits for multiple users based on the tehnique of bilinear aggregate signature. In addition, by letting the loud servers omputing intermediate values of the verifiation for the auditor, our method an greatly redue the omputing overhead of the TPA. At last, seurity analysis shows that the proposed bath auditing protool is seure, and it also holds muh better effiieny than the individual auditing with our performane evaluation. Anowledgements. This wor is supported by the NSFC (623206, 6734, 67342, 67336, 60325, , ), GYHY , , 203DFG2860, BC20302 and PAPD fund. Referenes. Goodson, G. R. et al.: Effiient Byzantine-tolerant erasure-oded storage. Dependable Systems and Networs, 2004 International Conferene on, 2004, pp Ateniese, G. et al.: Provable data possession at untrusted stores. Proeedings of the 4th ACM onferene on Computer and ommuniations seurity, 2007, pp Ateniese, G. et al.: Salable and effiient provable data possession. Proeedings of the 4th international onferene on Seurity and privay in ommuniation netowrs, 2008, p Erway, C. et al.: Dynami provable data possession. Proeedings of the 6th ACM onferene on Computer and ommuniations seurity, 2009, pp Wang, Q. et al.: Enabling publi auditability and data dynamis for storage seurity in loud omputing. Parallel and Distributed Systems, IEEE Transations on, vol. 22, pp , Boneh, D. et al.: Short signatures from the Weil pairing. Advanes in Cryptology ASIACRYPT 200, ed: Springer, 200, pp Wang, C. et al.: Privay-preserving publi auditing for seure loud storage A. Juels and B. S. alisi Jr.: PORs: Proofs of retrievability for large files," in Proeedings of the 4th ACM onferene on Computer and ommuniations seurity, 2007, pp AlZain, M. A. et al.: Cloud omputing seurity: from single to multi-louds. System Siene (HICSS), th Hawaii International Conferene on, 202, pp Zhu, Y. et al.: Collaborative integrity verifiation in hybrid louds. Collaborative Computing: Networing, Appliations and Worsharing (CollaborateCom), 20 7th International Conferene on, 20, pp Zhu, Y. et al.: Cooperative provable data possession for integrity verifiation in multi-loud storage. IEEE Transations on Parallel and Distributed Systems, vol. 23(2), pp , 202. Copyright 204 SERSC 73
Robust Dynamic Provable Data Possession
Robust Dynami Provable Data Possession Bo Chen Reza Curtmola Department of Computer Siene New Jersey Institute of Tehnology Newark, USA Email: b47@njit.edu, rix@njit.edu Abstrat Remote Data Cheking (RDC)
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationAustralian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message
ISSN:1991-8178 Australian Journal of Basi and Applied Sienes Journal home page: www.ajbasweb.om A new Divide and Shuffle Based algorithm of Enryption for Text Message Dr. S. Muthusundari R.M.D. Engineering
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationEstablishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments
Establishing Seure Ethernet LANs Using Intelligent Swithing Hubs in Internet Environments WOEIJIUNN TSAUR AND SHIJINN HORNG Department of Eletrial Engineering, National Taiwan University of Siene and Tehnology,
More informationParallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup
Parallelizing Frequent Web Aess Pattern Mining with Partial Enumeration for High Peiyi Tang Markus P. Turkia Department of Computer Siene Department of Computer Siene University of Arkansas at Little Rok
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationDoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay
DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at
More informationImproving data integrity on cloud storage services
International Journal of Engineering Science Invention Volume 2 Issue 2 ǁ February. 2013 Improving data integrity on cloud storage services Miss. M.Sowparnika 1, Prof. R. Dheenadayalu 2 1 (Department of
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationComparison of Zero Knowledge Authentication Protocols SUBHASISH PARAMANIK (110CS0371)
NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA Comparison of Zero Knowledge Authentiation Protools By SUBHASISH PARAMANIK (110CS0371) A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationDETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT
DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,
More informationFuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis
Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer
More informationCapturing Large Intra-class Variations of Biometric Data by Template Co-updating
Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University
More informationSVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections
SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationEfficient Data Storage Security with Multiple Batch Auditing in Cloud Computing
Efficient Data Storage Security with Multiple Batch Auditing in Cloud Computing P. Sukumar [1] Department of Computer Science Sri Venkateswara College of Engineering, Chennai B. Sathiya [2] Department
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationFast Elliptic Curve Algorithm of Embedded Mobile Equipment
Send Orders for Reprints to reprints@benthamsiene.net 8 The Open Eletrial & Eletroni Engineering Journal, 0, 7, 8-4 Fast Ellipti Curve Algorithm of Embedded Mobile Equipment Open Aess Lihong Zhang *, Shuqian
More information- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.
- 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?
More informationSTRUCTURED EMINENT DYNAMIC AUDITING FOR SECURE DATA STORAGE IN CLOUD COMPUTING
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 STRUCTURED EMINENT DYNAMIC AUDITING FOR SECURE DATA STORAGE IN CLOUD COMPUTING Mr.Elamparithi P 1, Mr.Thanga Mariappan
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationMulti-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks
Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,
More informationBatch Verification Scheme for Economic Cloud Storage Services
Batch Verification Scheme for Economic Cloud Storage Services K. Sudha 1, Mr. S. Sivaraj, ME 2 II-M.E (CSE), Dept. of CSE, SSM College of Engineering, Komarapalayam, Tamilnadu, India 1 Assistant Professor,
More informationUplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks
62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering
More informationFast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon
ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb
More informationPBFT: A Byzantine Renaissance. The Setup. What could possibly go wrong? The General Idea. Practical Byzantine Fault-Tolerance (CL99, CL00)
PBFT: A Byzantine Renaissane Pratial Byzantine Fault-Tolerane (CL99, CL00) first to be safe in asynhronous systems live under weak synhrony assumptions -Byzantine Paos! The Setup Crypto System Model Asynhronous
More informationCA Single Sign-On 12.x Proven Implementation Professional Exam (CAT-140) Study Guide Version 1.5
Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized use,
More information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationCluster-based Cooperative Communication with Network Coding in Wireless Networks
Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu
More informationManaging Handover Authentication in Big-domain Wireless Environment
Managing Handover Authentiation in Big-domain Wireless Environment Changsheng Wan, Aiqun Hu, Juan Zhang Managing Handover Authentiation in Big-domain Wireless Environment Changsheng Wan *1, Aiqun Hu *1,
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationDynamic Algorithms Multiple Choice Test
3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih
More informationEpisode 12: TCP/IP & UbiComp
Episode 12: TCP/IP & UbiComp Hannes Frey and Peter Sturm University of Trier Outline Introdution Mobile IP TCP and Mobility Conlusion Referenes [1] James D. Solomon, Mobile IP: The Unplugged, Prentie Hall,
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationPerformance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification
erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,
More informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More informationA Lightweight Intrusion-Tolerant Overlay Network
A Lightweight Intrusion-Tolerant Overlay Network Rafael R. Obelheiro and Joni da Silva Fraga Department of Automation and Systems Federal University of Santa Catarina, Brazil Email: rro@das.ufs.br, fraga@das.ufs.br
More informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
More informationNew Channel Allocation Techniques for Power Efficient WiFi Networks
ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More informationComputing Pool: a Simplified and Practical Computational Grid Model
Computing Pool: a Simplified and Pratial Computational Grid Model Peng Liu, Yao Shi, San-li Li Institute of High Performane Computing, Department of Computer Siene and Tehnology, Tsinghua University, Beijing,
More informationA Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks
A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,
More informationModel Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology
The International Arab Journal of Information Tehnology, Vol. 12, No. 6, November 15 519 Model Based Approah for Content Based Image Retrievals Based on Fusion and Relevany Methodology Telu Venkata Madhusudhanarao
More informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationCA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5
Proven Professional Exam (CAT-480) Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationTorpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control
orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More informationA Dynamic Proof of Retrievability (PoR) Scheme with O(logn) Complexity
A Dynamic Proof of Retrievability (PoR) Scheme with O(logn) Complexity Zhen Mo Yian Zhou Shigang Chen Department of Computer & Information Science & Engineering University of Florida, Gainesville, FL 32611,
More informationIN structured P2P overlay networks, each node and file key
242 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2010 Elasti Routing Table with Provable Performane for Congestion Control in DHT Networks Haiying Shen, Member, IEEE,
More informationSecure Auditing For Outsourced Data in Cloud Using Homomorphic Token and Erasure Code
Secure Auditing For Outsourced Data in Cloud Using Homomorphic Token and Erasure Code N.S. Monalisa Devi 1, T. Sounder Rajan 2 M.E. Department of CSE, K S R College for Engineering and Technology, Tiruchengode,
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationAn Interactive-Voting Based Map Matching Algorithm
Eleventh International Conferene on Mobile Data Management An Interative-Voting Based Map Mathing Algorithm Jing Yuan* University of Siene and Tehnology of China Hefei, China yuanjing@mail.ust.edu.n Yu
More informationTMIX: Temporal Model for Indexing XML Documents
TMIX: Temporal Model for Indexing XML Douments Rasha Bin-Thalab Department of Information System Faulty of omputers and Information Cairo University, Egypt azi_z30@yahoo.om Neamat El-Tazi Department of
More informationWe don t need no generation - a practical approach to sliding window RLNC
We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,
More informationPROJECT PERIODIC REPORT
FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise
More informationAdobe Certified Associate
Adobe Certified Assoiate About the Adobe Certified Assoiate (ACA) Program The Adobe Certified Assoiate (ACA) program is for graphi designers, Web designers, video prodution designers, and digital professionals
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationAn Efficient Dynamic Proof of Retrievability (PoR) Scheme
An Efficient Dynamic Proof of Retrievability (PoR) Scheme Zhen Mo Yian Zhou Shigang Chen Department of Computer & Information Science & Engineering University of Florida, Gainesville, FL 32611, USA Abstract
More informationRouting Protocols for Wireless Ad Hoc Networks Hybrid routing protocols Theofanis Kilinkaridis
Routing Protools for Wireless Ad Ho Networks Hyrid routing protools Theofanis Kilinkaridis tkilinka@.hut.fi Astrat This paper presents a partiular group of routing protools that aim to omine the advantages
More informationDubins Path Planning of Multiple UAVs for Tracking Contaminant Cloud
Proeedings of the 17th World Congress The International Federation of Automati Control Dubins Path Planning of Multiple UAVs for Traking Contaminant Cloud S. Subhan, B.A. White, A. Tsourdos M. Shanmugavel,
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationAn Efficient Provable Data Possession Scheme based on Counting Bloom Filter for Dynamic Data in the Cloud Storage
, pp. 9-16 http://dx.doi.org/10.14257/ijmue.2016.11.4.02 An Efficient Provable Data Possession Scheme based on Counting Bloom Filter for Dynamic Data in the Cloud Storage Eunmi Jung 1 and Junho Jeong 2
More informationCOMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP
Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European
More informationDetecting Outliers in High-Dimensional Datasets with Mixed Attributes
Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of
More informationA Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks
International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering
More informationImproved flooding of broadcast messages using extended multipoint relaying
Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia
More informationAcoustic Links. Maximizing Channel Utilization for Underwater
Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it
More informationCooperative Coverage Extension for Relay-Union Networks
1.119/TPDS.214.23821, IEEE Transations on Parallel and Distributed Systems IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Cooperative Coverage Extension for Relay-Union Networks Yong Cui, Xiao
More informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationA Coarse-to-Fine Classification Scheme for Facial Expression Recognition
A Coarse-to-Fine Classifiation Sheme for Faial Expression Reognition Xiaoyi Feng 1,, Abdenour Hadid 1 and Matti Pietikäinen 1 1 Mahine Vision Group Infoteh Oulu and Dept. of Eletrial and Information Engineering
More informationDegree-Optimal Routing for P2P Systems
DOI 10.1007/s00224-007-9074-x Degree-Optimal Routing for P2P Systems Giovanni Chiola Gennaro Cordaso Luisa Gargano Mikael Hammar Alberto Negro Vittorio Sarano Springer Siene+Business Media, LLC 2007 Abstrat
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationScalable P2P Search Daniel A. Menascé George Mason University
Saling the Web Salable P2P Searh aniel. Menasé eorge Mason University menase@s.gmu.edu lthough the traditional lient-server model irst established the Web s bakbone, it tends to underuse the Internet s
More informationRAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,
More informationRecursion examples: Problem 2. (More) Recursion and Lists. Tail recursion. Recursion examples: Problem 2. Recursion examples: Problem 3
Reursion eamples: Problem 2 (More) Reursion and s Reursive funtion to reverse a string publi String revstring(string str) { if(str.equals( )) return str; return revstring(str.substring(1, str.length()))
More informationNew Fuzzy Object Segmentation Algorithm for Video Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationFine-Grained Data Updates on Cloud with Authorized Public Auditing
IJSRD - International Journal for Scientific Research & Development Vol. 3, Issue 03, 2015 ISSN (online): 2321-0613 Fine-Grained Data Updates on Cloud with Authorized Public Auditing Sindhu L 1 Ms Leelavathi
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationUsing Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks
Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La
More informationImage Steganography Scheme using Chaos and Fractals with the Wavelet Transform
International Journal of Innovation, Management and Tehnology, Vol. 3, o. 3, June Image Steganography Sheme using Chaos and Fratals with the Wavelet Transform Yue Wu and Joseph P. oonan bstrat This paper
More informationHigh-level synthesis under I/O Timing and Memory constraints
Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,
More informationDistributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters
Proeedings of the 45th IEEE Conferene on Deision & Control Manhester Grand Hyatt Hotel an Diego, CA, UA, Deember 13-15, 2006 Distributed Resoure Alloation trategies for Ahieving Quality of ervie in erver
More information