A ciphertext-policy attribute-based encryption scheme allows that an encrypter assigns a decryption policy to ciphertexts. Any user will be able to decrypt if and only if a set of attributes (his private key) satisfy the assigned decryption policy. In this paper we first propose a new chosen ciphertext secure ciphertext-policy attribute-based encryption scheme with constant-size ciphertext and ...

Medium Field Equation (MFE) multivariate public key cryptosystems were broken by High Order Linearization Equation (HOLE) attack. In order to avoid HOLE attack, we proposed an improvement of MFE, Cubic MFE public key encryption scheme. In our construction, multiplications of three second order matrices were used to get a set of cubic polynomials in the central map. Through theoretical analysis ...

If a malicious party can insert a self-issued CA public key into the list of root public keys stored in a PC, then this party could potentially do considerable harm to that PC. In this paper, we present a way to achieve such an attack for the Internet Explorer web browser root key store, which avoids attracting the user’s attention. A realisation of this attack is also described. Finally, count...

In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

in this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by jannati and falahati (so-called jf). we prove that an adversary can recover key bits of jf protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. in addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

In the CT-track of the 2006 RSA conference, a new multivariate public key cryptosystem, which is called the Medium Field Equation (MFE) multivariate public key cryptosystem, is proposed by Wang, Yang, Hu and Lai. We use the second order linearization equation attack method by Patarin to break MFE. Given a ciphertext, we can derive the plaintext within 2 F216 -multiplications, after performing o...