Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient revocation and threshold pairing based cryptosystems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
RSA-OAEP Is Secure under the RSA Assumption
Journal of Cryptology
A method for fast revocation of public key certificates and security capabilities
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Chosen-Ciphertext Secure RSA-Type Cryptosystems
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
A forward-secure public-key encryption scheme
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Certificate-based encryption and the certificate revocation problem
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simple identity-based cryptography with mediated RSA
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
A separation between selective and full-identity security notions for identity-based encryption
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Mathematics of Public Key Cryptography
Mathematics of Public Key Cryptography
Hi-index | 0.00 |
This paper relies on the traditional method RSA-OAEP with an identification-based encryption. Firstly, we make a little change in the basic idea Boneh et al., 2002; Ding and Tsudik, 2003 in order to create a scheme with which we can sign and crypt at same time. A simple comparison prove that our signature is equivalent to the signature of Shamir. Then, we propose a new approach, which conserve properly the RSA classic. In this paper we will also respond to the question of Xuhua Ding and Gene Tsudik, to propose a convenient exponent for an RSA-IBE.