Search

Copyright of Journal of Soochow University Law Edition is the property of Soochow University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Engineering Management / Gongcheng Guanli Xuebao is the property of Journal of Engineering Management Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Sharding is one of the mainstream technologies to solve the scalability of blockchain. Sharding can effectively improve the throughput of blockchain. However, the security of sub-chains is poor due to the uneven distribution of computing power of sub-chains. In order to reduce the risk of sub-chains' collusion attack caused by network sharding, this paper pro-posed an anti-collusion attack network sharding algorithm for blockchain ( AANS). The algorithm comprehensively considered the behavior characteristics and the computing power of nodes, polled the malicious nodes among sub-chains, and evenly distributed the computing power of blockchain to sub-chains in order to avoid collusion attack caused by the aggregation of malicious nodes. Simulation experiments verify the effectiveness of the proposed AANS algorithm in term of malicious nodes number, sub-chains ' collusion computing power, percentage of sub-chains' collusion attack and percentage of dangerous sub-chains. Simulation results show that AANS algorithm can effectively avoid the aggregation of malicious nodes in sub-chains, reduce the risk of collusion attack in sub-chains, and ensure the security of sub-chains in blockchain. [ABSTRACT FROM AUTHOR]

Copyright of Journal Of Sichuan University (Natural Sciences Division) / Sichuan Daxue Xuebao-Ziran Kexueban is the property of Editorial Department of Journal of Sichuan University Natural Science Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to reveal the regular pattern of dynamic changesin collusive inter-subject relationship in bidding of associated projects, the social network theory was used to study the structure and characteristics of the collusion relationship network of project bidding. The dynamic change tendency of associated project bidding collusive relationship was explored from the overall network in different periods and the trends of nodes. The dynamic change process of its collusion relationship network was evolved by using the Stochastic Actor-oriented Model. The key elements affecting the development of collusion relationship network were identified. Research showed that as the number of associated engineering collusion subjects increases, the collusion relationship network of project bidding became sparser, the central degree of core nodes diminished, and the control ability of the network was relatively reduced. Moreover, transmissibility triad and reciprocity played a significant role in promoting the development tendency of the collusion network. [ABSTRACT FROM AUTHOR]

Chinese audio podcast is the product of information development in the 21st century Internet era.This paper takes Chinese audio podcast narrative as the research object, and regards it as the tribalized expression of emotion in the Internet era. In the form of emotion tribe, audio podcast constructs the voice narrative text of“collusion”between narrator and narratee, so that the audience can fully experience the resonance of emotion. At the same time, as a typical form of acoustic narrative, audio podcast narrative arouses the original narrative flavor of oral narration and awakens the auditory constitution under the hegemo⁃ ny of visual culture. It creates soundscape and miniature sound wall for the subject, stimulates long-term auditory viscosity, and thus maintains the emotional tribe of sound podcast. With its unique form of acoustic narrative, audio podcast has grasped the emotional pulse of the age and has become the spiritual hometown of urban wanderers. [ABSTRACT FROM AUTHOR]

Aiming at the problems of key abuse and digital certificate management in the current lattice-based proxy re-en-cryption scheme, this paper proposed a new identity-based accountable proxy re-encryption scheme by introducing the account-ability algorithm. This scheme used the user ID to calculate matrix as the public key and used the pre-image sampling algo-rithm to extract the private key, which solved the problem of digital certificate management. It used the public keys of both us-ers to calculate and generate the re-encryption key, which improved the computational efficiency of encryption and decryption. It used the proxy's public and private keys to participate in the re-encryption calculation, completed the accountability algo-rithm, and inhibited the collusion of the proxy and the delegate. The security analysis shows that the scheme satisfies the cho-sen-plaintext attack security. In terms of efficiency, the scheme has less computational complexity and ciphertext overhead. [ABSTRACT FROM AUTHOR]

Copyright of Fly Ash Comprehensive Utilization is the property of Hebei Fly Ash Comprehensive Utilization Magazine Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper proposed a video watermark combining synchronous motion compensation and sp read spectrum steganography to solve the copyright problem caused by the inability of video watermarking to resist collusion between frames. Firstly, it constructed the hybrid resistance strategy and judgment requirements for two types of collusion scenarios based on collusion model,attack principles and noise sources. Secondly, it utilized synchronous motion compensation algorithms and spread spectrum steganography to deal with the two types of collusion attacks. Finally, the test verified that the hybrid resistance strategy could satisfy the j udgment requirements of the anti-collusion attack to ensure that the conspirators could not use data redundancy to obtain effective collusion rules and carry out attacks . The results show that from the perspective of algorithm timeliness and motion consistency, A VC is more suitable for the first type of collusion scene than the contrast method SPMC and VBMC. In the second type of collusion scene, frame average and frame cut's first and last frame PSNR average reduction is 20. 91 %, frame reconstruction and frame cropping' s PSNR average amplitude between extremes is 2. 76%, significantly better than the average reduction of 41. 76% and 28. 54%, the average amplitude 13 . 91 % and 7 . 72% of the comparison methods . In summary, the proposed method satisfies the evaluation requirements of collusion attacks and has the effect of resisting collusion attacks between frames. [ABSTRACT FROM AUTHOR]

