Lenient/Strict Batch Verification in Several Groups

摘要: Batch verification is a useful tool in verifying large number of cryptographic items all at one time. It especially effective predicates based on modular exponentiation. In some cases, however, the can be incorrect although they pass batch together. Such leniency eliminated by checking domain each item advance. With this mind, we investigate if strict remain more than separate verification. paper, estimate efficiency such several types groups, prime subgroup ZZp with special/random p and subgroups defined elliptic curves over Fp, F2m Fpm, which are often used DL-based primitives. Our analysis concludes that differs greatly depending choice group parameters determined predicate. Furthermore, even show there cases where verification, regardless strictness, loses its computational advantage.