- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c32 |      | Stephanie Bayer, Jens Groth: Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists. EUROCRYPT 2013: 646-663 |
| 2012 | ||
| j3 | | Jens Groth, Rafail Ostrovsky, Amit Sahai: New Techniques for Noninteractive Zero-Knowledge. J. ACM 59(3): 11 (2012) |
| j2 | | Jens Groth, Amit Sahai: Efficient Noninteractive Proof Systems for Bilinear Groups. SIAM J. Comput. 41(5): 1193-1232 (2012) |
| c31 | | Stephanie Bayer, Jens Groth: Efficient Zero-Knowledge Argument for Correctness of a Shuffle. EUROCRYPT 2012: 263-280 |
| 2011 | ||
| c30 | | |
| c29 | | Jens Groth: Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. ASIACRYPT 2011: 431-448 |
| c28 | | Masayuki Abe, Jens Groth, Miyako Ohkubo: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions. ASIACRYPT 2011: 628-646 |
| c27 | | Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. CRYPTO 2011: 649-666 |
| c26 | | |
| i12 | | Jens Groth: Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2011: 12 (2011) |
| 2010 | ||
| j1 | | Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. J. Cryptology 23(4): 546-579 (2010) |
| c25 | | |
| c24 | | |
| c23 | | Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo: Structure-Preserving Signatures and Commitments to Group Elements. CRYPTO 2010: 209-236 |
| c22 | | |
| c21 | | Jens Groth, Aggelos Kiayias, Helger Lipmaa: Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. Public Key Cryptography 2010: 107-123 |
| 2009 | ||
| c20 | | |
| i11 | | Jens Groth: Homomorphic Trapdoor Commitments to Group Elements. IACR Cryptology ePrint Archive 2009: 7 (2009) |
| i10 | | Jens Groth: Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments. IACR Cryptology ePrint Archive 2009: 390 (2009) |
| 2008 | ||
| c19 | | Jens Groth, Yuval Ishai: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. EUROCRYPT 2008: 379-396 |
| c18 | | Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. EUROCRYPT 2008: 415-432 |
| 2007 | ||
| c17 | | Jens Groth, Steve Lu: A Non-interactive Shuffle with Pairing Based Verifiability. ASIACRYPT 2007: 51-67 |
| c16 | | |
| c15 | | |
| c14 | | Nishanth Chandran, Jens Groth, Amit Sahai: Ring Signatures of Sub-linear Size Without Random Oracles. ICALP 2007: 423-434 |
| c13 | | Jens Groth, Steve Lu: Verifiable Shuffle of Large Size Ciphertexts. Public Key Cryptography 2007: 377-392 |
| i9 | | Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. Electronic Colloquium on Computational Complexity (ECCC) 14(053) (2007) |
| i8 | | Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. IACR Cryptology ePrint Archive 2007: 155 (2007) |
| i7 | | Jens Groth: Fully Anonymous Group Signatures without Random Oracles. IACR Cryptology ePrint Archive 2007: 186 (2007) |
| 2006 | ||
| c12 | | Jens Groth: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. ASIACRYPT 2006: 444-459 |
| c11 | | Jens Groth, Rafail Ostrovsky, Amit Sahai: Non-interactive Zaps and New Techniques for NIZK. CRYPTO 2006: 97-111 |
| c10 | | Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-interactive Zero Knowledge for NP. EUROCRYPT 2006: 339-358 |
| c9 | | Douglas Wikström, Jens Groth: An Adaptively Secure Mix-Net Without Erasures. ICALP (2) 2006: 276-287 |
| i6 | | Jens Groth, Rafail Ostrovsky: Cryptography in the Multi-string Model. IACR Cryptology ePrint Archive 2006: 407 (2006) |
| 2005 | ||
| c8 | | |
| c7 | | |
| i5 | | Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-Interactive Zero Knowledge for NP. Electronic Colloquium on Computational Complexity (ECCC)(097) (2005) |
| i4 | | Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. IACR Cryptology ePrint Archive 2005: 246 (2005) |
| i3 | | Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-Interactive Zero Knowledge for NP. IACR Cryptology ePrint Archive 2005: 290 (2005) |
| 2004 | ||
| c6 | | Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. ACNS 2004: 46-60 |
| c5 | | Jens Groth: Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast. Financial Cryptography 2004: 90-104 |
| c4 | | Jan Camenisch, Jens Groth: Group Signatures: Better Efficiency and New Theoretical Aspects. SCN 2004: 120-133 |
| c3 | | Jens Groth: Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems. TCC 2004: 152-170 |
| 2003 | ||
| c2 | | Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. Public Key Cryptography 2003: 145-160 |
| c1 | | Ivan Damgård, Jens Groth: Non-interactive and reusable non-malleable commitment schemes. STOC 2003: 426-437 |
| p1 | | Ivan Damgård, Jens Groth, Gorm Salomonsen: The Theory and Implementation of an Electronic Voting System. Secure Electronic Voting 2003: 77-98 |
| i2 | | Ivan Damgård, Jens Groth: Non-interactive and Reusable Non-malleable Commitment Schemes. IACR Cryptology ePrint Archive 2003: 80 (2003) |
| 2002 | ||
| i1 | | Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. IACR Cryptology ePrint Archive 2002: 2 (2002) |
Data released under the ODC-BY 1.0 license — See also our legal information page