Search the dblp DataBase

Publications of Author

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