A randomized protocol for signing contracts
Communications of the ACM
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th 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
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
ACSAC '98 Proceedings of the 14th Annual Computer Security Applications Conference
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
Efficient and secure protocol in fair certified E-mail delivery
WSEAS Transactions on Information Science and Applications
An efficient secure proxy verifiably encrypted signature scheme
Journal of Network and Computer Applications
Verifiably Encrypted Signatures from RSA without NIZKs
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
A novel verifiably encrypted signature scheme without random oracle
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Zero-knowledge argument for simultaneous discrete logarithms
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
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
An agent-mediated fair exchange protocol
ICICS'10 Proceedings of the 12th international conference on Information and communications security
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
Secure obfuscation of encrypted verifiable encrypted signatures
ProvSec'11 Proceedings of the 5th international conference on Provable security
Efficient fair certified e-mail delivery based on RSA
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
A novel behavior-based peer-to-peer trust model
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Efficient identity-based protocol for fair certified e-mail delivery
CANS'05 Proceedings of the 4th international conference on Cryptology and Network 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
Custodian-hiding verifiable encryption
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Timed-release encryption with pre-open capability and its application to certified e-mail system
ISC'05 Proceedings of the 8th international conference on Information Security
Three-round abuse-free optimistic contract signing with everlasting secrecy
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient autonomous signature exchange on ubiquitous networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build efficient fair exchange and certified e-mail protocols.