An aggregate signature turns multi-message multi-authentication into multi-message single-authentication, reducing the required storage space, transmission cost and number of verification calculations, and is suitable for fast message authentication in the big data era, particularly in wireless sensor networks and secure email systems. Many aggregate signature schemes have been proposed, including lattice-based ones, which have good resistance to quantum machine attacks. However, the existing lattice-based aggregate signature schemes, which either have strict requirements on the signing order or encounter security risks, are not suitable for the unordered polymerization environment. In this paper, we accordingly propose a lattice-based unordered aggregate signature scheme. The proposed scheme makes use of the intersection method and solves the unordered aggregate problem of lattice signatures with different public keys. Therefore, it avoids both the signing order limitation and the risk of single signature forgery. Furthermore, the scheme follows the improved security model; hence, it is robust against collusion attacks. In addition, the scheme’s security depends on the small integer solution problem, which enables the scheme to resist quantum algorithm attacks.
Secure healthcare information exchange (HIE) is critical to improving medical services, enabling data interoperability, and ensuring patient privacy. However, the increasing threat posed by quantum computing challenges the reliability of conventional cryptographic mechanisms. To address this, we propose a post-quantum secure healthcare data-sharing scheme that combines the Extended Merkle Signature Scheme (XMSS) and consortium blockchain technology to guarantee the integrity, authenticity, and traceability of electronic medical records (EMRs). Furthermore, the scheme incorporates autonomous artificial intelligence (AI) to assist healthcare professionals in generating accurate and intelligent diagnostic reports, enhancing clinical decision-making. We theoretically analyze the scheme's security in the random oracle model, demonstrating that it effectively resists various threats. Performance evaluation shows that the scheme is particularly suitable for HIE scenarios as it reduces about 49% in total computational overheads and 36% in blockchain storage compared to other schemes
16 January 2025 in IEEE Transactions on Network Science and Engineering
The Internet of Things (IoT) serves as a crucial tool supporting smart lifestyles. As a significant application of IoT, the speed and security of transaction processing in a global cold chain logistics system have garnered considerable attention. Addressing these two issues, this paper introduces the self-management chameleon hash with double-auditability and revocability (SCHDR). Our redactable blockchain scheme is based on this chameleon hash function. We implement a self-management mechanism with a random value switching technique based on bilinear pairing and combine dual long-term trapdoor keys and label-binding technologies to achieve a double-auditability mechanism. We also effectively correct malicious rewriting behaviors and revoke the permissions for malicious modifications. The security of our scheme is based on the Bilinear Diffie-Hellman (BDH) assumption, and experiments demonstrate that our scheme possesses high efficiency. Furthermore, our proposal can also be applicable to other IoT applications with similar security requirements.
Digital signature with proxy delegation, which is a secure ownership enforcement tool, allows an original signer to delegate signature rights to a third party called proxy, so that the proxy can sign messages on behalf of the original signer. Many real-world applications make use of this secure mechanism, e.g., digital property transfer. A traditional digital signature mechanism is required to bind a message and its signature together for verification. This may yield extra cost in bandwidth while the sizes of message and signature are relatively huge. Message recovery signature, enabling to reduce the cost of bandwidth, embeds a message into the corresponding signature; therefore, only the signature will be transmitted to the verifier and the message can further be recovered from the signature. In this paper, we, for the first time, propose a novel digital signature scheme in the identity-based context with proxy delegation and message recovery features and, more importantly, our scheme is quantum resistant, in a particular lattice-based signature. Our scheme achieves delegation information and signature existential unforgeability against adaptive chosen warrant and identity. Compared with the seminal lattice-based message recovery signature, our scheme is independent from public key infrastructure, realizes delegation transfer of signature rights, and compresses signature length ulteriorly. To the best of our knowledge, this paper is the first of its type.
The internet-of-things (also known as IoT) connects a large number of information-sensing devices to the Internet to collect all kinds of information needed in real time. The reliability of the source of a large number of accessed information tests the processing speed of signatures. Batch signature allows a signer to sign a group of messages at one time, and signatures’ verification can be completed individually and independently. Therefore, batch signature is suitable for data integration authentication in IoT. An outstanding advantage of batch signature is that a signer is able to sign as many messages as possible at one time without worrying about the size of signed messages. To reduce complexity yielded by multiple message signing, a binary tree is usually leveraged in the construction of batch signature. However, this structure requires a batch residue, making the size of a batch signature (for a group of messages) even longer than the sum of single signatures. In this paper, we make use of the intersection method from lattice to propose a novel generic method for batch signature. We further combine our method with hash-and-sign paradigm and Fiat–Shamir transformation to propose new batch signature schemes. In our constructions, a batch signature does not need a batch residue, so that the size of the signature is relatively smaller. Our schemes are securely proved to be existential unforgeability against adaptive chosen message attacks under the small integer solution problem, which shows great potential resisting quantum computer attacks.