Jens Groth | ||
| Jens Groth Department of Computer Science, UCL Gower Street London WC1E 6BT United Kingdom Office: 7.21a |
|
|
Stephanie Bayer and Jens Groth: Efficient Zero-Knowledge Argument for Correctness of a Shuffle. To appear at Advances in Cryptology - EUROCRYPT 2012.
pdf slides (full paper)
Jens Groth: Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. Advances in Cryptology - ASIACRYPT 2011, LNCS 7073, 431-448.
pdf slides (full paper)
Masayuki Abe, Jens Groth and Miyako Ohkubo: Separating Short Structure Preserving Signatures from Non-Interactive Assumptions. Advances in Cryptology - ASIACRYPT 2011, LNCS 7073, 628-646.
Masayuki Abe, Jens Groth, Kristiyan Haralambiev and Miyako Ohkubo: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. Advances in Cryptology - CRYPTO 2011, LNCS 6841, pages 649-666.
pdf slides (full paper)
Jens Groth: Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption. Manuscript 2011.
pdf
Jens Groth: Short Non-interactive Zero-Knowledge Proofs. Advances in Cryptology - ASIACRYPT 2010, LNCS 6477, pages 341-358.
pdf slides (full paper)
Jens Groth: Short Pairing-Based Non-interactive Zero-Knowledge Arguments. Advances in Cryptology - ASIACRYPT 2010, LNCS 6477, pages 321-340.
pdf slides (full paper)
Jens Groth: A Verifiable Secret Shuffle of Homomorphic
Encryptions. Journal of Cryptology, vol. 23(4), pages 546-579, 2010.
pdf slides (appeared earlier in PKC 2003)
Jens Groth: Homomorphic Trapdoor Commitments to Group Elements.
pdf (manuscript)
Merged paper Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev and Miyako Ohkubo: Structure-Preserving Signatures and Commitments to Group Elements. Advances in Cryptology - CRYPTO 2010, LNCS 6223, pages 209-236.
Jens Groth, Aggelos Kiayias and Helger Lipmaa: Multi-Query Computationally-Private Information Retrieval with Constant Communication Rate. Practice and Theory in Public Key Cryptography - PKC 2010, LNCS 6056, pages 107-123.
pdf slides
Jens Groth: Linear Algebra with Sub-linear Size Zero-Knowledge Arguments. Advances in Cryptology - CRYPTO 2009, LNCS 5677, pages 192-208.
pdf slides more slides (full paper)
Jens Groth and Yuval Ishai: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. Advances in Cryptology - EUROCRYPT 2008, LNCS 4965, pages 379-396.
pdf slides (full paper)
Jens Groth and Steve Lu: A Non-interactive Shuffle with Pairing Based Verifiability. Advances in Cryptology - ASIACRYPT 2007, LNCS 4833, pages 51-67.
pdf slides
Jens Groth: Fully Anonymous Group Signatures without Random Oracles. Advances in Cryptology - ASIACRYPT 2007, LNCS 4833, pages 164-180.
pdf slides (full paper)
Jens Groth and Rafail Ostrovsky: Cryptography in the Multi-string Model. Advances in Cryptology - CRYPTO 2007, LNCS 4622, pages 323-341.
pdf (full paper)
Nishanth Chandran, Jens Groth and Amit Sahai: Ring Signatures of Sub-linear Size without Random Oracles. International Colloquium on
Automata, Languages and Programming - ICALP 2007, LNCS 4596, pages 423-434.
pdf slides
Jens Groth and Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. Advances in Cryptology - EUROCRYPT 2008, LNCS 4965, pages 415-432.
pdf slides (full paper)
Jens Groth and Steve Lu: Verifiable Shuffle of Large Size Ciphertexts. Practice and Theory in Public Key Cryptography - PKC 2007, LNCS 4450, pages 377-392.
pdf excel
Jens Groth: Simulation-sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. Advances in Cryptology - ASIACRYPT 2006, LNCS 4284, pages 444-459.
pdf slides (full paper)
Jens Groth, Rafail Ostrovsky and Amit Sahai: Non-interactive Zaps and New Techniques for NIZK. 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. 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. Advances in Cryptology - EUROCRYPT 2006, LNCS 4004, pages 338-359.
pdf slides (full paper)
Jens Groth: Non-interactive Zero-Knowledge Arguments for Voting. Applied Cryptography and Network Security - ACNS 2005, LNCS 3531, pages 467-482.
pdf slides (full paper)
Jens Groth: Cryptography in Subgroups of Zn*. Theory of Cryptography Conference - TCC 2005, LNCS 3378, pages 50-65.
pdf slides (corrected paper)
Jan Camenisch and Jens Groth: Group Signatures: Better Efficiency and New Theoretical Aspects. Security in Communication Networks - SCN 2004, LNCS 3352, pages 120-133.
pdf (full paper)
Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. Applied Cryptography and Network Security - ACNS 2004, LNCS 3089, pages 46-60.
pdf slides (full paper)
Jens Groth: Rerandomizable and Replayable Adaptive Chosen
Ciphertext Attack Secure Cryptosystems. Theory of Cryptography Conference - TCC 2004, LNCS 2951, pages 152-170.
pdf slides
Jens Groth: Efficient Maximal Privacy in Boardroom Voting and Anonymous
Broadcast. Financial Cryptography - FC 2004, LNCS
3110, pages 90-104.
pdf slides
Ivan Damgård and Jens Groth: Non-interactive and Reusable
Non-malleable Commitment Schemes. Symposium on Theory of Computation - STOC 2003, pages 426-437.
pdf slides (corrected paper)
Jens Groth: A Verifiable Secret Shuffle of Homomorphic
Encryptions. Practice and Theory in Public Key Cryptography - PKC 2003, LNCS 2567, pages 145-160.
(see journal version above)
Ivan Damgård, Jens Groth and Gorm Salomonsen: The Theory and
Implementation of an Electronic Voting System. D. Gritzalis
(Ed.), Secure Electronic Voting, Kluwer Academic Publishers, 2002, pages 77-99.
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.
Future: CRYPTO 2012.
Current: PKC 2012, EUROCRYPT 2012.
Past: ACNS 2006, EUROCRYPT 2007, PKC 2008, TCC 2008, SCN 2008, TCC 2009, Pairing 2009, CRYPTO 2009, ASIACRYPT 2009, TCC 2010, AFRICACRYPT 2011, VoteID 2011, ASIACRYPT 2011.