Groth revolutionized the area of zero-knowledge proofs with the invention of practical pairing-based non-interactive zero-knowledge proofs, which was recognized early on with the UCLA Chancellor’s Award for Postdoctoral Research in 2007. He initiated the use of pairings to construct succinct non-interactive arguments, so-called SNARGs, with minimal communication. He has also invented the world's most efficient verifiable shuffles, which are used as a component of many mix-nets and voting schemes. Other areas of contribution include structure-preserving cryptography, ring and group signatures, private information retrieval, and public key cryptography.