I saw a talk a while ago by Elena Pagnin (Chalmers) about Server-Aided Verification (SAV). SAV aims at offloading heavy computations from devices who want to verify signatures. The idea is to replace the heavy computations with a smaller one, \ie verifiable computations, and thus verify that the server has done the computations correctly. This can be made cheaper than actually verifying the signature. It works for CL04 signatures, which is exactly what we're using.
We can add this to the discussion as an option to make things computationally lighter. (The gains are not that much at the moment --- like one exponentiation or pairing operation --- but they are still gains and it matters when we have to verify millions of signatures.)
I saw a talk a while ago by Elena Pagnin (Chalmers) about Server-Aided Verification (SAV). SAV aims at offloading heavy computations from devices who want to verify signatures. The idea is to replace the heavy computations with a smaller one, \ie verifiable computations, and thus verify that the server has done the computations correctly. This can be made cheaper than actually verifying the signature. It works for CL04 signatures, which is exactly what we're using.
We can add this to the discussion as an option to make things computationally lighter. (The gains are not that much at the moment --- like one exponentiation or pairing operation --- but they are still gains and it matters when we have to verify millions of signatures.)