The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ASIACRYPT '01 Proceedings of the 7th 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
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient ring signatures without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Simulatable VRFs with applications to multi-theorem NIZK
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Escrowed linkability of ring signatures and its applications
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Constant-size ID-based linkable and revocable-iff-linked ring signature
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
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
Short linkable ring signatures revisited
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Short linkable ring signatures for e-voting, e-cash and attestation
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Separable linkable threshold ring signatures
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The 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
Ring signatures of sub-linear size without random oracles
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction
Theoretical Computer Science
| Hi-index | 0.00 |
Traceable ring signatures, proposed at PKC'07, are a variant of ring signatures, which allow a signer to anonymously sign a message with a tag behind a ring, i.e., a group of users chosen by the signer, unless he signs two messages with the same tag. However, if a signer signs twice on the same tag, the two signatures will be linked and the identity of the signer will be revealed when the two signed messages are different. Traceable ring signatures can be applied to anonymous writein voting without any special voting authority and electronic coupon services. The previous traceable ring signature scheme relies on random oracles at its security and the signature size is linear in the number of ring members. This paper proposes the first secure traceable ring signature schemes without random oracles in the common reference string model. In addition, the proposed schemes have a signature size of O(√N), where N is the number of users in the ring.