In post-disaster scenarios, the lack of medical staff at Casualty Collection Points (CCPs) slows down injury triage. Using robots to apply wristbands to casualties may be a promising solution, but it could potentially pose a risk of further injury due to limb adjustments. To address this, this paper proposes deploying a search and rescue (SAR) robot equipped with a manipulator at CCPs. These robots can autonomously apply wristbands, sparing the need for limb adjustments. Firstly, a SAR robot system and an easily wearable medical sensor wristband were proposed, allowing the system to conveniently place the wristband on human wrists and ankles. Next, to address the challenge of wearing the wristband/anklet without adjusting the injured person's limbs, a 6D pose estimation method for wrists/ankles was introduced. This method enables accurate pose estimation for effective wearing. Subsequently, a control strategy for autonomously wearing the wristband by the manipulator was proposed, along with the development of a method to assess the applicability of the wristband and ensure proper wearing. Finally, a large number of experiments were conducted to wear the wristband, both indoors and outdoors with SAR robots. The performance of the robot was excellent in outdoor large-scale disaster drills.

Cloud data auditing is essential to ensure the integrity of cloud data.The main idea of cloud auditing is to entrust the audit task to a thirdparty auditor (TPA) with powerful computing ability.However, TPA may lead to data leakage and become the single point of failure.Recently, blockchain has been introduced to solve these problems by TPA.However, the dynamic storage structure developed by traditional cloud storage does not apply to the blockchain.This paper proposes a blockchain-based collaborative public auditing scheme for dynamic data.We design the cloud service provider(CSP) to generate a challenge set using the latest block hash.It does not need to interact with the blockchain in the challenge phase, dramatically reducing communication overhead.In addition, considering economic factors, we allow users to seek partners to reduce audit costs.The EigenTrust model evaluates the reputation of each user's audit behaviour, effectively avoiding the probability of malicious users participating.For data update, we introduce the Pseudo Index Linked List(PIL) index management structure, which reduces the size of the index management structure to adapt to the blockchain's characteristics and makes the update operation have a constant time complexity.Through a complete security analysis and performance evaluation, we proved the security and effectiveness of the scheme.

Patient location sharing is an important part of modern smart healthcare and mobile medical services. Blockchain has many attractive properties and is suitable for managing patient locations in telecare medical information systems (TMIS). Recently, Ji et al. proposed a blockchain-based multilevel privacy-preserving location sharing (BMPLS) scheme for TMIS. In this paper, we show that Ji et al.’s BMPLS scheme does not achieve confidentiality and multilevel privacy-preserving. An adversary outside the system can use an ordinary personal computer to completely break the system within a dozen hours and obtain the location of any patient at any time. The adversary inside the system can use an ordinary personal computer to obtain the location of the designated patient within tens of seconds. Using salting technology, we propose an improved BMPLS scheme to fix our attacks. We also optimized the BMLS scheme to make it correct and executable. The security analysis shows that the improved BMPLS scheme achieves decentralization, untamperability, confidentiality, multilevel privacy-preserving, retrievability, and verifiability. The simulation shows that the improved BMPLS scheme is practical, the computational overhead of the location record phase is within 10 ms, and the computational overheads of the location sharing and location extraction phases are both within 30 ms.

Summary Attribute‐based signature (ABS) is a widely used cryptographic primitive, that provides both data integrity and fine‐grained privacy protection. However, the signing overhead of ABS is usually too large, making it unsuitable for resource‐constrained devices. Using cloud computing technology, the notion of outsourced attribute‐based signatures (OABS) was introduced to overcome this drawback. In OABS, the user can outsource him/her signing tasks to the signing‐cloud service provider (S‐CSP). The previous notion of privacy of OABS does not take the S‐CSP's attack into account, so it is not strong enough. To conform to the reality of cloud computing, we present a more accurate notion of privacy, called perfect privacy, which ensures that any adversary, even the S‐CSP, cannot identify which policy is used to generate the signature. Then, we propose a key‐policy OABS scheme for circuits based on multilinear mapping with perfect privacy. By using the outsourcing technique, in our scheme, the computation cost of the signer is only three or four pairing operations, which is independent of the complexity of the policy and the size of the attribute set. Our scheme achieves three advantages: perfect privacy, expressive policy, and constant signing cost, simultaneously.

The multi-signature is a special signature which is generated by multiple group members with the knowledge of multiple private keys, while the subliminal channel is a covert communication channel that can be used to send a secret message to an authorized receiver but the message cannot be discovered by any unauthorized receiver. A (t,n) threshold scheme allows a secret to be shared among n users so that only t or more users can cooperatively reconstruct the secret. All multi-signature schemes available are for either discrete-logarithm-type (DL-type) keys only or RSA-type keys only. In this paper, we propose a multi-signature scheme, which allows mixture use of DL and RSA-type keys and is suitable for the ad-hoc environments. Then based on the proposed multi-signature scheme, we propose a anonymous threshold subliminal channel scheme, in which the subliminal message sender is indistinguishable and the subliminal message cannot be derived without the cooperation oft or more users in the group, where t is a threshold value.

This paper extends the concept of partially blind signature to the convertible undeniable partially blind signature, in which only the signer can verify and confirm the validity of given signatures and convert given signatures into universally verifiable signatures, along with a formal definition for it and a practical scheme that implements it. The proposed scheme is efficient and secure, in which its unforgeability is the same as that of the Schnorr's signature scheme and its untransferability relies on the hardness of decision Diffie-Hellman problem.