This was a mini project for CS 517 (Theory of Computation) at Oregon State University in Spring 2024. We had to use a SAT/SMT solver for some problem related to our research area.
A Blind Signature Scheme (BSS) is a cryptographic primitive which allows a user to obtain a digital signature on a message from a signer without revealing their message [Cha82]. In 1992, Chaum and Pedersen introduced the Schnorr Blind Signature Scheme (SBSS) as the first BSS based on prime-order groups rather than factoring [CP92].