A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Introduction to cryptography: principles and applications
Introduction to cryptography: principles and applications
Number Theory for Computing
Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Cramer-Shoup Strong-RSASignature Scheme Revisited
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Security of Signature Schemes in a Multi-User Setting
Designs, Codes and Cryptography
Key Substitution Attacks on Provably Secure Short Signature Schemes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Security analysis of the Gennaro-Halevi-Rabin signature scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
A secure signature scheme from bilinear maps
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
IEEE 802.11 user fingerprinting and its applications for intrusion detection
Computers & Mathematics with Applications
How (Not) to design strong-RSA signatures
Designs, Codes and Cryptography
Fuzzy biometric signcryption scheme with bilinear pairings in the standard model
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
The effect of leaders on the consistency of group behaviour
International Journal of Sensor Networks
Security and Communication Networks
Temporal accountability and anonymity in medical sensor networks
Mobile Networks and Applications - Special issue on Wireless and Personal Communications
| Hi-index | 0.00 |
Digital signature is commonly used for authentication of a user or data. In order to ensure the security of a signature scheme, it is important to design a signature scheme with a security proof. In 1999, Gennaro et al. and Cramer et al. respectively proposed practical and provably secure signature schemes under the standard assumption without the random oracle model. Since then, some provably secure signature schemes in the standard model were constructed, for example, Camenisch Lysyanskaya scheme in 2002; Fischlin scheme and Tan-Yi-Siew scheme in 2003. In this paper, we construct a new provably secure signature scheme based on the strong RSA assumption against existential forgery under adaptive chosen message attack in the standard model. The proposed scheme is also more efficient than other provable secure schemes in the standard model.