Jens Groth

	2012
45		Stephanie Bayer, Jens Groth: Efficient Zero-Knowledge Argument for Correctness of a Shuffle. EUROCRYPT 2012: 263-280
	2011
44		Jens Groth: Efficient Zero-Knowledge Proofs. AFRICACRYPT 2011: 379
43		Jens Groth: Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. ASIACRYPT 2011: 431-448
42		Masayuki Abe, Jens Groth, Miyako Ohkubo: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions. ASIACRYPT 2011: 628-646
41		Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. CRYPTO 2011: 649-666
40		Jens Groth: Optimal Structure-Preserving Signatures. ProvSec 2011: 1
39		Jens Groth: Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2011: 12 (2011)
	2010
38		Jens Groth: Short Pairing-Based Non-interactive Zero-Knowledge Arguments. ASIACRYPT 2010: 321-340
37		Jens Groth: Short Non-interactive Zero-Knowledge Proofs. ASIACRYPT 2010: 341-358
36		Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo: Structure-Preserving Signatures and Commitments to Group Elements. CRYPTO 2010: 209-236
35		Jens Groth: Pairing-Based Non-interactive Zero-Knowledge Proofs. Pairing 2010: 206
34		Jens Groth, Aggelos Kiayias, Helger Lipmaa: Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. Public Key Cryptography 2010: 107-123
33		Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. J. Cryptology 23(4): 546-579 (2010)
	2009
32		Jens Groth: Linear Algebra with Sub-linear Zero-Knowledge Arguments. CRYPTO 2009: 192-208
31		Jens Groth: Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments. IACR Cryptology ePrint Archive 2009: 390 (2009)
30		Jens Groth: Homomorphic Trapdoor Commitments to Group Elements. IACR Cryptology ePrint Archive 2009: 7 (2009)
	2008
29		Jens Groth, Yuval Ishai: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. EUROCRYPT 2008: 379-396
28		Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. EUROCRYPT 2008: 415-432
	2007
27		Jens Groth: Fully Anonymous Group Signatures Without Random Oracles. ASIACRYPT 2007: 164-180
26		Jens Groth, Steve Lu: A Non-interactive Shuffle with Pairing Based Verifiability. ASIACRYPT 2007: 51-67
25		Jens Groth, Rafail Ostrovsky: Cryptography in the Multi-string Model. CRYPTO 2007: 323-341
24		Nishanth Chandran, Jens Groth, Amit Sahai: Ring Signatures of Sub-linear Size Without Random Oracles. ICALP 2007: 423-434
23		Jens Groth, Steve Lu: Verifiable Shuffle of Large Size Ciphertexts. Public Key Cryptography 2007: 377-392
22		Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. Electronic Colloquium on Computational Complexity (ECCC) 14(053): (2007)
21		Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. IACR Cryptology ePrint Archive 2007: 155 (2007)
20		Jens Groth: Fully Anonymous Group Signatures without Random Oracles. IACR Cryptology ePrint Archive 2007: 186 (2007)
	2006
19		Jens Groth: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. ASIACRYPT 2006: 444-459
18		Jens Groth, Rafail Ostrovsky, Amit Sahai: Non-interactive Zaps and New Techniques for NIZK. CRYPTO 2006: 97-111
17		Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-interactive Zero Knowledge for NP. EUROCRYPT 2006: 339-358
16		Douglas Wikström, Jens Groth: An Adaptively Secure Mix-Net Without Erasures. ICALP (2) 2006: 276-287
15		Jens Groth, Rafail Ostrovsky: Cryptography in the Multi-string Model. IACR Cryptology ePrint Archive 2006: 407 (2006)
	2005
14		Jens Groth: Non-interactive Zero-Knowledge Arguments for Voting. ACNS 2005: 467-482
13		Jens Groth: Cryptography in Subgroups of Zn. TCC 2005: 50-65
12		Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-Interactive Zero Knowledge for NP Electronic Colloquium on Computational Complexity (ECCC)(097): (2005)
11		Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. IACR Cryptology ePrint Archive 2005: 246 (2005)
10		Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-Interactive Zero Knowledge for NP. IACR Cryptology ePrint Archive 2005: 290 (2005)
	2004
9		Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. ACNS 2004: 46-60
8		Jens Groth: Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast. Financial Cryptography 2004: 90-104
7		Jan Camenisch, Jens Groth: Group Signatures: Better Efficiency and New Theoretical Aspects. SCN 2004: 120-133
6		Jens Groth: Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems. TCC 2004: 152-170
	2003
5		Jens Groth: A Verifiable Secret Shuffle of Homomorphic Encryptions. Public Key Cryptography 2003: 145-160
4		Ivan Damgård, Jens Groth: Non-interactive and reusable non-malleable commitment schemes. STOC 2003: 426-437
3		Ivan Damgård, Jens Groth, Gorm Salomonsen: The Theory and Implementation of an Electronic Voting System. Secure Electronic Voting 2003: 77-98
2		Ivan Damgård, Jens Groth: Non-interactive and Reusable Non-malleable Commitment Schemes. IACR Cryptology ePrint Archive 2003: 80 (2003)
	2002
1		Jens Groth: Evaluating Security of Voting Schemes in the Universal Composability Framework. IACR Cryptology ePrint Archive 2002: 2 (2002)

Coauthor Index

1	Masayuki Abe	[36] [41] [42]
2	Stephanie Bayer	[45]
3	Jan Camenisch	[7]
4	Nishanth Chandran	[24]
5	Ivan Damgård (Ivan Bjerre Damgård)	[2] [3] [4]
6	Georg Fuchsbauer	[36]
7	Kristiyan Haralambiev	[36] [41]
8	Yuval Ishai	[29]
9	Aggelos Kiayias	[34]
10	Helger Lipmaa	[34]
11	Steve Lu	[23] [26]
12	Miyako Ohkubo	[36] [41] [42]
13	Rafail Ostrovsky	[10] [12] [15] [17] [18] [25]
14	Amit Sahai	[10] [12] [17] [18] [21] [22] [24] [28]
15	Gorm Salomonsen	[3]
16	Douglas Wikström	[16]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page