In the real world, many problems have the need to conduct relevant operations at a specific time. Timed-release encryption (TRE) is a cryptographic primitive in which the sender specifies the decryption time of the receiver, which can meet the above requirement. To address the problem that the current TRE schemes based on the periodic broadcast time trapdoor of the non-interactive time server cannot meet the user's arbitrary specified decryption time, and the interactive time server mode meets the arbitrary decryption time but cannot guarantee the user's identity privacy, a TRE scheme using onion routing network was proposed. In the scheme, when the decryption time approaches, the time trapdoor request was taken as the innermost onion, and the layer by layer encrypted onion was constructed and transmitted to the time server. The time server generates the corresponding time trapdoor and returns it to the receiver according to the original route, so that the user can hide the identity information when making a trapdoor query at any time. Meanwhile, for the node failure problem in the process of onion routing delivery, a method for constructing each layer of onion based on broadcast encryption was proposed, so that each layer of onion node can decrypt that layer of onion. The scheme achieves the trapdoor of successfully querying arbitrary time to the time server while ensuring the anonymity of user's identity. Security analysis showed that the scheme is secure and robust against possible single-point speculation, monitoring attacks, replay attacks, and collusion attacks. Efficiency analysis showed that compared with the pairing-based onion routing scheme, the proposed scheme reduces the time consumption of solving the node failure problem by about 59%, thus realizing efficient anonymous query. [ABSTRACT FROM AUTHOR]

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the application of industrial Internet, due to the differences in computing and storage capabilities of heterogeneous nodes, cloud solutions are generally used to provide data storage and data access services. Access control in cloud storage, such as an extended data access control scheme for multi-authority cloud storage (NEDAC-MACS), is the cornerstone to ensure the security and privacy of data in cloud storage. This paper gave an attack method to demonstrate that a revoked user could still decrypt new ciphertexts in NEDAC-MACS and proposed a scheme to enhance the security of NEDAC-MACS, which could resist the collusion attack between cloud server and users. Finally, formal cryptanalysis and performance analysis show that the scheme can resist collusion attacks between unauthorized users and between cloud servers and users, and ensure forward security, backward security and data confidentiality. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Changzhou University (Social Science Edition) is the property of Editorial Department of Journal of Changzhou University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

A controller is proposed for multi-missile formation guaranteeing the precision of the control and the collision avoidance among missiles. Based on the leader-follower framework, the relative motion model and the control model with cascaded form are established. The controller is designed on the basis of the prescribed performance control theory. By giving the prescribed function properly, both transient and steady-state performance of the tracking error could be maintained in the prescribed bounds, which means the relative position of the follower could be preserved within a predefined range. To avoid collusions during the forming and reconfiguring of the formation, a collision avoidance scheme is designed by adjusting the expected formation position in real time in accordance with the relative position range. The results of simulation show that the missiles can form an expected formation with the proposed controller, and the feasibility of the proposed collision avoidance scheme is verified as well. [ABSTRACT FROM AUTHOR]

In order to solve the problem of passive node voting and collusion between malicious nodes, this paper proposed an improved DPOS consensus mechanism. Firstly, it introduced the unstructured network trust model. According to the history of each node and the recommendation value of other node, it calculated the comprehensive trust. According to the comprehensive trust value, it made the selected node more reliable. By introducing the recommendation algorithm, it dispersed the interests of nodes and reduced the degree of centralization. Secondly, it added a reward and punishment mechanism to reward the credit value of the nodes that voted actively, so that they had a chance to become consensus nodes, and also to punish the credit value for the malicious node. The experimental results show that the DPOS consensus mechanism based on the comprehensive trust value voting calculation can quickly eliminate the error nodes, maintain the stability of the system, and have high security [ABSTRACT FROM AUTHOR]

