Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
ID-Based Blind Signature and Ring Signature from Pairings
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
1-out-of-n Signatures from a Variety of Keys
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Ring signatures without random oracles
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Efficient ID-based blind signature and proxy signature from bilinear pairings
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
A forward-secure public-key encryption scheme
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Linkable ring signatures: security models and new schemes
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Efficient identity based ring signature
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Compact group signatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Ring signatures: stronger definitions, and constructions without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Identity-based ring signatures from RSA
Theoretical Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Certificate based (linkable) ring signature
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
An efficient identity-based ring signature scheme and its extension
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
An ID-based anonymous signcryption scheme for multiple receivers secure in the standard model
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
A suite of non-pairing ID-based threshold ring signature schemes with different levels of anonymity
ProvSec'10 Proceedings of the 4th international conference on Provable security
Self-certified ring signatures
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Online/Offline ring signature scheme
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Anonymous identification and designated-verifiers signatures from insecure batch verification
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Security and Communication Networks
Certificate-free ad hoc anonymous authentication
Information Sciences: an International Journal
Hi-index | 0.00 |
The only known construction of ID-based ring signature schemes which maybe secure in the standard model is to attach certificates to non-ID-based ring signatures. This method leads to schemes that are somewhat inefficient and it is an open problem to find more efficient and direct constructions. In this paper, we propose two such constructions. Our first scheme, with signature size linear in the cardinality of the ring, is secure in the standard model under the computational Diffie-Hellman assumption. The second scheme, achieving constant signature size, is secure in a weaker attack model (the selective ID and selective chosen message model), under the Diffie-Hellman Inversion assumption.