Xiangsong Zhang, Zhenhua Liu, Xu An Wang, Fenghe Wang
{"title":"Constant-size ring signature scheme using multilinear maps","authors":"Xiangsong Zhang, Zhenhua Liu, Xu An Wang, Fenghe Wang","doi":"10.1504/ijes.2020.10027497","DOIUrl":"https://doi.org/10.1504/ijes.2020.10027497","url":null,"abstract":"Ring signature is a group-oriented digital signature with anonymity. Most of existing ring signature schemes use bilinear pairings, are provably secure in the random oracles, or are linear signature size to the number of ring member. In this paper, we use multilinear maps, which have been widely used to construct many novel cryptographic primitives recently, to present a ring signature scheme with constant signature size. The proposed scheme is proven to be anonymous against full key exposure and unforgeable against chosen-subring attacks based on the multilinear computational Diffie-Hellman assumption in the standard model. Furthermore, our scheme has the advantage of tighter security reduction by using an optimal security reduction technique.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126857613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qingtang Su, Lin Su, Gang Wang, Leida Li, Jianting Ning
{"title":"A novel colour image watermarking scheme based on Schur decomposition","authors":"Qingtang Su, Lin Su, Gang Wang, Leida Li, Jianting Ning","doi":"10.1504/ijes.2020.10026896","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026896","url":null,"abstract":"A novel colour image watermarking scheme based on Schur decomposition is proposed in this paper. By analysing the 3 × 3 unitary matrix U via Schur decomposition, the strong similarity relation betw...","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129211727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel watermarking algorithm based on characteristics model of local fragmentary images","authors":"Quanzhi Lei, Lijun Xiao, Osama Hosam, Haibo Luo","doi":"10.1504/ijes.2020.105305","DOIUrl":"https://doi.org/10.1504/ijes.2020.105305","url":null,"abstract":"Watermarking is a popular technology to protect the copyright of digital image from illegal infringement. Traditional watermarking algorithms cannot better resist the illegal tampering attacks, causing serious security issues. This paper aims to propose an image watermarking algorithm with ability against illegal tampering attacks. The original image should be firstly pre-processed, and its fragmentary characteristic function of local image block is used to generate watermark locations randomly. When the watermark is illegally tampered and damaged, the generated fragmentary characteristic factor can be used to re-construct the original image. Finally, the forensics of original image is realised. The experimental results show that the proposed algorithm can effectively embed a watermark into image. Besides, the original image can be restored even if the watermark is damaged. It is also robust to the typical attacks and has ability against tampering over a large area of the image.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127906457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A separable reversible data hiding scheme in encrypted image for two cloud servers","authors":"Haidong Zhong, Xianyi Chen","doi":"10.1504/ijes.2020.10026897","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026897","url":null,"abstract":"This paper presents a separable reversible data hiding in encrypted image (SRDH-EI) based on code division multiplexing (CDM). In this, the owner encrypts the cover image first, and then uploads the preprocessed image to two cloud servers. In the servers, two encrypted pixels, on the same place of uploaded images, form an embedded vector. Finally the secret bits, which are encoded to CDM spreading sequences, are embedded into the vector. At the receiver side, there are three cases: 1) if they only have the data hiding key, the secret bits can be extracted; 2) if they only have the encryption key, the original image can be recovered; 3) if they have the two keys, both of them can be obtained. Compared with the classic dual-images RDH method, the proposed method protects the content security of the outsourced cloud image and has a better performance on visual quality and embedding capacity.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114451104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guangli Li, Lei Liu, Tongbo Zhang, Hang Yu, Yue Xu, Shuai Lü
{"title":"Visual field movement detection model based on low-resolution images","authors":"Guangli Li, Lei Liu, Tongbo Zhang, Hang Yu, Yue Xu, Shuai Lü","doi":"10.1504/ijes.2020.10026899","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026899","url":null,"abstract":"In robotic mapping and navigation, simultaneous localisation and mapping (SLAM) is the computational problem of constructing a map of an unknown environment and simultaneously keeping track of an agent's location. The popularity of sweeping robot has made SLAM famous in the last few years, while the recent visual simultaneous localisation and mapping (VSLAM) based on three-dimensional vision makes it more mainstream. To detect direction and distance of visual field movement, we build a visual field movement detection model on low-resolution image. Considering the features of image edge and corners, we mainly utilise the similarity computation of feature points and matching methods in this model to detect the moving direction and distance of vision field. The experimental results show that the proposed detection model is more accurate and efficient in three different conditions, and can precisely figure out where the vision field moves in a short period of time.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114844631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Image fusion based on convolution sparse representation and pulse coupled neural network in non-subsampled contourlet domain","authors":"Linguo Li, Ling Tan, Shujing Li, Qing Ye","doi":"10.1504/ijes.2020.10026907","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026907","url":null,"abstract":"In sparse representation, image data can be described as a linear combination of basis function. The sparse representation of image data is sparsely described in data blocks, disturbing the continuity between the data blocks, causing coding redundancy and blurring of details. Using a convolutional sparse representation, the image can be sparsely coded in its entirety, and the image sparse coding is performed by replacing the product of the coding coefficient and the dictionary matrix by the convolution sum of the characteristic response and the filter dictionary to achieve an optimised representation of the entire image. In view of the above defects, this paper studies a fusion technique based on convolutional sparse representation and NSCT-PCNN (abbreviated as NSCT-CSR-PCNN fusion algorithm) and uses it in the image processing field. The algorithm uses the alternating direction method of multipliers (ADMM) instead of the orthogonal matching pursuit (OMP) algorithm to perform sparse approximation of low frequency sub-band to obtain the characteristic response coefficients and complete the fusion of low frequency sub-band. Experimental results show that the fusion effect of NSCT-CSR-PCNN algorithm is better than other algorithms. The fusion image has good visual effect with clear texture, high discrimination and high contrast.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125893904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An IoT-oriented real-time storage mechanism for massive small files based on Swift","authors":"Dongjie Zhu, Haiwen Du, Yuhua Wang, Xuan Peng","doi":"10.1504/ijes.2020.10026898","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026898","url":null,"abstract":"In the internet of things (IoT), large amounts of small files are generated from various structure sensors in cloud storage platforms. Real-time storage of massive small files will put great pressures to the traditional file system. By studying the real-time storage strategy of massive small files based on the object storage architecture Swift, we proved a unique aggregation storage strategy, called sequential data aggregation strategy (SDAS), for storage of small files. We designed a two-level index structure to improve writing rate by transferring randomly write to sequentially write. To improve overall data access efficiency and solve the performance bottleneck of proxy node, we utilise a file's potential relevance of timing to prefetch related files that are merged in other blocks. Simulation results show that relative to the original system, SDAS has shorter response time of writing operation, lower cost of index maintenance cost, more balanced node load and 30% reduction in disk overhead.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127674848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yang Liu, Lin Meng, Ittetsu Taniguchi, H. Tomiyama
{"title":"A branch-and-bound approach to scheduling of data-parallel tasks on multi-core architectures","authors":"Yang Liu, Lin Meng, Ittetsu Taniguchi, H. Tomiyama","doi":"10.1504/ijes.2020.10026901","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026901","url":null,"abstract":"This paper studies a task scheduling problem which schedules a set of data-parallel tasks on multiple cores. Unlike most of previous literature where each task is assumed to run on a single core, this work allows individual tasks to run on multiple cores in a data-parallel fashion. Since the scheduling problem is NP-hard, a couple of heuristic algorithms which find near-optimal schedules in a short time were proposed so far. In some cases, however, exactly-optimal schedules are desired, for example, in order to evaluate heuristic algorithms. This paper proposes an exact algorithm to find optimal schedules. The proposed algorithm is based on depth-first branch-and-bound search. In our experiments with up to 100 tasks, the proposed algorithm could successfully find optimal schedules for 135 test cases out of 160 within 12 hours. Even in cases where optimal schedules were not found within 12 hours, our algorithm found better schedules than state-of-the-art heuristic algorithms.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123744392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A trust and attribute-based access control framework in internet of things","authors":"Junshe Wang, Han Wang, Hongbin Zhang","doi":"10.1504/ijes.2020.10026900","DOIUrl":"https://doi.org/10.1504/ijes.2020.10026900","url":null,"abstract":"Internet of things (IoT) is widely used in kinds of environment where cloud computing provides super-strong computing support. However, it becomes a key issue that each node can access data under control within the human intention and data is shared securely in distributed IoT environment. Moreover, nodes may belong to different security domains, and data must be accessed only by selected users which could ensure the security of IoT system. Therefore, an effective access control technique is the key point to solve this issue. To address the problems of security, scalability and cross-domain, this paper proposes a fine-grained and dynamic access control model which combines ABAC with trust mechanism and considers dynamic trust attribute and static multi-attribute as synthetic constraints. The simulation results show the feasibility and effectiveness of the proposed scheme, which provides superior characteristics and improves the security of IoT system.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117246063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mengping Yin, Shichong Tan, Ning Zhang, Xiaotong Fu, Suchun Yuan
{"title":"A new approximate image verification mechanism in cloud computing","authors":"Mengping Yin, Shichong Tan, Ning Zhang, Xiaotong Fu, Suchun Yuan","doi":"10.1504/ijes.2019.10025614","DOIUrl":"https://doi.org/10.1504/ijes.2019.10025614","url":null,"abstract":"With the growing prevalence of cloud computing, more and more data especially images and videos are stored in cloud servers. To ensure the security of private data, data owners usually encrypt their private data before outsourcing the data to cloud servers. It is discovered that highly correlated data exist in storage outsourcing and much useful information can be extracted from these correlated data and used for cloud-based services. In the paper, we propose a scheme of encrypted image verification in cloud computing for mobile devices. Many existing schemes focus on verification of query results for outsourced text data or identical images. Different from that, the proposed scheme aims to verify the correctness of query results for similar images. Through the successful query of similar images, power and memory resources of mobile devices can be saved. The security of our scheme is analysed in the random oracle model, and analysis shows that the scheme is secure against adaptive chosen-keyword attack. And what's more, the experimental results demonstrate that our scheme is an efficient one.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130796243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}