(Convertible) undeniable signatures without random oracles

Authors:
Tsz Hon Yuen;Man Ho Au;Joseph K. Liu;Willy Susilo
Affiliations:
Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia;Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia;Department of Computer Science, University of Bristol, Bristol, UK;Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia
Venue:
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Year:
2007

Citing 22
Cited 7

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Breaking and repairing a convertible undeniable signature scheme

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Convertible Undeniable Signatures

CRYPTO '90 Proceedings of the 10th 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
Undeniable Signatures

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Ring signatures without random oracles

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
RSA-Based Undeniable Signatures

Journal of Cryptology
Designated verifier proofs and their applications

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
New convertible undeniable signature schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Securely obfuscating re-encryption

TCC'07 Proceedings of the 4th conference on Theory of cryptography
New approach for selectively convertible undeniable signature schemes

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Short undeniable signatures without random oracles: the missing link

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Short threshold signature schemes without random oracles

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Short signature and universal designated verifier signature without random oracles

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Time-selective convertible undeniable signatures

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
3-Move undeniable signature scheme

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent blind signatures without random oracles

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Anonymous hierarchical identity-based encryption (without random oracles)

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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

Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Provably secure convertible undeniable signatures with unambiguity

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
A framework for constructing convertible undeniable signatures

ProvSec'10 Proceedings of the 4th international conference on Provable security
Short convertible undeniable signature in the standard model

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
An efficient convertible undeniable signature scheme with delegatable verification

ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Certificateless undeniable signatures from bilinear maps

Information Sciences: an International Journal
Short and efficient convertible undeniable signature schemes without random oracles

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud.