Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A novel ID-based group signature
Information Sciences—Informatics and Computer Science: An International Journal
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
RSA-Based Undeniable Signatures for General Moduli
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
Designs, Codes and Cryptography
Convertible Undeniable Partially Blind Signatures
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
A Fault Attack on Pairing-Based Cryptography
IEEE Transactions on Computers
Deterministic Identity-Based Signatures for Partial Aggregation
The Computer Journal
Securing Mobile Ad Hoc Networks with Certificateless Public Keys
IEEE Transactions on Dependable and Secure Computing
Simulatability and security of certificateless threshold signatures
Information Sciences: an International Journal
An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
Theoretical Computer Science
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Invisibility and anonymity of undeniable and confirmer signatures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
CBE from CL-PKE: a generic construction and efficient schemes
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
The security of the FDH variant of Chaum's undeniable signature scheme
IEEE Transactions on Information Theory
Certificate-based verifiably encrypted signatures from pairings
Information Sciences: an International Journal
Certificateless Threshold Ring Signature
Information Sciences: an International Journal
Certificateless signcryption scheme in the standard model
Information Sciences: an International Journal
Simulatable certificateless two-party authenticated key agreement protocol
Information Sciences: an International Journal
A pure labeled transition semantics for the applied pi calculus
Information Sciences: an International Journal
Forward-secure identity-based signature: Security notions and construction
Information Sciences: an International Journal
Self-generated-certificate public key encryption without pairing and its application
Information Sciences: an International Journal
A new provably secure certificateless short signature scheme
Computers & Mathematics with Applications
Efficient certificateless proxy signature scheme with provable security
Information Sciences: an International Journal
Certificateless undeniable signatures from bilinear maps
Information Sciences: an International Journal
Certificateless threshold signature secure in the standard model
Information Sciences: an International Journal
Cryptanalysis and improvement of a certificateless threshold signature secure in the standard model
Information Sciences: an International Journal
| Hi-index | 0.08 |
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based cryptosystems. Also it can avoid the onerous management of certificates. Particularly, by using some cryptographic and mathematical techniques, we guarantee that the scheme's two component protocols satisfy the properties of zero-knowledge proofs. To address the security issues, we extend security notions of undeniable signatures to the complex certificateless setting, and consider two different types of adversaries. Based on these formally defined security notions, we prove that in the random oracle model, the certificateless undeniable signature scheme is secure in the sense of existential unforgeability under the Bilinear Diffie-Hellman assumption, and is secure in the sense of invisibility under the Decisional Bilinear Diffie-Hellman assumption.