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
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
RSA-Based Undeniable Signatures
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Gradually Convertible Undeniable Signatures
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
New convertible undeniable signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Time-selective convertible undeniable signatures with short conversion receipts
Information Sciences: an International Journal
Invisibility and anonymity of undeniable and confirmer signatures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Provably secure convertible undeniable signatures with unambiguity
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
A new construction of designated confirmer signature and its application to optimistic fair exchange
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Short convertible undeniable signature in the standard model
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
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
Efficient designated confirmer signatures without random oracles or general zero-knowledge proofs
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Time-selective convertible undeniable signatures
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
An efficient convertible undeniable signature scheme with delegatable verification
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
| Hi-index | 0.00 |
A time-selective convertible undeniable signature scheme allows a signer to release a time-selective converter which converts undeniable signatures pertaining to or up to a specific time period to publicly verifiable ones but not those in any other time periods. The security of existing schemes relies on a strong and interactive assumption called xyz-DCAA in random oracle model or several relatively new hash function assumptions in the generic group model. For some of them, the converter size for each time period also grows linearly or logarithmically with the number of previous time periods. In this paper, we propose a new construction in which all the converters (i.e. time-selective, selective and universal) are of constant size. In particular, the time-selective converter for each time period is only one group element, no matter how many previous time periods there are already. The security of this new construction is proved in the random oracle model based on noninteractive and falsifiable assumptions.