GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Zhang, Hua  (5)
  • Computer Science  (5)
  • 1
    Online Resource
    Online Resource
    Understanding and Detecting Real-World Safety Issues in Rust
    Institute of Electrical and Electronics Engineers (IEEE) ; 2024
    In:  IEEE Transactions on Software Engineering Vol. 50, No. 6 ( 2024-6), p. 1306-1324
    Details
    In: IEEE Transactions on Software Engineering, Institute of Electrical and Electronics Engineers (IEEE), Vol. 50, No. 6 ( 2024-6), p. 1306-1324
    Type of Medium: Online Resource
    ISSN: 0098-5589 , 1939-3520 , 2326-3881
    URL: Article
    DOI: 10.1109/TSE.2024.3380393
    RVK:
    SQ 1100
    RVK:
    SA 5600
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2024
    detail.hit.zdb_id: 189642-8
    detail.hit.zdb_id: 2026617-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Secure and Differentiated Fog-Assisted Data Access for Internet of Things
    Oxford University Press (OUP) ; 2022
    In:  The Computer Journal Vol. 65, No. 8 ( 2022-08-11), p. 1948-1963
    Details
    In: The Computer Journal, Oxford University Press (OUP), Vol. 65, No. 8 ( 2022-08-11), p. 1948-1963
    Abstract: The ability of Fog computing to admit and process huge volumes of heterogeneous data is the catalyst for the fast expansion of Internet of things (IoT). The critical challenge is secure and differentiated access to the data, given limited computation capability and trustworthiness in typical IoT devices and Fog servers, respectively. This paper designs and develops a new approach for secure, efficient and differentiated data access. Secret sharing is decoupled to allow the Fog servers to assist the IoT devices with attribute-based encryption of data while preventing the Fog servers from tampering with the data and the access structure. The proposed encryption supports direct revocation and can be decoupled among multiple Fog servers for acceleration. Based on the decisional $q$-parallel bilinear Diffie–Hellman exponent assumption, we propose a new extended $q$-parallel bilinear Diffie–Hellman exponent (E$q$-PBDHE) assumption and prove that the proposed approach provides ‘indistinguishably chosen-plaintext attacks secure’ data access for legitimate data subscribers. As numerically and experimentally verified, the proposed approach is able to reduce the encryption time by 20% at the IoT devices and by 50% at the Fog network using parallel computing as compared to the state of the art .
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    URL: Article
    DOI: 10.1093/comjnl/bxab031
    RVK:
    SQ 1100
    RVK:
    SA 3740
    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 ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    New Blind Filter Protocol: An Improved Privacy-Preserving Scheme for Location-Based Services
    Oxford University Press (OUP) ; 2020
    In:  The Computer Journal Vol. 63, No. 12 ( 2020-12-17), p. 1886-1903
    Details
    In: The Computer Journal, Oxford University Press (OUP), Vol. 63, No. 12 ( 2020-12-17), p. 1886-1903
    Abstract: Location-based services have attracted much attention in both academia and industry. However, protecting user’s privacy while providing accurate service for users remains challenging. In most of the existing research works, a semi-trusted proxy is employed to act on behalf of a user to minimize the computation and communication costs of the user. However, user privacy, e.g. location privacy, cannot be protected against the proxy. In this paper, we design a new blind filter protocol where a user can employ a semi-trusted proxy to determine whether a point of interest is within a circular area centered at the user’s location. During the protocol, neither the proxy nor the location-based service provider can obtain the location of the user and the query results. Moreover, each type of query is controlled by an access tree and only the users whose attributes satisfy this access tree can complete the specific type of query. Security analysis and efficiency experiments validate that the proposed protocol is secure and efficient in terms of the computation and communication overhead.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    URL: Article
    DOI: 10.1093/comjnl/bxaa043
    RVK:
    SQ 1100
    RVK:
    SA 3740
    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 ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    Efficient Attribute-Based Data Sharing Scheme with Hidden Access Structures
    Oxford University Press (OUP) ; 2019
    In:  The Computer Journal Vol. 62, No. 12 ( 2019-12-10), p. 1748-1760
    Details
    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
    URL: Article
    DOI: 10.1093/comjnl/bxz052
    RVK:
    SQ 1100
    RVK:
    SA 3740
    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 ...
    Online Resource
  • 5
    Online Resource
    Online Resource
    Practical Attribute-Based Conjunctive Keyword Search Scheme
    Oxford University Press (OUP) ; 2020
    In:  The Computer Journal Vol. 63, No. 8 ( 2020-08-20), p. 1203-1215
    Details
    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
    URL: Article
    DOI: 10.1093/comjnl/bxz140
    RVK:
    SQ 1100
    RVK:
    SA 3740
    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 ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...