 | 2009 |
|---|
| 22 |       | Jens Groth:
Linear Algebra with Sub-linear Zero-Knowledge Arguments.
CRYPTO 2009: 192-208 |
| 2008 |
|---|
| 21 | | Jens Groth,
Yuval Ishai:
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.
EUROCRYPT 2008: 379-396 |
| 20 | | Jens Groth,
Amit Sahai:
Efficient Non-interactive Proof Systems for Bilinear Groups.
EUROCRYPT 2008: 415-432 |
| 2007 |
|---|
| 19 | | Jens Groth:
Fully Anonymous Group Signatures Without Random Oracles.
ASIACRYPT 2007: 164-180 |
| 18 | | Jens Groth,
Steve Lu:
A Non-interactive Shuffle with Pairing Based Verifiability.
ASIACRYPT 2007: 51-67 |
| 17 | | Jens Groth,
Rafail Ostrovsky:
Cryptography in the Multi-string Model.
CRYPTO 2007: 323-341 |
| 16 | | Nishanth Chandran,
Jens Groth,
Amit Sahai:
Ring Signatures of Sub-linear Size Without Random Oracles.
ICALP 2007: 423-434 |
| 15 | | Jens Groth,
Steve Lu:
Verifiable Shuffle of Large Size Ciphertexts.
Public Key Cryptography 2007: 377-392 |
| 14 | | Jens Groth,
Amit Sahai:
Efficient Non-interactive Proof Systems for Bilinear Groups.
Electronic Colloquium on Computational Complexity (ECCC) 14(053): (2007) |
| 2006 |
|---|
| 13 | | Jens Groth:
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures.
ASIACRYPT 2006: 444-459 |
| 12 | | Jens Groth,
Rafail Ostrovsky,
Amit Sahai:
Non-interactive Zaps and New Techniques for NIZK.
CRYPTO 2006: 97-111 |
| 11 | | Jens Groth,
Rafail Ostrovsky,
Amit Sahai:
Perfect Non-interactive Zero Knowledge for NP.
EUROCRYPT 2006: 339-358 |
| 10 | | Douglas Wikström,
Jens Groth:
An Adaptively Secure Mix-Net Without Erasures.
ICALP (2) 2006: 276-287 |
| 2005 |
|---|
| 9 | | Jens Groth:
Non-interactive Zero-Knowledge Arguments for Voting.
ACNS 2005: 467-482 |
| 8 | | Jens Groth:
Cryptography in Subgroups of Zn.
TCC 2005: 50-65 |
| 7 | | Jens Groth,
Rafail Ostrovsky,
Amit Sahai:
Perfect Non-Interactive Zero Knowledge for NP
Electronic Colloquium on Computational Complexity (ECCC)(097): (2005) |
| 2004 |
|---|
| 6 | | Jens Groth:
Evaluating Security of Voting Schemes in the Universal Composability Framework.
ACNS 2004: 46-60 |
| 5 | | Jens Groth:
Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast.
Financial Cryptography 2004: 90-104 |
| 4 | | Jan Camenisch,
Jens Groth:
Group Signatures: Better Efficiency and New Theoretical Aspects.
SCN 2004: 120-133 |
| 3 | | Jens Groth:
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems.
TCC 2004: 152-170 |
| 2003 |
|---|
| 2 | | Jens Groth:
A Verifiable Secret Shuffle of Homomorphic Encryptions.
Public Key Cryptography 2003: 145-160 |
| 1 | | Ivan Damgård,
Jens Groth:
Non-interactive and reusable non-malleable commitment schemes.
STOC 2003: 426-437 |
