Efficient verifiable encryption (and fair exchange) of digital signatures
- 1 November 1999
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Secure Hash-and-Sign Signatures Without the Random OracleLecture Notes in Computer Science, 1999
- Proving in Zero-Knowledge that a Number is the Product of Two Safe PrimesLecture Notes in Computer Science, 1999
- A new public key cryptosystem based on higher residuesPublished by Association for Computing Machinery (ACM) ,1998
- The Decision Diffie-Hellman problemPublished by Springer Science and Business Media LLC ,1998
- Optimistic protocols for fair exchangePublished by Association for Computing Machinery (ACM) ,1997
- Security Proofs for Signature SchemesLecture Notes in Computer Science, 1996
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978