Hoeteck Wee

According to our database1, Hoeteck Wee authored at least 131 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Broadcast Encryption with Size N^1/3 and More from k-Lin.
IACR Cryptol. ePrint Arch., 2025

Almost Optimal KP and CP-ABE for Circuits from Succinct LWE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

New Techniques for Preimage Sampling: Improved NIZKs and More from LWE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Faster ABE for Turing Machines from Circular Evasive LWE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Unbounded Distributed Broadcast Encryption and Registered ABE from Succinct LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Functional Commitments and SNARGs for P/poly from SIS.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Succinct Functional Commitments for Circuits from k-Lin.
IACR Cryptol. ePrint Arch., 2024

Circuit ABE with poly(depth, λ)-sized Ciphertexts and Keys from Lattices.
IACR Cryptol. ePrint Arch., 2024

Succinct Functional Commitments for Circuits from k-sfLin.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Circuit ABE with sfpoly( depth,λ )-Sized Ciphertexts and Keys from Lattices.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Unbounded ABE for Circuits from LWE, Revisited.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Traitor Tracing with N^(1/3)-size Ciphertexts and O(1)-size Keys from k-Lin.
IACR Cryptol. ePrint Arch., 2023

ABE for Circuits with poly (λ) -sized Keys from LWE.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Succinct Vector, Polynomial, and Functional Commitments from Lattices.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Traitor Tracing with N<sup>1/3</sup>-Size Ciphertexts and O(1)-Size Keys from k-Lin.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

Distributed Broadcast Encryption from Bilinear Groups.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Multi-authority ABE from Lattices Without Random Oracles.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

FABEO: Fast Attribute-Based Encryption with Optimal Security.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Witness Encryption and Null-IO from Evasive LWE.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
ABE for DFA from LWE Against Bounded Collusions, Revisited.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Succinct LWE Sampling, Random Polynomials, and Obfuscation.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Candidate Obfuscation via Oblivious LWE Sampling.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Broadcast Encryption with Size N<sup>1/3</sup> and More from k-Lin.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.
Theory Comput., 2020

Compact Adaptively Secure ABE for sf NC<sup>1</sup> from k-Lin.
J. Cryptol., 2020

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions.
CoRR, 2020

Pixel: Multi-signatures for Consensus.
Proceedings of the 29th USENIX Security Symposium, 2020

Functional Encryption for Quadratic Functions from k-Lin, Revisited.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

One-One Constrained Pseudorandom Functions.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Adaptively Secure ABE for DFA from k-Lin and More.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Functional Encryption for Attribute-Weighted Sums from k-Lin.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Pointproofs: Aggregating Proofs for Multiple Vector Commitments.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Compact Adaptively Secure ABE for NC1 from k-Lin.
IACR Cryptol. ePrint Arch., 2019

Digital Signatures for Consensus.
IACR Cryptol. ePrint Arch., 2019

Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Obfuscating Simple Functionalities from Knowledge Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Compact Adaptively Secure ABE for \mathsf NC^1 from k-Lin.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

ABE for DFA from k-Lin.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Traitor-Tracing from LWE Made Simple and Attribute-Based.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Tight Adaptively Secure Broadcast Encryption with Short Ciphertexts and Keys.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

On the Inner Product Predicate and a Generalization of Matching Vector Families.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Laconic Function Evaluation and Applications.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Towards Breaking the Exponential Barrier for General Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Unbounded ABE via Bilinear Entropy Expansion, Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Improved Inner-Product Encryption with Adaptive Security and Full Attribute-Hiding.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
New Protocols for Conditional Disclosure of Secrets (and More).
Electron. Colloquium Comput. Complex., 2017

Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Private Constrained PRFs (and More) from LWE.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Multi-input Inner-Product Functional Encryption from Pairings.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Conditional Disclosure of Secrets via Non-linear Reconstruction.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Tightly Secure CCA-Secure Encryption without Pairings.
IACR Cryptol. ePrint Arch., 2016

Improved, Black-Box, Non-Malleable Encryption from Semantic Security.
IACR Cryptol. ePrint Arch., 2016

A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption.
IACR Cryptol. ePrint Arch., 2016

