[CFRG] Re: BBS+ benchmarks v06

["Schanzenbach, Martin" <[e-mail]>]

Hi Jaromil,

great work. We also have an implementation here: 
https://github.com/Fraunhofer-AISEC/libbbs (*) in C.

Now, our benchmarks are probably not comparable, but at the bottom of 
the page you can find our numbers for 2 messages / 1 disclosed.
Maybe when we get around to it we try to replicate your benchmarks, but 
looking at your code it seems to me that you only modify the number of 
messages (which you call credentials)?
Because your post suggests ~1s for ~1000 *proofs* which would be 
extremely fast.

BR
Martin

(*) we are still working on making the changes of -06

On 23.08.24 22:52, Jaromil wrote:
> Dear colleagues,
> 
> Here is my benchmark analysis of BBS+ at its current version 06.
> https://news.dyne.org/benchmark-of-the-bbs-signature-scheme-v06/
> 
> In brief: BBS+ performs very well, its data objects size fits NFC tags, and its zero-knowledge proof appears as random data to any external observer.
> 
> I welcome your feedback and comments, also suggestions about any other benchmark approach: I will be happy to include it.
> 
> Wish you all a great weekend!
> Ciao
>