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)
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)
Recently, Shao et al. proposed two bidirectional proxy re-signature schemes S mb and S id−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 S mb is miss leaded and its security proof is false. In this paper, we present an attack on S mb(More)
To assure the privacy of RFID Tags, symmetric challenge-response identification protocols have been considered. Due to the low cost requirements for tags, it has been assumed that the tampering of RFID tags is possible. In this paper, we estimate the privacy leakage of challenge-response RFID authentication protocols based on symmetric key using discrete(More)
This paper presents a new type of powerful cryptanalytic attacks on public-key cryptosystems, extending the more commonly studied adaptive chosen-ciphertext attacks. In the new attacks, an adversary is not only allowed to submit to a decryption oracle (valid or invalid) ciphertexts of her choice, but also to emit a " dump query " prior to the completion of(More)