Multi-Input Inner-Product Functional Encryption from Pairings.
IACR Cryptol. ePrint Arch., 2016

Déjà Q: Encore! Un Petit IBE.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Targeted Homomorphic Attribute-Based Encryption.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

KDM-Security via Homomorphic Smooth Projective Hashing.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Obfuscating Conjunctions under Entropic Ring LWE.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

The OPTLS Protocol and TLS 1.3.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

Tightly CCA-Secure Encryption Without Pairings.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

FHE Circuit Privacy Almost for Free.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Advances in Functional Encryption.
, 2016

2015
Predicate Encryption for Multi-dimensional Range Queries from Lattices.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Security Against Related Randomness Attacks via Reconstructive Extractors.
Proceedings of the Cryptography and Coding - 15th IMA International Conference, 2015

Quasi-Adaptive NIZK for Linear Subspaces Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Improved Dual System ABE in Prime-Order Groups via Predicate Encodings.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Structure-Preserving Signatures from Standard Assumptions, Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Predicate Encryption for Circuits from LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Doubly spatial encryption from DBDH.
Theor. Comput. Sci., 2014

Dual System Groups and its Applications - Compact HIBE and More.
IACR Cryptol. ePrint Arch., 2014

Shorter identity-based encryption via asymmetric pairings.
Des. Codes Cryptogr., 2014

Dual System Encryption via Predicate Encodings.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Functional Encryption and Its Impact on Cryptography.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Partial Garbling Schemes and Their Applications.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Complexity of UC Commitments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Fully, (Almost) Tightly Secure IBE from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2013

Attribute-based encryption for circuits.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Leakage-Resilient Cryptography from Minimal Assumptions.
Proceedings of the Advances in Cryptology, 2013

Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
Proceedings of the Advances in Cryptology, 2013

On the Security of the TLS Protocol: A Systematic Analysis.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Fully, (Almost) Tightly Secure IBE and Dual System Groups.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Functional Encryption: New Perspectives and Lower Bounds.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Lossy trapdoor functions from homomorphic reproducible encryption.
Inf. Process. Lett., 2012

Public Key Encryption against Related Key Attacks.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Efficient Password Authenticated Key Exchange via Oblivious Transfer.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Shorter IBE and Signatures via Asymmetric Pairings.
Proceedings of the Pairing-Based Cryptography - Pairing 2012, 2012

Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Functional Encryption with Bounded Collusions via Multi-party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
Fuzzy Identity Based Encryption from Lattices.
IACR Cryptol. ePrint Arch., 2011

Threshold and Revocation Cryptosystems via Extractable Hash Proofs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

2010
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.
Proceedings of the Progress in Cryptology, 2010

Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Universal One-Way Hash Functions via Inaccessible Entropy.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Efficient Chosen-Ciphertext Security via Extractable Hash Proofs.
Proceedings of the Advances in Cryptology, 2010

2009
Black-Box Constructions of Two-Party Protocols from One-Way Functions.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Simple, Black-Box Constructions of Adaptively Secure Protocols.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Inaccessible entropy.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Zero Knowledge in the Random Oracle Model, Revisited.
Proceedings of the Advances in Cryptology, 2009

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.
Proceedings of the Advances in Cryptology, 2009

2008
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Optimal Cryptographic Hardness of Learning Monotone Functions.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Lower Bounds for Non-interactive Zero-Knowledge.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Amplifying Collision Resistance: A Complexity-Theoretic Treatment.
Proceedings of the Advances in Cryptology, 2007

2006
Finding Pessiland.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

2005
On Hardness Amplification of One-Way Functions.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Toward Privacy in Public Databases.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

On obfuscating point functions.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On Round-Efficient Argument Systems.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Pebbling and Proofs of Work.
Proceedings of the Advances in Cryptology, 2005

More on Noncommutative Polynomial Identity Testing.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004
Selfish caching in distributed systems: a game-theoretic analysis.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

On Pseudoentropy versus Compressibility.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.
Proceedings of the Approximation, 2004

2003
Compressibility Lower Bounds in Oracle Settings
Electron. Colloquium Comput. Complex., 2003


  Loading...