A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Author:
- 15 April 2001
- book chapter
- Published by Springer Nature
- p. 136-151
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols2001
- A Design Principle for Hash Functions2001
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000
- Provably Secure Partially Blind Signatures2000
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin1996
- How to date blind signatures1996
- Optimal asymmetric encryption1995
- Restrictive Binding of Secret-Key CertificatesLecture Notes in Computer Science, 1995
- Blind signatures based on the discrete logarithm problemLecture Notes in Computer Science, 1995
- Witness indistinguishable and witness hiding protocols1990