GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Computer Science  (11)
  • SA 3740  (11)
Material
Language
Years
Subjects(RVK)
RVK
  • 1
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2019
    In:  The Computer Journal Vol. 62, No. 12 ( 2019-12-10), p. 1748-1760
    In: The Computer Journal, Oxford University Press (OUP), Vol. 62, No. 12 ( 2019-12-10), p. 1748-1760
    Abstract: Online data sharing has become a research hotspot while cloud computing is getting more and more popular. As a promising encryption technique to guarantee the security shared data and to realize flexible fine-grained access control, ciphertext-policy attribute-based encryption (CP-ABE) has drawn wide attentions. However, there is a drawback preventing CP-ABE from being applied to cloud applications. In CP-ABE, the access structure is included in the ciphertext, and it may disclose user’s privacy. In this paper, we find a more efficient method to connect ABE with inner product encryption and adopt several techniques to ensure the expressiveness of access structure, the efficiency and security of our scheme. We are the first to present a secure, efficient fine-grained access control scheme with hidden access structure, the access structure can be expressed as AND-gates on multi-valued attributes with wildcard. We conceal the entire attribute instead of only its values in the access structure. Besides, our scheme has obvious advantages in efficiency compared with related schemes. Our scheme can make data sharing secure and efficient, which can be verified from the analysis of security and performance.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2019
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2020
    In:  The Computer Journal Vol. 63, No. 8 ( 2020-08-20), p. 1203-1215
    In: The Computer Journal, Oxford University Press (OUP), Vol. 63, No. 8 ( 2020-08-20), p. 1203-1215
    Abstract: To date cloud computing may provide considerable storage and computational power for cloud-based applications to support cryptographic operations. Due to this benefit, attribute-based keyword search (ABKS) is able to be implemented in cloud context in order to protect the search privacy of data owner/user. ABKS is a cryptographic primitive that can provide secure search services for users but also realize fine-grained access control over data. However, there have been two potential problems that prevent the scalability of ABKS applications. First of all, most of the existing ABKS schemes suffer from the outside keyword guessing attack (KGA). Second, match privacy should be considered while supporting multi-keyword search. In this paper, we design an efficient method to combine the keyword search process in ABKS with inner product encryption and deploy several proposed techniques to ensure the flexibility of retrieval mode, the security and efficiency of our scheme. We later put forward an attribute-based conjunctive keyword search scheme against outside KGA to solve the aforementioned problems. We provide security notions for two types of adversaries and our construction is proved secure against chosen keyword attack and outside KGA. Finally, all-side simulation with real-world data set is implemented for the proposed scheme, and the results of the simulation show that our scheme achieves stronger security without yielding significant cost of storage and computation.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2020
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 4 ( 2022-04-19), p. 858-873
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 4 ( 2022-04-19), p. 858-873
    Abstract: Finding groups in networks is very common in many practical applications, and most work mainly focus on dense groups. However, in scenarios like reviewer selection or weak social friends recommendation, we need to emphasize the privacy of individuals or minimize the possibility of information dissemination. So the internal relationship between individuals should be as tenuous as possible, but existing works cannot suit well to the requirement. Some works have focused on finding tenuous groups. However, these works only aim to find the most tenuous group and do not consider containing certain vertices. In this paper, we study the problem of finding tenuous groups in attributed networks that contain specific vertices. We first propose a new problem called Tenuous Attributed Group Query, and a new indicator, k-tenuity, to measure the structural tenuity of a group. Then we propose a method TAG-Basic to find proper groups by gradually selecting the vertices with optimal influence. We further design an advanced method TAG-ADV to improve the efficiency by forming a candidate set before selecting the optimal vertex. Experiment results show that k-tenuity is more effective than other state-of-the-art measurements, and our methods obtain the best result on group quality compared with other benchmark methods.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    In: The Computer Journal, Oxford University Press (OUP), ( 2023-03-02)
    Abstract: Nowadays, ransomware evolved rapidly and the prevention of ransomware has become an important issue. The threat of ransomware is much more sophisticated than before for governments and enterprises; breaches or corruption of sensitive data will cause huge impact on the organization. Early detection is one of the effective method to prevent the ransomware attack. Modern ransomware detection technologies can be divided into two categories: static analysis and dynamic analysis. Dynamic analysis observes the behavior of the running program. Previous research adopted machine learning approach for dynamic analysis and API sequence dataset were used to trained machine learning models for dynamic analysis. In this research, we collected the API calls of the ransomware from reports generated by Cuckoo Sandbox and proposed two detecting models using BERT and LSTM. The result shows that both BERT and LSTM models can successfully predict ransomware with 95% high accuracy. We aimed to compare the performance of two text-based learning model, LSTM and BERT, and analyze the pros and cons. The result shows that API sequence data can be used to train effective ransomware detection models in text-based manner.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal Vol. 66, No. 5 ( 2023-05-19), p. 1213-1227
    In: The Computer Journal, Oxford University Press (OUP), Vol. 66, No. 5 ( 2023-05-19), p. 1213-1227
    Abstract: Traffic encrypted technology enables Internet users to protect their data secrecy, but it also brings a challenge to malicious package detection. To tackle this issue, researchers have investigated into encrypted traffic analysis (ETA) in recent years. Existing works, however, only focus on the accuracy of malicious flow identification. Using ETA as a technical black box, they pay little attention to the internal details and explanation of models. In this paper, we, for the first time, introduce interpretable machine learning into ETA. We aim to provide a reasonable explanation for detection results, so as to enable one to understand and further trust network security analysts. We develop a complete analysis framework, named DEV-ETA (detection, explanation and verification of ETA). DEV-ETA applies post hoc interpretation methods to explain the detection results and verify the explanation using the joint distribution of support features on the dataset. We run thorough experiments to explain the detection result using three popular explanation approaches, namely SHAP, LIME and MSS, and we verify the explanation via the feature distribution plot. The experimental results show that our design can interpret the detection result of ETA model instead of just simply treating the model as a black box.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal Vol. 66, No. 5 ( 2023-05-19), p. 1295-1309
    In: The Computer Journal, Oxford University Press (OUP), Vol. 66, No. 5 ( 2023-05-19), p. 1295-1309
    Abstract: A web shell is a backdoor used by hackers to control Web servers and perform privilege escalation, and thus it is crucial to detect web shells effectively. However, the detection of obfuscated web shells has always been a challenge. Inspired by adversarial training methods in the field of computer vision, this paper proposes a generative adversarial network (GAN)-based web shell detection model training framework. Since there has been no method that can generate obfuscated web shells effectively, a generator based on the genetic algorithm, which combines and optimizes the pre-set obfuscation methods, is used to obtain new obfuscation combinations and generate obfuscated samples. The whole proposed framework is named the CWSOGG. When training the detection model, the generator generates web shells that can bypass the discriminator, and the discriminator catches the features of obfuscated samples. Through the adversarial training of the discriminator and generator, the detection model improves its ability to detect obfuscated web shells. To verify the proposed framework is flexible to different models, the discriminator based on four main neural networks has been implemented. Meanwhile, to build complete feature extraction models, both statistical and semantic features are extracted. Due to the lack of web shell data, a clean dataset containing 4,375 web shells is constructed and used to evaluate the CWSOGG. The results have shown that the detection accuracy of each model increases by 86.71% on the generated obfuscated web shells on average and by 7.50% on the simulated real-world obfuscated web shells on average.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal ( 2023-06-27)
    In: The Computer Journal, Oxford University Press (OUP), ( 2023-06-27)
    Abstract: Vision Transformers for pre-trained models explore semantic context and spatial relationships for images, which heavily depend on how you select image patches. In this paper, we propose a novel Spatial-aware Multi-directional Patches Multi-cycle Autoencoder (SMPMA) for a pre-trained model that brings the following benefits: (1) Spatial-aware Multi-directional (SM) patches are created with multi-directional spatial locations, transforming a whole image autoencoder problem into a short-span image patches autoencoder problem; (2) SM patches admit a self-cycle autoencoder alignment learning for the first stage and a cross-cycle interaction learning for the second stage, which makes patches align and interact for optimization; (3) SM patches enable to explore local object features and correlation distribution of adjacent pixels by taking arbitrary sampled patches as inputs. Experimental results on four downstream tasks show that our model can achieve state-of-the-art performance over the tasks of image generation, image classification and semantic segmentation.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2017
    In:  The Computer Journal Vol. 60, No. 12 ( 2017-12-01), p. 1852-1870
    In: The Computer Journal, Oxford University Press (OUP), Vol. 60, No. 12 ( 2017-12-01), p. 1852-1870
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2017
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    In: The Computer Journal, Oxford University Press (OUP), ( 2022-07-02)
    Abstract: Internet of Things (IoT) jobs not only require computational resources but also are delay-sensitive and security-sensitive. Edge computing emerges as a promising paradigm to improve the quality of experience for IoT users. Edge computing faces many security threats, perhaps even more than traditional data centers. With a growing amount of data offloaded to Edge Data Centers (EDCs), the EDC performance needs to be considered and evaluated carefully for improving the vulnerable EDC resource utilization while satisfying IoT job requirements. This paper develops an analytical model, which can capture the dynamics of an EDC system with the following features: (i) The system is under heterogeneous workloads; (ii) the system is subject to attacks, which prevent equipment units in the system from providing service and (iii) the jobs in the system are delay-sensitive. Namely, the job processing fails before the processing is completed. Based on the proposed model, we develop formulas for performance and profit metrics and conduct a series of simulation experiments to verify the correctness and accuracy of our model. Finally, through our model, we evaluate the performance of the EDC, and we offer solutions for EDC administrators to maximize profit.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2022
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2016
    In:  The Computer Journal Vol. 59, No. 4 ( 2016-04), p. 559-569
    In: The Computer Journal, Oxford University Press (OUP), Vol. 59, No. 4 ( 2016-04), p. 559-569
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2016
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...