Homepage of Jens Groth

Jens Groth
Work address	Private address
Jens Groth Department of Computer Science, UCL Gower Street London WC1E 6BT United Kingdom E-mail: j.groth@ucl.ac.uk Fax: +44 20 7387 1397	Jens Groth 24 Jamestown Boulevard Ipswich IP2 8TA United Kingdom Skype: jensois E-mail: jg@brics.dk Mobile: +44 7810 454 822

Openings

Click on openings for information on open positions and other opportunities to work with me.

Publications

Jens Groth: Sub-linear Size Pairing-Based Non-interactive Zero-Knowledge Arguments.
postscript pdf slides (manuscript)

Jens Groth: Homomorphic Trapdoor Commitments to Group Elements.
postscript pdf (manuscript)

Jens Groth: Linear Algebra with Sub-linear Size Zero-Knowledge Arguments. Appears in Advances in Cryptology - CRYPTO 2009, LNCS 5677, pages 192-208.
postscript pdf slides (full paper)

Jens Groth and Yuval Ishai: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. Appears in Advances in Cryptology - EUROCRYPT 2008, LNCS 4965, pages 379-396.
postscript pdf slides (full paper)

Jens Groth and Steve Lu: A Non-interactive Shuffle with Pairing Based Verifiability. Appears in Advances in Cryptology - ASIACRYPT 2007, LNCS 4833, pages 51-67.
postscript pdf slides

Jens Groth: Fully Anonymous Group Signatures without Random Oracles. Appears in Advances in Cryptology - ASIACRYPT 2007, LNCS 4833, pages 164-180.
postscript pdf slides (full paper)

Jens Groth and Rafail Ostrovsky: Cryptography in the Multi-string Model. Appears in Advances in Cryptology - CRYPTO 2007, LNCS 4622, pages 323-341.
postscript pdf (full paper)

Nishanth Chandran, Jens Groth and Amit Sahai: Ring Signatures of Sub-linear Size without Random Oracles. Appears in International Colloquium on Automata, Languages and Programming - ICALP 2007, LNCS 4596, pages 423-434.
postscript pdf slides

Jens Groth and Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. Appears in Advances in Cryptology - EUROCRYPT 2008, LNCS 4965, pages 415-432.
postscript pdf slides (full paper)

Jens Groth and Steve Lu: Verifiable Shuffle of Large Size Ciphertexts. Appears in Practice and Theory in Public Key Cryptography - PKC 2007, LNCS 4450, pages 377-392.
postscript pdf excel

Jens Groth: Simulation-sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. Appears in Advances in Cryptology - ASIACRYPT 2006, LNCS 4284, pages 444-459.
postscript pdf slides (full paper)

Jens Groth, Rafail Ostrovsky and Amit Sahai: Non-interactive Zaps and New Techniques for NIZK. Appears in Advances in Cryptology - CRYPTO 2006, LNCS 4117, pages 97-111.
slides (see full paper of Perfect Non-Interactive Zero-Knowledge for NP)

Douglas Wikström and Jens Groth: An Adaptively Secure Mix-Net Without Erasures. Appears in International Colloquium on Automata, Languages and Programming - ICALP 2006, LNCS 4052, pages 276-287.

Jens Groth, Rafail Ostrovsky and Amit Sahai: Perfect Non-Interactive Zero-Knowledge for NP. Appears in Advances in Cryptology - EUROCRYPT 2006, LNCS 4004, pages 338-359.
postscript pdf slides (full paper)

Jens Groth: Non-interactive Zero-Knowledge Arguments for Voting. Appears in Applied Cryptography and Network Security - ACNS 2005, LNCS 3531, pages 467-482.
postscript pdf slides (full paper)

Jens Groth: Cryptography in Subgroups of Zn*. Appears in Theory of Cryptography Conference - TCC 2005, LNCS 3378, pages 50-65.
postscript pdf slides (corrected paper)

Jan Camenisch and Jens Groth: Group Signatures: Better Efficiency and New Theoretical Aspects. Appears in Security in Communication Networks - SCN 2004, LNCS 3352, pages 120-133.
postscript pdf (full paper)

Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. Appears in Applied Cryptography and Network Security - ACNS 2004, LNCS 3089, pages 46-60.
postscript pdf slides (full paper)

Jens Groth: Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems. Appears in Theory of Cryptography Conference - TCC 2004, LNCS 2951, pages 152-170.
postscript pdf slides

Jens Groth: Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast. Appears in Financial Cryptography - FC 2004, LNCS 3110, pages 90-104.
postscript pdf slides

Ivan Damgård and Jens Groth: Non-interactive and Reusable Non-malleable Commitment Schemes. Appears in Symposium on Theory of Computation - STOC 2003, pages 426-437.
postscript pdf slides (corrected paper)

Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. Appears in Practice and Theory in Public Key Cryptography - PKC 2003, LNCS 2567, pages 145-160.
postscript pdf slides (full and improved paper)

Ivan Damgård, Jens Groth and Gorm Salomonsen: The Theory and Implementation of an Electronic Voting System. Appears in D. Gritzalis (Ed.), Secure Electronic Voting, Kluwer Academic Publishers, 2002, pages 77-99.
postscript pdf

Jens Groth and Gorm Salomonsen: Strong Privacy Protection in Electronic Voting. Invited talk at Trust and Privacy in Digital Business - TrustBus 2001. Full paper available as BRICS technical report RS-04-23.

Conferences I am associated with

Past: ACNS 2006, EUROCRYPT 2007, PKC 2008, TCC 2008, SCN 2008, TCC 2009, Pairing 2009, CRYPTO 2009, ASIACRYPT 2009, TCC 2010.

Curriculum Vitae

postscript pdf

How to pronounce my name

English speakers can say Yens Grot. This captures the pronounciation of my first name quite well. Unfortunately, the Danish "o"-sound does not have an English equivalent. If you speak another language I suggest using that language's "o" and you may end up pronouncing my surname correctly as well.