Chaining watermark is an effective way to verify the integrity of streaming data in wireless network environment,especially in resource-constrained sensor networks,such as the perception layer of Internet of Things ap...Chaining watermark is an effective way to verify the integrity of streaming data in wireless network environment,especially in resource-constrained sensor networks,such as the perception layer of Internet of Things applications.However,in all existing single chaining watermark schemes,how to ensure the synchronization between the data sender and the receiver is still an unsolved problem.Once the synchronization points are attacked by the adversary,existing data integrity authentication schemes are difficult to work properly,and the false negative rate might be up to 50 percent.And the additional fixed group delimiters not only increase the data size,but are also easily detected by adversaries.In this paper,we propose an effective dual-chaining watermark scheme,called DCW,for data integrity protection in smart campus IoT applications.The proposed DCW scheme has the following three characteristics:(1)In order to authenticate the integrity of the data,fragile watermarks are generated and embedded into the data in a chaining way using dynamic grouping;(2)Instead of additional fixed group delimiters,chained watermark delimiters are proposed to synchronize the both transmission sides in case of the synchronization points are tampered;(3)To achieve lossless integrity authentication,a reversible watermarking technique is applied.The experimental results and security analysis can prove that the proposed DCW scheme is able to effectively authenticate the integrity of the data with free distortion at low cost in our smart meteorological Internet of Things system.展开更多
With the popularity of the Internet and improvement of information technology,digital information sharing increasingly becomes the trend.More and More universities pay attention to the digital campus,and the construct...With the popularity of the Internet and improvement of information technology,digital information sharing increasingly becomes the trend.More and More universities pay attention to the digital campus,and the construction of digital library has become the focus of digital campus.A set of manageable,authenticated and secure solutions are needed for remote access to make the campus network be a transit point for the outside users.Remote Access IPSEC Virtual Private Network gives the solution of remote access to e-library resources,networks resources and so on very safely through a public network.It establishes a safe and stable tunnel which encrypts the data passing through it with robust secured algorithms.It is to establish a virtual private network in Internet,so that the two long-distance network users can transmit data to each other in a dedicated network channel.Using this technology,multi-network campus can communicate securely in the unreliable public internet.展开更多
With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) an...With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) and POR(Proofs of Retrievability) were proposed for this problem.Although many efficient schemes for static data have been constructed,only a few dynamic schemes exist,such as DPDP(Dynamic Provable Data Possession).But the DPDP scheme falls short when updates are not proportional to a fixed block size.The FlexList-based Dynamic Provable Data Possession(FlexDPDP) was an optimized scheme for DPDP.However,the update operations(insertion,remove,modification)in Flex DPDP scheme only apply to single node at a time,while multiple consecutive nodes operation is more common in practice.To solve this problem,we propose optimized algorithms for multiple consecutive nodes,which including MultiNodes Insert and Verification,MultiNodes Remove and Verification,MultiNodes Modify and Verification.The cost of our optimized algorithms is also analyzed.For m consecutive nodes,an insertion takes O(m) + O(log N) + O(log m),where N is the number of leaf nodes of FlexList,a remove takes O(log/V),and a modification is the same as the original algorithm.Finally,we compare the optimized algorithms with original FlexList through experiences,and the results show that our scheme has the higher efficiency of time and space.展开更多
基金This work is supported by the Major Program of the National Social Science Fund of China under Grant No.17ZDA092by the Electronic Information and Control of Fujian University Engineering Research Center Fund under Grant No.EIC1704+3 种基金by the National Key R&D Program of China under grant 2018YFB1003205by the National Natural Science Foundation of China under grant 61173136,U1836208,U1536206,U1836110,61602253,61672294by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)fundby the Collaborative Innovation Center of Atmospheric Environment and Equipment Technology(CICAEET)fund,China.
文摘Chaining watermark is an effective way to verify the integrity of streaming data in wireless network environment,especially in resource-constrained sensor networks,such as the perception layer of Internet of Things applications.However,in all existing single chaining watermark schemes,how to ensure the synchronization between the data sender and the receiver is still an unsolved problem.Once the synchronization points are attacked by the adversary,existing data integrity authentication schemes are difficult to work properly,and the false negative rate might be up to 50 percent.And the additional fixed group delimiters not only increase the data size,but are also easily detected by adversaries.In this paper,we propose an effective dual-chaining watermark scheme,called DCW,for data integrity protection in smart campus IoT applications.The proposed DCW scheme has the following three characteristics:(1)In order to authenticate the integrity of the data,fragile watermarks are generated and embedded into the data in a chaining way using dynamic grouping;(2)Instead of additional fixed group delimiters,chained watermark delimiters are proposed to synchronize the both transmission sides in case of the synchronization points are tampered;(3)To achieve lossless integrity authentication,a reversible watermarking technique is applied.The experimental results and security analysis can prove that the proposed DCW scheme is able to effectively authenticate the integrity of the data with free distortion at low cost in our smart meteorological Internet of Things system.
文摘With the popularity of the Internet and improvement of information technology,digital information sharing increasingly becomes the trend.More and More universities pay attention to the digital campus,and the construction of digital library has become the focus of digital campus.A set of manageable,authenticated and secure solutions are needed for remote access to make the campus network be a transit point for the outside users.Remote Access IPSEC Virtual Private Network gives the solution of remote access to e-library resources,networks resources and so on very safely through a public network.It establishes a safe and stable tunnel which encrypts the data passing through it with robust secured algorithms.It is to establish a virtual private network in Internet,so that the two long-distance network users can transmit data to each other in a dedicated network channel.Using this technology,multi-network campus can communicate securely in the unreliable public internet.
基金supported in part by the National Natural Science Foundation of China under Grant No.61440014&&No.61300196the Liaoning Province Doctor Startup Fundunder Grant No.20141012+2 种基金the Liaoning Province Science and Technology Projects under Grant No.2013217004the Shenyang Province Science and Technology Projects under Grant Nothe Fundamental Research Funds for the Central Universities under Grant No.N130317002 and No.N130317003
文摘With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) and POR(Proofs of Retrievability) were proposed for this problem.Although many efficient schemes for static data have been constructed,only a few dynamic schemes exist,such as DPDP(Dynamic Provable Data Possession).But the DPDP scheme falls short when updates are not proportional to a fixed block size.The FlexList-based Dynamic Provable Data Possession(FlexDPDP) was an optimized scheme for DPDP.However,the update operations(insertion,remove,modification)in Flex DPDP scheme only apply to single node at a time,while multiple consecutive nodes operation is more common in practice.To solve this problem,we propose optimized algorithms for multiple consecutive nodes,which including MultiNodes Insert and Verification,MultiNodes Remove and Verification,MultiNodes Modify and Verification.The cost of our optimized algorithms is also analyzed.For m consecutive nodes,an insertion takes O(m) + O(log N) + O(log m),where N is the number of leaf nodes of FlexList,a remove takes O(log/V),and a modification is the same as the original algorithm.Finally,we compare the optimized algorithms with original FlexList through experiences,and the results show that our scheme has the higher efficiency of time and space.
