In the paper "Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures" from Groth, the section 6 describes a NIZK proof for pairing product equations.
I only know the basics in the domain of zero knowledge proofs and I saw some basic algorithm. What I would like to know is if there is a way to implement the prover and verifier algorithm ? By using some already existing implmentation like the Schnorr one or another one that I could adapt ?
In summary, I would like to know if there are ways to implement the algorithms shown in the paper. Or is it just a theoretical state at the moment?