Efficient Zero Knowledge for Regular Language

ePrint Report: Efficient Zero Knowledge for Regular Language

Michael Raymond, Gillian Evers, Jan Ponti, Diya Krishnan, Xiang Fu

A succinct zero knowledge proof for regular language mem-
bership, i.e., to prove a secret string behind an encryption (hash) belongs
to a regular language is useful, e.g., for asserting that an encrypted email
is free of malware. The great challenge in practice is that the regular
language used is often huge. We present zkreg, a distributed commit-
and-prove system that handles …

email encrypted encryption eprint report free hash knowledge language michael prove report secret zero knowledge zero knowledge proof