How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
New Signcryption Schemes Based on KCDSA
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Computational Alternatives to Random Number Generators
SAC '98 Proceedings of the Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Signcryption Scheme Based on Integer Factorization
ISW '00 Proceedings of the Third International Workshop on Information Security
A Signcryption Scheme with Signature Directly Verifiable by Public Key
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Formal Proofs for the Security of Signcryption
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficiency improvements for signature schemes with tight security reductions
Proceedings of the 10th ACM conference on Computer and communications security
Versatile padding schemes for joint signature and encryption
Proceedings of the 11th ACM conference on Computer and communications security
Parallel authentication and public-key encryption
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Provably secure encrypt-then-sign composition in hybrid signcryption
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
New DSA-verifiable signcryption schemes
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Two birds one stone: signcryption using RSA
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Analysis of improved signcryption scheme with key privacy
Information Processing Letters
Signcryption Scheme in Multi-user Setting without Random Oracles
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Forgery of Provable Secure Short Signcryption Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Constructions of Signcryption Schemes and Signcryption Composability
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
On the security of some multi-PKG/multi-recipient signcryption schemes
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Security analysis of two signature schemes and their improved schemes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Signcryption with non-interactive non-repudiation without random oracles
Transactions on computational science X
A family of implementation-friendly BN elliptic curves
Journal of Systems and Software
Efficient short signcryption scheme with public verifiability
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Efficient signcryption without random oracles
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Efficient and proactive threshold signcryption
ISC'05 Proceedings of the 8th international conference on Information Security
Dynamic attribute-based signcryption without random oracles
International Journal of Applied Cryptography
Dynamic attribute-based signcryption without random oracles
International Journal of Applied Cryptography
Secured hierarchical secret sharing using ECC based signcryption
Security and Communication Networks
| Hi-index | 0.00 |
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. This new scheme is quite efficient: the signcryption operation has almost the same cost as an El Gamal encryption while the reverse operation only requires one pairing evaluation and three exponentiations. The scheme's chosen-ciphertext security is shown to be related to the hardness of the q-Diffie-Hellman Inversion (q–DHI) problem in the random oracle model while its unforgeability is proved under the q-Strong Diffie-Hellman assumption (q-SDH). It also provides detachable signatures that are unlinkable to the original anonymous ciphertext. We also show that most of the sender's workload can be computed offline. Our construction is based on a signature scheme independently studied by Boneh-Boyen and Zhang et al. in 2004.