Pairing-Free Blind Signatures from Standard Assumptions in the ROM
- 16 August 2024
- book chapter
- Published by Springer Nature
- p. 210-245
Abstract
No abstract availableKeywords
This publication has 70 references indexed in Scilit:
- Round-Optimal Composable Blind Signatures in the Common Reference String Model2006
- A Signature Scheme with Efficient Protocols2003
- Constructing Elliptic Curves with Prescribed Embedding Degrees2003
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited2002
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme2002
- Security of Blind Discrete Log Signatures against Interactive Attacks2001
- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures2001
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms2000
- Provably Secure Partially Blind Signatures2000
- Untraceable Electronic Cash1990