A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Simple and fast optimistic protocols for fair electronic exchange
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Breaking and repairing optimistic fair exchange from PODC 2003
Proceedings of the 3rd ACM workshop on Digital rights management
Fair exchange protocol of signatures based on aggregate signatures
Computer Communications
A new certificateless aggregate signature scheme
Computer Communications
Fair exchange protocol of Schnorr signatures with semi-trusted adjudicator
Computers and Electrical Engineering
Hi-index | 0.00 |
In 2003, Boneh et al. proposed the first non-interactive verifiably encrypted signature scheme that can be used to construct optimistic fair exchange protocols of signatures. However, their scheme depends on an entirely honest adjudicator, neither forging signatures nor colluding with one party. To eliminate this unrealistic premise, we propose a new paradigm for building fair exchange protocols of signatures from pairings by choosing a certificate authority CA as an adjudicator. In this paradigm, a certificate, or generally, a signature plays threefold role, firstly acts as the binding of the public key and its holder, secondly acts as a decryption key, and thirdly acts as CA's guarantee against partiality in adjudication. The proposed protocol not only overcomes the classical authentication problem of public keys, but also relaxes excessive reliance on the trustworthiness of the adjudicator so that the adjudicator only needs to be trusted by the signer.