Hoeteck Wee

According to our database1, Hoeteck Wee authored at least 107 papers between 2003 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Succinct LWE Sampling, Random Polynomials, and Obfuscation.
IACR Cryptol. ePrint Arch., 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

Candidate Obfuscation via Oblivious LWE Sampling.
IACR Cryptol. ePrint Arch., 2020

Functional Encryption for Quadratic Functions from k-Lin, Revisited.
IACR Cryptol. ePrint Arch., 2020

One-One Constrained Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2020

Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More.
IACR Cryptol. ePrint Arch., 2020

New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More.
IACR Cryptol. ePrint Arch., 2020

Pointproofs: Aggregating Proofs for Multiple Vector Commitments.
IACR Cryptol. ePrint Arch., 2020

Adaptively Secure ABE for DFA from k-Lin and More.
IACR Cryptol. ePrint Arch., 2020

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions.
IACR Cryptol. ePrint Arch., 2020

Functional Encryption for Attribute-Weighted Sums from k-Lin.
IACR Cryptol. ePrint Arch., 2020

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions.
CoRR, 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

ABE for DFA from k-Lin.
IACR Cryptol. ePrint Arch., 2019

Pixel: Multi-signatures for Consensus.
IACR Cryptol. ePrint Arch., 2019

Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation.
IACR Cryptol. ePrint Arch., 2019

Obfuscating simple functionalities from knowledge assumptions.
IACR Cryptol. ePrint Arch., 2019

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

2018
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption.
J. Cryptol., 2018

Laconic Function Evaluation and Applications.
IACR Cryptol. ePrint Arch., 2018

Tight Adaptively Secure Broadcast Encryption with Short Ciphertexts and Keys.
IACR Cryptol. ePrint Arch., 2018

Traitor-Tracing from LWE Made Simple and Attribute-Based.
IACR Cryptol. ePrint Arch., 2018

GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates.
IACR Cryptol. ePrint Arch., 2018

Improved Inner-product Encryption with Adaptive Security and Full Attribute-hiding.
IACR Cryptol. ePrint Arch., 2018

On the Inner Product Predicate and a Generalization of Matching Vector Families.
IACR Cryptol. ePrint Arch., 2018

Unbounded ABE via Bilinear Entropy Expansion, Revisited.
IACR Cryptol. ePrint Arch., 2018

Improved, black-box, non-malleable encryption from semantic security.
Des. Codes Cryptogr., 2018

2017
Towards Breaking the Exponential Barrier for General Secret Sharing.
IACR Cryptol. ePrint Arch., 2017

Private Constrained PRFs (and More) from LWE.
IACR Cryptol. ePrint Arch., 2017

Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions.
IACR Cryptol. ePrint Arch., 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

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

2016
Leakage-Resilient Cryptography from Minimal Assumptions.
J. Cryptol., 2016

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

Targeted Homomorphic Attribute Based Encryption.
IACR Cryptol. ePrint Arch., 2016

FHE Circuit Privacy Almost For Free.
IACR Cryptol. ePrint Arch., 2016

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

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

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

Advances in Functional Encryption.
, 2016

2015
Attribute-Based Encryption for Circuits.
J. ACM, 2015

Déjà Q: Encore! Un Petit IBE.
IACR Cryptol. ePrint Arch., 2015

KDM-Security via Homomorphic Smooth Projective Hashing.
IACR Cryptol. ePrint Arch., 2015

Dual System Encryption via Predicate Encodings.
IACR Cryptol. ePrint Arch., 2015

Security Against Related Randomness Attacks via Reconstructive Extractors.
IACR Cryptol. ePrint Arch., 2015

The OPTLS Protocol and TLS 1.3.
IACR Cryptol. ePrint Arch., 2015

Quasi-Adaptive NIZK for Linear Subspaces Revisited.
IACR Cryptol. ePrint Arch., 2015

Structure-Preserving Signatures from Standard Assumptions, Revisited.
IACR Cryptol. ePrint Arch., 2015

Predicate Encryption for Circuits from LWE.
IACR Cryptol. ePrint Arch., 2015

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2015

Improved Dual System ABE in Prime-Order Groups via Predicate Encodings.
IACR Cryptol. ePrint Arch., 2015

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting.
IACR Cryptol. ePrint Arch., 2015

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

Partial Garbling Schemes and Their Applications.
IACR Cryptol. ePrint Arch., 2014

Predicate Encryption for Multi-Dimensional Range Queries from Lattices.
IACR Cryptol. ePrint Arch., 2014

Semi-Adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula.
IACR Cryptol. ePrint Arch., 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

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

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

2013
On the Security of the TLS Protocol: A Systematic Analysis.
IACR Cryptol. ePrint Arch., 2013

Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
IACR Cryptol. ePrint Arch., 2013

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

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

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

Functional Encryption with Bounded Collusions via Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2012

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
IACR Cryptol. ePrint Arch., 2012

Shorter IBE and Signatures via Asymmetric Pairings.
IACR Cryptol. ePrint Arch., 2012

Functional Encryption: New Perspectives and Lower Bounds.
IACR Cryptol. ePrint Arch., 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

Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More.
Proceedings of the Advances in Cryptology - EUROCRYPT 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
Universal One-Way Hash Functions via Inaccessible Entropy.
IACR Cryptol. ePrint Arch., 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

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
Optimal Cryptographic Hardness of Learning Monotone Functions.
Theory Comput., 2009

Inaccessible Entropy.
Electron. Colloquium Comput. Complex., 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

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

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 Obfuscating Point Functions.
IACR Cryptol. ePrint Arch., 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 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...