This is the accepted version of this article. To be published as : This is the author version pub... more This is the accepted version of this article. To be published as : This is the author version published as: ... QUT Digital Repository: http://eprints.qut.edu.au/ ... Jafari, Mohammad and Safavi‐Naini, Rei and Saunders, Chad and Sheppard, Nicholas P. (2010) Securing ...
We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encr... more We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic prop- erty. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we show how to construct a publicly verifiable mix-net using the shuffle system.
A new concept in group oriented cryptography -- the dynamic threshold cryptosystem -- is presente... more A new concept in group oriented cryptography -- the dynamic threshold cryptosystem -- is presented in the paper. The dynamic system has many advantages over the existing threshold cryptosystems. It is set up by the sender who can not only compose the group of recipients but select the threshold as well. Implementations of the dynamic system based on the ElGamal and the RSA public key cryptosystems are given and their properties are discussed. The proposed solutions are practical and non-interactive. There is no need for trusted dealers or tamper proof modules. The generalization of the concept for an arbitrary access structure concludes the paper. 1 Introduction Cryptography provides tools for the implementation of secure services that guarantee protection of legal rights of individuals and groups. In general, implementations of such services become more complex for groups than for individuals as groups can exhibit different structures and richer relations among participants. Clearly...
In this paper, we show that the linear-coded Kurosawa–Desmedt scheme can be modified to allow rev... more In this paper, we show that the linear-coded Kurosawa–Desmedt scheme can be modified to allow revocation of users, that is to show a revocation scheme can be derived from a linear code
We briefly review security of the second generation mobile phones and then discuss security archi... more We briefly review security of the second generation mobile phones and then discuss security architecture proposed for the third generation phones and the new security issues that will be of importance because of the combination of their advanced capabilities and limitations.
This is the accepted version of this article. To be published as : This is the author version pub... more This is the accepted version of this article. To be published as : This is the author version published as: ... QUT Digital Repository: http://eprints.qut.edu.au/ ... Jafari, Mohammad and Safavi‐Naini, Rei and Saunders, Chad and Sheppard, Nicholas P. (2010) Securing ...
We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encr... more We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic prop- erty. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we show how to construct a publicly verifiable mix-net using the shuffle system.
A new concept in group oriented cryptography -- the dynamic threshold cryptosystem -- is presente... more A new concept in group oriented cryptography -- the dynamic threshold cryptosystem -- is presented in the paper. The dynamic system has many advantages over the existing threshold cryptosystems. It is set up by the sender who can not only compose the group of recipients but select the threshold as well. Implementations of the dynamic system based on the ElGamal and the RSA public key cryptosystems are given and their properties are discussed. The proposed solutions are practical and non-interactive. There is no need for trusted dealers or tamper proof modules. The generalization of the concept for an arbitrary access structure concludes the paper. 1 Introduction Cryptography provides tools for the implementation of secure services that guarantee protection of legal rights of individuals and groups. In general, implementations of such services become more complex for groups than for individuals as groups can exhibit different structures and richer relations among participants. Clearly...
In this paper, we show that the linear-coded Kurosawa–Desmedt scheme can be modified to allow rev... more In this paper, we show that the linear-coded Kurosawa–Desmedt scheme can be modified to allow revocation of users, that is to show a revocation scheme can be derived from a linear code
We briefly review security of the second generation mobile phones and then discuss security archi... more We briefly review security of the second generation mobile phones and then discuss security architecture proposed for the third generation phones and the new security issues that will be of importance because of the combination of their advanced capabilities and limitations.
Uploads