• Publications
  • Influence
Efficient Non-interactive Proof Systems for Bilinear Groups
TLDR
The goal of this paper is to spread the use of non-interactive cryptographic proofs from mainly theoretical purposes to the large class of practical cryptographic protocols based on bilinear groups. Expand
On the Size of Pairing-Based Non-interactive Arguments
  • Jens Groth
  • Computer Science, Mathematics
  • EUROCRYPT
  • 8 May 2016
TLDR
It is shown that linear interactive proofs cannot have a linear decision procedure, and it follows that SNARGs where the prover and verifier use generic asymmetric bilinear group operations cannot consist of a single group element. Expand
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
  • Jens Groth
  • Computer Science
  • ASIACRYPT
  • 3 December 2006
TLDR
This work gets the first group signature scheme satisfying the strong security definition of Bellare, Shi and Zhang in the standard model without random oracles where each group signature consists only of a constant number of group elements. Expand
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
TLDR
A 3-move public coin special honest verifier zero-knowledge proof for a list of commitments having at least one commitment that opens to 0, in particular in terms of communication requiring only the transmission of a logarithmic number of commitments. Expand
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
  • Jens Groth
  • Computer Science
  • ASIACRYPT
  • 5 December 2010
TLDR
This work constructs non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero- knowledge and computational soundness and security is based on two new cryptographic assumptions. Expand
Structure-Preserving Signatures and Commitments to Group Elements
TLDR
This work focuses on schemes in bilinear groups that preserve parts of the group structure, which makes it easy to combine them with other primitives such as non-interactive zero-knowledge proofs for bilinears groups. Expand
Fully Anonymous Group Signatures without Random Oracles
  • Jens Groth
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
  • 2 December 2007
TLDR
A new group signature scheme is constructed using bilinear groups that satisfies strong security requirements, in particular providing protection against key exposures and not relying on random oracles in the security proof. Expand
Group Signatures: Better Efficiency and New Theoretical Aspects
TLDR
This paper improves the state-of-the-art scheme by Ateniese et al. by an order of magnitude and satisfies the recent security definition by Bellare et al, showing that their notion of full-anonymity may require stronger assumptions than what is needed to achieve a relaxed but reasonable notion of anonymity. Expand
A Verifiable Secret Shuffle of Homomorphic Encryptions
  • Jens Groth
  • Computer Science, Mathematics
  • Journal of Cryptology
  • 1 October 2010
TLDR
An honest verifier zero-knowledge argument is suggested for the correctness of a shuffle of homomorphic encryptions based on ElGamal encryption, which is more efficient than previous schemes both in terms of communication and computation. Expand
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
TLDR
An honest verifier zero-knowledge argument for the correctness of a shuffle of homomorphic encryptions that has the lowest computation cost for the verifier compared to previous work and also has an efficient prover. Expand
...
1
2
3
4
5
...