Learn More
This article considers the problem of how to prevent the fast RSA signature and decryption computation with residue number system (or called the CRT-based approach) speedup from a hardware fault cryptanalysis in a highly reliable and efficient approach. The CRT-based speedup for RSA signature has been widely adopted as an implementation standard ranging(More)
Recently, many research works have been reported about how physical cryptanalysis can be carried out on cryptographic devices by exploiting any possible leaked information through side channels. In this paper, we demonstrate a new type of safe-error based hardware fault cryptanalysis which is mounted on a recently reported countermeasure against simple(More)
The traceability is one of the core requirements for group signature schemes. Group signature schemes based on the bilinear mapping were proposed. The bilinearity of a bilinear mapping allows an efficient signature scheme verification for signature schemes based on the discrete logarithm type problem. But the bilinearity of a bilinear mapping can be an(More)
Since Miller and Koblitz applied elliptic curves to cryptographic system in 1985[3,6], a lot of researchers have been interested in this field and various speedup techniques for the scalar multiplication have been developed. Recently, Gallant et al. published a method that accelerates the scalar multiplication and is applicable to a larger class of(More)
Redactable signature schemes permit deletion of arbitrary substrings of a signed document while preserving the authenticity of the remaining document. Most of known redactable signatures based on pairing have large‐sized signatures and the sizes depend on the product of security parameter and the number of blocks of the redacted document. In this paper, we(More)
Batch cryptography has been developed into two main branches batch verification and batch identification. Batch verification is a method to determine whether a set of signatures contains invalid signatures, and batch identification is a method to find bad signatures if a set of signatures contains invalid signatures. Recently, some significant developments(More)
Recently, Shao et al. proposed two bidirectional proxy re-signature schemes Smb and Sid−mb [3]. In their paper, the authors gave security proofs to say that both of them are secure in their security model without random oracles. But, we found that the scheme Smb is miss leaded and its security proof is false. In this paper, we present an attack on Smb and(More)