Jens Groth
Artificial Intelligence · 2003–2017
A researcher in the Science corpus: 14 papers; trusts 79 researchers and is trusted by 105 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 162 citations into it; #2,466 of 36,961 by trust here, #5,784 by citations
- Computational Theory and Mathematics — 76 citations into it; #902 of 12,489 by trust here, #1,803 by citations
- Information Systems — 47 citations into it; #237 of 9,233 by trust here, #1,332 by citations
- Computer Networks and Communications — 45 citations into it; #2,827 of 9,996 by trust here, #6,056 by citations
- Privacy & Security — 41 citations into it; #82 of 710 by trust here, #342 by citations
- Computer Vision and Pattern Recognition — 30 citations into it
- Algorithms & Complexity — 11 citations into it
- Discrete Mathematics and Combinatorics — 11 citations into it
Whom Jens Groth trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Pascal Paillier
- Silvio Micali
- Helger Lipmaa
- Dan Boneh
- Mihir Bellare
- Ivan Bjerre Damgård
- Ran Canetti
- Joe Kilian
- Jan Camenisch
- Brent Waters
Who trusts Jens Groth overall
- Srinath T. V. Setty
- Eli Ben-Sasson
- Helger Lipmaa
- Benedikt Bünz
- Justin Thaler
- Riad S. Wahby
- Michael Backes
- Stephanie Bayer
- Melissa Chase
- Allison Bishop
Papers from Jens Groth's perspective
Ordered by how strongly the researchers Jens Groth trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Probabilistic Encryption
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A method for obtaining digital signatures and public-key cryptosystems
- Identity-Based Encryption from the Weil Pairing
- A public key cryptosystem and a signature scheme based on discrete logarithms
- The random oracle methodology, revisited (JACM)
Their papers
- Non-interactive Zaps and New Techniques for NIZK (2006) — 218 citations
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016) — 413 citations
- On the Size of Pairing-Based Non-interactive Arguments (2016) — 1,575 citations
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate (2010) — 226 citations
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008) — 110 citations
- Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability (2017) — 82 citations
- Fine-Tuning Groth-Sahai Proofs (2014) — 73 citations
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle (2012) — 249 citations
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments (2010) — 512 citations
- Structure-Preserving Signatures and Commitments to Group Elements (2010) — 387 citations
- Efficient Noninteractive Proof Systems for Bilinear Groups (2008) — 1,082 citations
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006) — 433 citations
- Non-interactive Zero-Knowledge Arguments for Voting (2005) — 174 citations
- A Verifiable Secret Shuffle of Homomorphic Encryptions (2003) — 203 citations