Copyright of Journal of Changzhou University (Social Science Edition) is the property of Editorial Department of Journal of Changzhou University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Changzhou University (Social Science Edition) is the property of Editorial Department of Journal of Changzhou University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Transactions of Beijing Institute of Technology is the property of Beijing University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Collusion bidding is a chronic problem in the field of tendering and bidding, it seriously jeopardizes the order of market competition and causes bad social influence. According to the mechanism design theory, the establishment of a game model that can express the core strategies of the main participants is the premise of the mechanism design after clarifying the objectives of social governance. Generally speaking, in the tendering and bidding activities, the tenderer occupies a dominant position. The prisoner’s dilemma model commonly used by domestic scholars can only study the cooperation and confrontation between bidders, and cannot reflect the game between the tenderer and the bidder. This paper proposes that intensive paradox is an effective game model to reveal the operating mechanism of collusion bidding. Based on this model, it can be seen that heavy penalties for violating bidders can only reduce the bidder’s probability of collusive bids in the short term , while heavier penalties for dereliction bidders can continue to effectively reduce the bidder’s probability of colluding bids. [ABSTRACT FROM AUTHOR]

This paper proposed a (t,n) threshold quantum secret sharing scheme by means of d-dimensional entanglement swapping. The proposed scheme executed t times of d-dimensional entanglement swapping, which aggregated secret shadows into F, particle of the reconstructor. Finally, the reconstructor measured this particle to reconstruct the original secret. Security analysis shows that the proposed scheme can resist intercept-resend. entangle-measure. collusion and forgery attacks. By comparison with other similar schemes in performance, the proposed scheme is more flexible, practical and universal. In addition, its total overheads of computation and measurement are lowest in current similar quantum secret sharing schemes. [ABSTRACT FROM AUTHOR]

At present the major secure sum protocol has high communication complexity. Based on the public key encryption technology and random algorithm, this paper proposed a new secure sum protocol in the semi-honest model, which improved safety and reduced communication complexity, and it proved the correctness and security. Compared with other protocols, this protocol has more advantages. [ABSTRACT FROM AUTHOR]

This paper attempts to develop a real options-based approach to investigate the important implication of authoritarian mechanisms for economic development under uncertain environments, from the respective perspectives of central and local governments. By defining the concepts of transferrable costs and authoritarian rents, our model can shed new light on why authoritarian mechanisms can accelerate the economic growth, and provide new insights on the incentive problem of "collusion" or side contracts between local governments and enterprises. In order to maximize the social welfare, from the perspective of the central government we also allow for the optimal design of contract mechanisms between central and local governments. Our model results show that when the negative social costs caused by transferred costs are relatively little and if the "collusion" or side contracts between local governments and enterprises are allowed, authoritarian mechanisms can play important roles in accelerating economic growth and making macroeconomic policies should therefore take full account of the significant effect. Furthermore, our paper also provides constructive proposals concerning the future economic development in mainland China and facilitate improving the scientific conception of economic development in this country. [ABSTRACT FROM AUTHOR]

This paper proposed a novel cognitive radio spectrum sharing scheme, which based on the tradition auction model and group buying auction. Collusion competition model was developed and realized by introducing collusion relationship to competition of secondary users and adopting the group buying auction theory. The mechanism dealt with the relationship between the primary user and the secondary users or the secondary users themselves in cognitive radio networks. It achieved the fast solution of spectrum's optimal price by artificial bee colony optimization algorithm. Simulation results show that the mechanism is able to improve the spectrum auction revenue of primary user while the secondary users can get the opportunities to access the idle spectrum. As a result, the mechanism enhances the efficiency of spectrum utilization in system as well as the fairness of secondary users access the spectrum, and it has a favorable application prospect. [ABSTRACT FROM AUTHOR]

Using the mechanism design theory, this paper designs collusion-proof group lending contracts with asymmetric information, and studies the effect of the government subsidies of MFIs and rural house-holds on collusion-proof group lending contracts. The results show that collusion-proof group contracts which are designed by MFIs can avoid adverse selection and moral hazard, and farmers of high-efficiency teams could obtain some information rents but this contract would extract all rents to maintain farmers of other teams at their zero status quo utility level. If the villages' composition and project revenue make MFIs' maximum expected payoff below zero, government should provide fiscal subsidy to MFIs for stimulating them to provide group contracts to those villages, and the subsidy must make MFIs' maximum expected payoff to be no less than zero. Also government should provide fiscal subsidy to rural house-holds for avoiding them to choose strategic default, while the subsidy should equal to the value that rural households' repayment minus their profit. [ABSTRACT FROM AUTHOR]

Collusion almost exists in the all general organizations and institutions, which can cause distorted incentives and inefficiency. Collusion also exists in a three-tier venture capital company-supervisor-venture entrepreneur model. Therefore, it is necessary to look for a collusion-proof contract according to the process of games among them. On the basis of solving the collusion-proof planning problem, we can conclude that collusion can be prevented and controlled efficiently by improving the investigative technique of collusion, and increasing the punishment after collusion has been found and the difficulty of transaction between supervisor and venture entrepreneur. [ABSTRACT FROM AUTHOR]