A couple of implementations of Identity-Based Signature Schemes (IBS) with linked papers.

This should not be used in production and is simple a proof-of-concept I wrote to help me understand these schemes.

Benchmarks are visible here

Implementations:

• Hes02
  • Signing and Verifying take about the same amount of time
  • User secrets can be split between multiple TAs
• Pat02
  • Signing requires no pairing calculations and is thus fairly efficient
  • Verifying only really requires one pairing computation
  • User secrets can be split between multiple TAs
• BLM05
  • Signing requires no pairing calculations and is thus fairly efficient
  • Verifying only requires one paring calculation and one group operation in G_t
  • User secrets cannot be split between multiple TAs without some sort of homomorphic encryption due to how the user secrets are generated
• PJ06
• CDC06
• Yi03