Efficient and random oracle-free conditionally anonymous ring signature

Authors:
Shengke Zeng;Zhiguang Qin;Qing Lu;Qinyi Li
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China, Network and Data Security Key Laboratory of Sichuan Province, China, Shanghai ...;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China, Network and Data Security Key Laboratory of Sichuan Province, China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China, Network and Data Security Key Laboratory of Sichuan Province, China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China, Network and Data Security Key Laboratory of Sichuan Province, China
Venue:
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Year:
2012

Citing 11
Cited 0

The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
How to Leak a Secret

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Group signatures

EUROCRYPT'91 Proceedings of the 10th 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
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
A new conditionally anonymous ring signature

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Toward the fair anonymous signatures: deniable ring signatures

CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Perfect non-interactive zero knowledge for NP

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Ad hoc group signatures

IWSEC'06 Proceedings of the 1st international conference on Security
Ring signatures of sub-linear size without random oracles

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compared to conventional ring signature schemes, conditionally anonymous ring signatures allow to revoke the anonymity of actual signer without the group manager's help if necessary. When the actual signer intends to confirm his role, it can be proved by a confirmation algorithm. In addition, any user, who is in a ring but not signer, can claim this through a disavowal algorithm. There were several proposals which were proved secure in random oracles. In other words, the security of such schemes depends on the randomness of hash functions. Recently, Zeng et al. proposed a generic construction of conditionally anonymous ring signature scheme without random oracles. Their scheme relies on NIZKs and pseudorandom functions, which render it to be inefficient. This paper proposes a practical ring signature scheme with traceability without random oracles in the common reference string model.