In this paper, we investigate the group consensus for leaderless multi-agent systems. The group consensus protocol based on the position information from neighboring agents is designed. The network may be subjected to...In this paper, we investigate the group consensus for leaderless multi-agent systems. The group consensus protocol based on the position information from neighboring agents is designed. The network may be subjected to frequent cyberattacks, which is close to an actual case. The cyber-attacks are assumed to be recoverable. By utilizing algebraic graph theory, linear matrix inequality(LMI) and Lyapunov stability theory, the multi-agent systems can achieve group consensus under the proposed control protocol. The sufficient conditions of the group consensus for the multi-agent networks subjected to cyber-attacks are given. Furthermore, the results are extended to the consensus issue of multiple subgroups with cyber-attacks. Numerical simulations are performed to demonstrate the effectiveness of the theoretical results.展开更多
A novel broadcast encryption scheme for group communication scenarios in distributed networks is presented. In the scheme, anyone is allowed to encrypt a message and distribute it to a designated group. Each member in...A novel broadcast encryption scheme for group communication scenarios in distributed networks is presented. In the scheme, anyone is allowed to encrypt a message and distribute it to a designated group. Each member in the designated group has the ability to independently decrypt a ciphertext. In contrast to traditional broadcast encryption, all the valid receivers in the proposed scheme compose the designated group. To take advantage of this property, a tab for the group is set and the matching private key for each member is generated. In addition, before decrypting a ciphertext, anyone in the scheme can verify the ciphertext, to ensure that the ciphertext is correct. This property is very important for large-scale group communication, as the gateway can filter incorrect ciphertext and alleviate the receiver＇s workload. Finally, a proof in the random oracle model is given, to show that the proposed scheme is secure against the adaptively chosen ciphertext attack.展开更多
Prior group-based fingerprinting achieves better detection performance when colluders are from the same group. But in digital wholesale and needs to be identified retail, the middleman as well as customers especially ...Prior group-based fingerprinting achieves better detection performance when colluders are from the same group. But in digital wholesale and needs to be identified retail, the middleman as well as customers especially against group colluding attack. The group tracing is neglected in previous works. In this paper, we propose a novel multimedia group fingerprint to trace malicious middlemen along with customers. We explore the quality of the non degenerate linear shift register sequence （NDLSRS） which is convenient in group initialization and management. The theoretic analysis and simulation experiment results show that NDLSRS has good resistance against attacks from colluding groups/ members even after its volume expanded.展开更多
A radio frequency identification (RFID) yoking proof scheme can generate proofs of simultaneous presence of two tags in the range of a specified reader so that an off-line verifier can verify the proofs later. This pr...A radio frequency identification (RFID) yoking proof scheme can generate proofs of simultaneous presence of two tags in the range of a specified reader so that an off-line verifier can verify the proofs later. This proof has found several interesting applications. However, many existing RFID yoking schemes are vulnerable to replay attacks. To overcome the weaknesses, Cho et al. proposed a new RFID yoking proof protocol and a new grouping protocol. Unfortunately, Cho et al.'s schemes are still vulnerable to replay attacks. In this paper, in addition to demonstrating weaknesses, we further discuss the rationale behind these weaknesses to provide a guide line for designing secure RFID yoking schemes. Based on the guide line, we propose a new RFID yoking scheme and a new RFID grouping scheme. Performance evaluation shows that our scheme outperforms its counterparts.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61807016 and 61772013)the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20181342)
文摘In this paper, we investigate the group consensus for leaderless multi-agent systems. The group consensus protocol based on the position information from neighboring agents is designed. The network may be subjected to frequent cyberattacks, which is close to an actual case. The cyber-attacks are assumed to be recoverable. By utilizing algebraic graph theory, linear matrix inequality(LMI) and Lyapunov stability theory, the multi-agent systems can achieve group consensus under the proposed control protocol. The sufficient conditions of the group consensus for the multi-agent networks subjected to cyber-attacks are given. Furthermore, the results are extended to the consensus issue of multiple subgroups with cyber-attacks. Numerical simulations are performed to demonstrate the effectiveness of the theoretical results.
文摘A novel broadcast encryption scheme for group communication scenarios in distributed networks is presented. In the scheme, anyone is allowed to encrypt a message and distribute it to a designated group. Each member in the designated group has the ability to independently decrypt a ciphertext. In contrast to traditional broadcast encryption, all the valid receivers in the proposed scheme compose the designated group. To take advantage of this property, a tab for the group is set and the matching private key for each member is generated. In addition, before decrypting a ciphertext, anyone in the scheme can verify the ciphertext, to ensure that the ciphertext is correct. This property is very important for large-scale group communication, as the gateway can filter incorrect ciphertext and alleviate the receiver＇s workload. Finally, a proof in the random oracle model is given, to show that the proposed scheme is secure against the adaptively chosen ciphertext attack.
文摘Prior group-based fingerprinting achieves better detection performance when colluders are from the same group. But in digital wholesale and needs to be identified retail, the middleman as well as customers especially against group colluding attack. The group tracing is neglected in previous works. In this paper, we propose a novel multimedia group fingerprint to trace malicious middlemen along with customers. We explore the quality of the non degenerate linear shift register sequence （NDLSRS） which is convenient in group initialization and management. The theoretic analysis and simulation experiment results show that NDLSRS has good resistance against attacks from colluding groups/ members even after its volume expanded.
基金the National Science Council(No. NSC99-2218-E-260-002)
文摘A radio frequency identification (RFID) yoking proof scheme can generate proofs of simultaneous presence of two tags in the range of a specified reader so that an off-line verifier can verify the proofs later. This proof has found several interesting applications. However, many existing RFID yoking schemes are vulnerable to replay attacks. To overcome the weaknesses, Cho et al. proposed a new RFID yoking proof protocol and a new grouping protocol. Unfortunately, Cho et al.'s schemes are still vulnerable to replay attacks. In this paper, in addition to demonstrating weaknesses, we further discuss the rationale behind these weaknesses to provide a guide line for designing secure RFID yoking schemes. Based on the guide line, we propose a new RFID yoking scheme and a new RFID grouping scheme. Performance evaluation shows that our scheme outperforms its counterparts.
