Loading...

Table of Content

      
    20 March 2020
    Volume 55 Issue 3
    Reversible data hiding in homomorphic encrypted domain based on Paillier
    Min-qing ZHANG,Neng ZHOU,Meng-meng LIU,Han WANG,Yan KE
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  1-8,18.  doi:10.6040/j.issn.1671-9352.2.2019.021
    Abstract ( 281 )   HTML ( 123 )   PDF (5044KB) ( 247 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Based on the homomorphism and probability characteristics of Paillier cryptosystem, a reversible data hiding in homomorphic encrypted domain based on Paillier is proposed. First, the original image is divided into blocks. The pixel groups randomly selected by the image owner have one reference pixel and eight target pixels. Least significant bits (LSBs) of reference pixel and all bits of target pixel are self-embedded into other parts of the image by a method of RDH. In order to avoid overflow when embedding data, LSBs of the reference pixel are reset to zero before encryption. The encrypted reference pixel replaces the target pixels surrounding it, thereby constructing mirror central ciphertext. In a set of mirroring central ciphertext, the data hider embeds data in the LSBs of the target pixels by homomorphic addition, while the reference pixel remains unchanged. The receiver can directly extract the extra information by modular multiplication inverse between the target pixels and the corresponding reference pixel or directly extract the secret information by plaintext subtraction and can restore the original image without loss. The experimental results show that the average embedding rate of the algorithm is 0.18 bpp (bit per pixel) under the premise of ensuring the quality of the directly decrypted image.

    Social network information recommendation method of supporting privacy protection
    Chao ZHANG,Ying LIANG,Hao-shan FANG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  9-18.  doi:10.6040/j.issn.1671-9352.2.2019.171
    Abstract ( 220 )   HTML ( 9 )   PDF (1486KB) ( 131 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of privacy disclosure caused by information dissemination in social network information recommendation, a kind of social network information recommendation method that supports privacy protection is proposed in combination with information dissemination model. Users′ interests are predicted by friends′ interest, familiarity and interest similarity, and then text matching and recommendation candidate set sorting are carried out. Through personalized privacy preference setting, users are allowed to set restricted access to user list, and privacy protection method is used to calculate the probability of information spreading to blacklist users, and privacy disclosure threshold is set to control the probability of blacklist users accessing privacy blog posts to protect user privacy in information recommendation. Experimental results show that the proposed method can guarantee the recommendation effect and protect user privacy better.

     
    Hierarchical trusted cryptography service framework based on distributed message drive
    Ying LI,Jun HU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  19-27.  doi:10.6040/j.issn.1671-9352.2.2019.205
    Abstract ( 152 )   HTML ( 7 )   PDF (1015KB) ( 22 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Trusted computing provides a new way to solve system security problems. The trusted cryptography function access methods defined in the current domestic and international standards are generally API interface methods, such as trusted software stack (TSS) in TCG standard and TCM service module (TSM) in Chinese national standards. These interfaces are very complicated. And there are compatibility issues between each other, affecting the development and promotion of trusted computing. In order to solve these problems, a message-driven hierarchical trusted cryptography service framework is proposed, which can shield complex trusted root access details through module encapsulation, simplify interfaces, solve compatibility problems, and implement distributed and collaborative trusted root access in a message-driven ways. Finally, two examples are given to illustrate the feasibility of the framework, the generality of the modules in the framework, and the effect of the framework in simplifying the implementation of the trusted cryptography mechanism.

    A scheme for cloud server positioning and security verification
    YANG Chen, ZHENG Ming-hui, TAN Jie
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  28-34.  doi:10.6040/j.issn.1671-9352.2.2019.035
    Abstract ( 222 )   PDF (783KB) ( 51 )   Save
    References | Related Articles | Metrics
    Component system security based on non-interference
    XU Ming-di, JIN Zhao-yang, CUI Feng, ZHANG Fan
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  35-42.  doi:10.6040/j.issn.1671-9352.2.2019.124
    Abstract ( 138 )   PDF (605KB) ( 33 )   Save
    References | Related Articles | Metrics
    Information flow non-interference problem of mutil-level security in components system is studied. The behavior of components with security process algebra(SPA)language is captured to construct interface automata computational model based on the existing interface structure. Some bisimular non-interference properties are analyzed to construct SIA_NI which applies for interface model and is proved security under complex operations such as adding, deleting and combining operators. Finally, an instance is cited to handle this non-interference properties in component-based system and CoPS software is used to automatically verify the correctness of the algorithm on mutil-level security component system.
    A blockchain consensus mechanism based on voting rights competition
    Yu-bo SONG,Shi-qi ZHANG,Rui SONG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  43-50.  doi:10.6040/j.issn.1671-9352.2.2019.142
    Abstract ( 264 )   HTML ( 10 )   PDF (2532KB) ( 95 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Under the consensus mechanism in the blockchain system, all participants agreed on the issue of block ownership and the value of the transaction. Based on the new architecture design of the forging committee and the forging group system, a competition-based equity certification (CPoS) consensus mechanism is proposed, which can quickly remove the fork under the premise of ensuring decentralization. Through prototype experiments, the block and trading activities can be completed quickly with a small delay.

    Clustering method for multi-label symbolic value partition
    Liu-ying WEN,Wei YUAN
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  58-69.  doi:10.6040/j.issn.1671-9352.1.2019.154
    Abstract ( 209 )   HTML ( 5 )   PDF (1028KB) ( 46 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A clustering method for multi-label symbolic value partition (CMSVP) is proposed. First, the label ranking and K-means algorithms are employed to cluster the original label information. Then, an undirected weighted graph is constructed for each attribute. Each node represents an attribute value, and the weight of each edge represents the similarity between the nodes. Finally, random walks are performed on all undirected weighted graphs to obtain a clustering scheme of attribute values. The experiment is conducted on six multi-label data sets. The results show that the CMSVP algorithm can improve the classification performance of data while effectively compressing the data.

    Three-way interval-set concept lattice
    LIU Ying-ying, MI Ju-sheng, LIANG Mei-she, LI Lei-jun
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  70-80.  doi:10.6040/j.issn.1671-9352.4.2019.068
    Abstract ( 190 )   PDF (934KB) ( 165 )   Save
    References | Related Articles | Metrics
    This paper respectively proposes a three-way interval-set concept lattice model in complete and incomplete formal context, and systematically analyses the connections between the object-induced three-way interval-set concept lattice and the interval-set concept lattice. In addition, the necessary and sufficient conditions for constructing the object-induced three-way interval-set concept on the basis of the interval-set concept are proved, and the corresponding algorithm is formulated. Finally, the relationships between the object-induced three-way interval-set concept and the interval-set concept are studied. The necessary and sufficient conditions for constructing the object-induced three-way interval-set concept on the basis of the classical concept are proved.
    A multi-label three-way classification algorithm based on label correlation
    Ying YU,Xin-nian WU,Le-wei WANG,Ying-long ZHANG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  81-88.  doi:10.6040/j.issn.1671-9352.1.2019.162
    Abstract ( 196 )   HTML ( 6 )   PDF (1955KB) ( 27 )   Save
    Figures and Tables | References | Related Articles | Metrics

    This paper uses the probability map model to the tag relationship is encoded, and three-way three decision models are used to solve the uncertainty of the data samples. A multi-label classification algorithm based on three-way decision-correlation correlation is proposed. The algorithm will solve the two-way decision problem in multi-label classification(TML_LC). The SVM mapping is divided into accepted domain, rejected domain and uncertain domain. The probability map model is used to consider the correlation between labels to transform the uncertainty of the uncertain domain, so as to improve the accuracy of the classification model.

    Research on local double relative quantitative decision-theoretic rough set for incomplete ordered information system
    LIN Yan-li, LIU Xiao-dong
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  89-97.  doi:10.6040/j.issn.1671-9352.1.2019.187
    Abstract ( 167 )   PDF (436KB) ( 62 )   Save
    References | Related Articles | Metrics
    This study focuses on the incomplete order information system based on the double relative quantitative rough set and the local decision-theoretic rough set. Two kinds of local double relative quantitative decision-theoretic rough set(LDrq-DTRS)models are established, and their inclusion relationships in terms of positive, negative and boundary regions are discussed. In addition, the inner relationship between LDrq-DTRS and local rough set is also examined. Finally, the related properties are verified by employing a numerical experiments under different parameters.
    Interval-set rough approximations based on a relation matrix
    CHANG Fan-fan, MA Jian-min
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  98-106.  doi:10.6040/j.issn.1671-9352.4.2019.142
    Abstract ( 173 )   PDF (517KB) ( 25 )   Save
    References | Related Articles | Metrics
    Based on the intuition of a matrix and the simplicity of the matrix operations, this paper introduces the interval vector, which gives a new representation of an interval set, and the related properties of them are investigated. The operations between the interval vector and the relation matrix are discussed. On the basis of relation matrices, the equivalent representations of the rough lower and upper approximations are depicted for the classical rough sets. By using the operations between the relation matrix and interval vectors, the interval-set rough lower and upper approximations are shown in the view of relation matrices. An approach and the related algorithm to obtain the interval-set rough lower and upper approximations according to a relation matrix are also given. An example is used to show the simplicity and effectiveness of the algorithm.
    Gaussian kernel fuzzy C-means clustering driven by piecewise quadratic transfer function
    TANG Yi-ming, ZHANG Zheng, LU Qi-ming
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  107-112.  doi:10.6040/j.issn.1671-9352.4.2019.192
    Abstract ( 182 )   PDF (856KB) ( 36 )   Save
    References | Related Articles | Metrics
    As for the fuzzy C-Means algorithm based on transformed data, whose conversion mode is single while the effect of non-distribution is not obvious. For these reasons, the Gaussian kernel fuzzy C-means algorithm driven by piecewise quadratic transfer function is proposed. Firstly, the strategy of transforming the original piecewise linear data is extended by the piecewise quadratic conversion function, which makes the data conversion mode more delicate, so that the same type of data is better gathered together, and different types of data keep away. Secondly, we introduce a Gaussian kernel function to map data from low-dimensional space to high-dimensional space for clustering. Finally, the piecewise quadratic conversion function and Gaussian kernel function are integrated into the framework of fuzzy clustering to form the proposed algorithm. The comparison experiments show that the proposed algorithm is significantly better than the related four algorithms.
    Existence of optimal positive solutions for Neumann boundary value problems of second order differential equations
    WANG Jing-jing, LU Yan-qiong
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  113-120.  doi:10.6040/j.issn.1671-9352.0.2019.208
    Abstract ( 213 )   PDF (393KB) ( 132 )   Save
    References | Related Articles | Metrics
    By using the fixed point exponential theory of cone mapping, we show the optimal conditions for the existence of positive solutions for second-order continuous Neumann boundary value problems {u″(t)+a(t)u(t)=g(t)f(u(t)), t∈[0,T],u'(0)=u'(T)=0with nonnegative Greens function, where fC(R+,R+), a(·)∈C([0,T],(0,+SymboleB@))satisfying the corresponding homogeneous linear problems have only trivial solutions, gC((0,T),R+), and g(t) is allowed to be singular at t=0 and t=T, R+:=[0,SymboleB@).
    Effect of fear factor on a predator-prey model with defense mechanish
    WANG Jing, FU Sheng-mao
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2020, 55(3):  121-126.  doi:10.6040/j.issn.1671-9352.0.2019.670
    Abstract ( 191 )   PDF (4056KB) ( 140 )   Save
    References | Related Articles | Metrics
    A predator-prey model with fear factor and prey defense mechanism is studied. The conditions for the local asymptotic stability of positive equilibrium and the conditions for existence of Hopf bifurcation are obtained, and the effect of fear factor on population density is discussed. Finally, numerical simulation is carried out. As a result, it is shown that the increase of fear degree will lead to the decrease of predator population density, but has no direct effect on the density of prey population.