Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques 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
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
The security of the FDH variant of chaum's undeniable signature scheme
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Group signatures: better efficiency and new theoretical aspects
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Foundations of group signatures: the case of dynamic groups
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient Secret Authenticatable Anonymous Signcryption Scheme with Identity Privacy
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A strong designated verifier ring signcryption scheme
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A new type of proxy ring signature scheme with revocable anonymity and no info leaked
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
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
A new conditionally anonymous ring signature
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Two extensions of the ring signature scheme of Rivest-Shamir-Taumann
Information Sciences: an International Journal
IWSEC'06 Proceedings of the 1st international conference on Security
An efficient conditionally anonymous ring signature in the random oracle model
Theoretical Computer Science
Efficient and random oracle-free conditionally anonymous ring signature
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Hi-index | 0.00 |
Ring signature scheme, proposed by Rivest et al., allows a signer to sign a message anonymously. In the ring signature scheme, the signer who wants to sign a document anonymously first chooses some public keys of entities (signers) and then generates a signature which ensures that one of the signer or entities signs the document. In some situations, however, this scheme allows the signer to shift the blame to victims because of the anonymity. The group signature scheme may be a solution for the problem; however, it needs a group manager (electronic big brother) who can violate the signer anonymity without notification, and a complicated key setting. This paper introduces a new concept of a signature scheme with signer anonymity, a deniable ring signature scheme ( $\mathcal{DRS}$), in which no group manager exists, and the signer should be involved in opening the signer anonymity. We also propose a concrete scheme proven to be secure under the assumption of the DDH (decision Diffie Hellman) problem in the random oracle model.