World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
10439
World Ranking
5606
National Ranking
339

Overview

Jens Groth is affiliated with University College London in the United Kingdom and specializes in research within the field of Computer Science. Their work includes a significant focus on subfields such as Artificial Intelligence, Information Systems, Computer Vision and Pattern Recognition, and Molecular Biology.

The scientist's research spans several topics, prominently including Cryptography and Data Security, Blockchain Technology Applications and Security, Cryptographic Implementations and Security, Chaos-based Image/Signal Encryption, DNA and Biological Computing, User Authentication and Security Systems, and Internet Traffic Analysis and Secure E-voting.

Jens Groth has published multiple papers in various venues. Two recent publications include:

  • Foundations of Fully Dynamic Group Signatures, 2020, Journal of Cryptology
  • Linear-Time Arguments with Sublinear Verification from Tensor Codes, 2020, Lecture notes in computer science

The frequent co-authors of Jens Groth include Victor Shoup, Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, and Essam Ghadafi.

Publishing venues where Jens Groth frequently appears include the Journal of Cryptology and Lecture notes in computer science. Their contributions mainly address core issues in security, encryption, and cryptographic protocols within computer science.

Best Publications

  • On the Size of Pairing-Based Non-interactive Arguments

    Jens Groth

  • Efficient non-interactive proof systems for bilinear groups

    Jens Groth;Amit Sahai

  • Short Pairing-Based Non-interactive Zero-Knowledge Arguments

    Jens Groth

  • Simulation-sound NIZK proofs for a practical language and constant size group signatures

    Jens Groth

  • Perfect non-interactive zero knowledge for NP

    Jens Groth;Rafail Ostrovsky;Amit Sahai

  • Structure-preserving signatures and commitments to group elements

    Masayuki Abe;Georg Fuchsbauer;Jens Groth;Kristiyan Haralambiev

  • Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

    Jonathan Bootle;Andrea Cerulli;Pyrros Chaidos;Jens Groth

  • Group signatures: better efficiency and new theoretical aspects

    Jan Camenisch;Jens Groth

  • Fully anonymous group signatures without random oracles

    Jens Groth

  • Efficient zero-knowledge argument for correctness of a shuffle

    Stephanie Bayer;Jens Groth

  • Non-interactive zaps and new techniques for NIZK

    Jens Groth;Rafail Ostrovsky;Amit Sahai

  • One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin

    Jens Groth;Markulf Kohlweiss

  • Multi-query computationally-private information retrieval with constant communication rate

    Jens Groth;Aggelos Kiayias;Helger Lipmaa

  • New Techniques for Noninteractive Zero-Knowledge

    Jens Groth;Rafail Ostrovsky;Amit Sahai

  • Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs

    Jens Groth;Mary Maller

  • Updatable and universal common reference strings with applications to zk-SNARKs

    Jens Groth;Markulf Kohlweiss;Markulf Kohlweiss;Mary Maller;Mary Maller;Sarah Meiklejohn

  • Non-interactive zero-knowledge arguments for voting

    Jens Groth

  • Efficient Noninteractive Proof Systems for Bilinear Groups

    Jens Groth;Amit Sahai

  • Optimal structure-preserving signatures in asymmetric bilinear groups

    Masayuki Abe;Jens Groth;Kristiyan Haralambiev;Miyako Ohkubo

  • Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast

    Jens Groth;Jens Groth

  • A Verifiable Secret Shuffle of Homomorphic Encryptions

    Jens Groth;Jens Groth

  • Structure-Preserving Signatures and Commitments to Group Elements

    Masayuki Abe;Georg Fuchsbauer;Jens Groth;Kristiyan Haralambiev

Frequent Co-Authors

Amit Sahai
Amit Sahai University of California, Los Angeles
Masayuki Abe
Masayuki Abe Kyoto University
Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles
Markulf Kohlweiss
Markulf Kohlweiss University of Edinburgh
Mehdi Tibouchi
Mehdi Tibouchi NTT (Japan)
Ivan Damgård
Ivan Damgård Aarhus University
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Alessandro Chiesa
Alessandro Chiesa École Polytechnique Fédérale de Lausanne
George Danezis
George Danezis University College London

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As technology evolves, students exploring computer science in the USA have more flexible choices than ever. Many reputable institutions now offer online courses and degrees, making it easier to balance studies, work, and personal obligations.

Students interested in broadening their expertise can consider an online bachelor's degree in physics. This foundational science complements computer science by helping you develop analytical and problem-solving skills.

For those aiming at the intersection of tech and business, pursuing the cheapest data science masters in usa is a smart way to gain in-demand skills in fields like analytics and machine learning. Likewise, engineering-minded learners may be interested in the best online electrical engineering programs USA to dive deeper into hardware, circuits, or embedded systems.

Not every career requires a lengthy or costly degree. If you’re seeking faster entry into the tech world, look into easy certifications to get online. Certifications can validate specialized skills with less time or expense, making them a practical pathway for job seekers.

Best Scientists Citing Jens Groth

Trending Scientists

Recently Published Articles