A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Verifiable encryption of digital signatures and applications
ACM Transactions on Information and System Security (TISSEC)
Short Signatures from the Weil Pairing
Journal of Cryptology
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Blind ring signatures secure under the chosen-target-CDH assumption
ISC'06 Proceedings of the 9th international conference on Information Security
An ID-Based verifiable encrypted signature scheme based on hess’s scheme
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
A robust verifiably encrypted signature scheme
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Verifiably encrypted signature scheme without random oracles
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Identity-Based Verifiably Encrypted Signatures without Random Oracles
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Fair exchange protocol of Schnorr signatures with semi-trusted adjudicator
Computers and Electrical Engineering
Fair exchange of valuable information: A generalised framework
Journal of Computer and System Sciences
Achieving autonomous fair exchange in ubiquitous network settings
Journal of Network and Computer Applications
One-time trapdoor one-way functions
ISC'10 Proceedings of the 13th international conference on Information security
Efficient CDH-based verifiably encrypted signatures with optimal bandwidth in the standard model
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Further observations on optimistic fair exchange protocols in the multi-user setting
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Perfect ambiguous optimistic fair exchange
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
| Hi-index | 0.01 |
Verifiably encrypted signature is a extended signature type and plays an important role in the constructing optimistic fair exchange. In the work, we propose a novel verifiably encrypted signature scheme without random oracles, and show that the security of the scheme is based on the difficulty of solving the Chosen-Target-Inverse-CDH with square problem. By comparing our scheme with Boneh et al scheme and S.Lu et al scheme, we show that our proposed scheme has the following advantages: (1) short signature size, only 320 bits; (2)low computation, only 2 pairing operations are needed in the phase of producing and verifying verifiably encrypted signature, respectively. (3)simplification-ability, the creation of verifiably encrypted signature is able to be completed in a logic step.