World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
51
Citations
7906
World Ranking
5430
National Ranking
110

Overview

Hoeteck Wee is affiliated with the École Normale Supérieure in France. Their research primarily spans the field of Computer Science, with significant contributions to several subfields including Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computer Networks and Communications, and Computer Vision and Pattern Recognition.

The scientist's work is predominantly centered on topics such as Cryptography and Data Security, Complexity and Algorithms in Graphs, Privacy-Preserving Technologies in Data, Cryptographic Implementations and Security, Internet Traffic Analysis and Secure E-voting, Security in Wireless Sensor Networks, and Coding Theory and Cryptography.

Hoeteck Wee has published extensively in various distinguished venues. Frequent publication venues include:

  • arXiv (Cornell University)
  • Lecture notes in computer science
  • Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Theory of Computing

Among recent notable papers are:

  • FABEO, 2022, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions, 2020, arXiv (Cornell University)
  • One-One Constrained Pseudorandom Functions, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More, 2020, Lecture notes in computer science
  • Unnamed paper, 2020, Theory of Computing

The scientist often collaborates with other researchers. Frequent co-authors include:

  • David J. Wu
  • Daniel Wichs
  • Valerio Cini
  • Iftach Haitner
  • Omer Reingold

Best Publications

  • Attribute-based encryption for circuits

    Sergey Gorbunov;Vinod Vaikuntanathan;Hoeteck Wee

  • Toward privacy in public databases

    Shuchi Chawla;Cynthia Dwork;Frank McSherry;Adam Smith

  • On Obfuscating Point Functions.

    Hoeteck Wee

  • Functional Encryption with Bounded Collusions via Multi-party Computation

    Sergey Gorbunov;Vinod Vaikuntanathan;Hoeteck Wee

  • Fully, (Almost) Tightly Secure IBE and Dual System Groups

    Jie Chen;Hoeteck Wee

  • On the Security of the TLS Protocol: A Systematic Analysis

    Hugo Krawczyk;Kenneth G. Paterson;Hoeteck Wee

  • Predicate Encryption for Circuits from LWE

    Sergey Gorbunov;Vinod Vaikuntanathan;Hoeteck Wee

  • Improved Dual System ABE in Prime-Order Groups via Predicate Encodings

    Jie Chen;Hoeteck Wee

  • Selfish caching in distributed systems: a game-theoretic analysis

    Byung-Gon Chun;Kamalika Chaudhuri;Hoeteck Wee;Marco Barreno

  • Functional Encryption: New Perspectives and Lower Bounds

    Shweta Agrawal;Sergey Gorbunov;Vinod Vaikuntanathan;Hoeteck Wee

  • Dual System Encryption via Predicate Encodings.

    Hoeteck Wee

  • Functional encryption for threshold functions (or fuzzy IBE) from lattices

    Shweta Agrawal;Xavier Boyen;Vinod Vaikuntanathan;Panagiotis Voulgaris

  • Multi-input Inner-Product Functional Encryption from Pairings

    Michel Abdalla;Mariana Raykova;Hoeteck Wee

  • Pebbling and proofs of work

    Cynthia Dwork;Moni Naor;Hoeteck Wee

  • Quasi-Adaptive NIZK for Linear Subspaces Revisited.

    Eike Kiltz;Hoeteck Wee

  • Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

    Hoeteck Wee

  • The OPTLS Protocol and TLS 1.3

    Hugo Krawczyk;Hoeteck Wee

  • Black-Box Constructions of Two-Party Protocols from One-Way Functions

    Rafael Pass;Hoeteck Wee

  • Partial Garbling Schemes and Their Applications

    Yuval Ishai;Hoeteck Wee

  • Public key encryption against related key attacks

    Hoeteck Wee

  • Tightly CCA-Secure Encryption Without Pairings

    Dennis Hofheinz;Eike Kiltz;Hoeteck Wee

Frequent Co-Authors

Tal Malkin
Tal Malkin Columbia University
Salil P. Vadhan
Salil P. Vadhan Harvard University
Daniel Wichs
Daniel Wichs Northeastern University
Omer Reingold
Omer Reingold Stanford University
Eike Kiltz
Eike Kiltz Ruhr University Bochum
Michel Abdalla
Michel Abdalla École Normale Supérieure
Benoît Libert
Benoît Libert École Normale Supérieure de Lyon

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

Exploring related online degrees can help you tailor your Computer Science journey to fit your timeline and career goals. For those seeking a rapid path to advancement, consider one of the shortest masters degree programs, which may allow you to complete your studies in as little as one year.

Looking for the best return on your investment? Some of the most useful graduate degrees are in high demand fields like data science, cybersecurity, and artificial intelligence. These specializations can open doors to lucrative roles across the tech industry.

If you’re just starting out, an online associate's degree in Computer Science can be a flexible and affordable way to build foundational skills. Many students use this credential as a stepping stone to a bachelor’s degree or to enter tech support and junior developer positions.

Affordability is a key concern for many learners. Fortunately, there are affordable online degree programs available that combine quality instruction with lower tuition, helping you minimize debt while maximizing future opportunities.

Best Scientists Citing Hoeteck Wee

Trending Scientists

Recently Published Articles