default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoeteck Wee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c103]Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. CRYPTO (3) 2024: 107-142- [c102]Hoeteck Wee:
Circuit ABE with sfpoly( depth,λ )-Sized Ciphertexts and Keys from Lattices. CRYPTO (3) 2024: 178-209 - [c101]Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee:
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup. CRYPTO (10) 2024: 207-242 - [c100]Hoeteck Wee, David J. Wu:
Succinct Functional Commitments for Circuits from k-sfLin. EUROCRYPT (2) 2024: 280-310 - [i83]Hoeteck Wee, David J. Wu:
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis. IACR Cryptol. ePrint Arch. 2024: 28 (2024) - [i82]Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee:
Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup. IACR Cryptol. ePrint Arch. 2024: 281 (2024) - [i81]Hoeteck Wee, David J. Wu:
Succinct Functional Commitments for Circuits from k-Lin. IACR Cryptol. ePrint Arch. 2024: 688 (2024) - [i80]Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. IACR Cryptol. ePrint Arch. 2024: 897 (2024) - [i79]Brent Waters, Hoeteck Wee, David J. Wu:
New Techniques for Preimage Sampling: Improved NIZKs and More from LWE. IACR Cryptol. ePrint Arch. 2024: 1401 (2024) - [i78]Hoeteck Wee:
Circuit ABE with poly(depth, λ)-sized Ciphertexts and Keys from Lattices. IACR Cryptol. ePrint Arch. 2024: 1416 (2024) - [i77]Valerio Cini, Hoeteck Wee:
Unbounded ABE for Circuits from LWE, Revisited. IACR Cryptol. ePrint Arch. 2024: 1507 (2024) - [i76]Valerio Cini, Hoeteck Wee:
ABE for Circuits with poly(λ)-sized Keys from LWE. IACR Cryptol. ePrint Arch. 2024: 1780 (2024) - 2023
- [c99]Hoeteck Wee, David J. Wu:
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis. ASIACRYPT (5) 2023: 201-235 - [c98]Dimitris Kolonelos, Giulio Malavolta
, Hoeteck Wee:
Distributed Broadcast Encryption from Bilinear Groups. ASIACRYPT (5) 2023: 407-441 - [c97]Hoeteck Wee, David J. Wu:
Succinct Vector, Polynomial, and Functional Commitments from Lattices. EUROCRYPT (3) 2023: 385-416 - [c96]Junqing Gong, Ji Luo, Hoeteck Wee:
Traitor Tracing with N1/3-Size Ciphertexts and O(1)-Size Keys from k-Lin. EUROCRYPT (3) 2023: 637-668 - [c95]Valerio Cini, Hoeteck Wee:
ABE for Circuits with poly (λ) -sized Keys from LWE. FOCS 2023: 435-446 - [e4]Guy N. Rothblum, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14369, Springer 2023, ISBN 978-3-031-48614-2 [contents] - [e3]Guy N. Rothblum, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14370, Springer 2023, ISBN 978-3-031-48617-3 [contents] - [e2]Guy N. Rothblum, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part III. Lecture Notes in Computer Science 14371, Springer 2023, ISBN 978-3-031-48620-3 [contents] - [e1]Guy N. Rothblum, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV. Lecture Notes in Computer Science 14372, Springer 2023, ISBN 978-3-031-48623-4 [contents] - [i75]Junqing Gong, Ji Luo, Hoeteck Wee:
Traitor Tracing with N^(1/3)-size Ciphertexts and O(1)-size Keys from k-Lin. IACR Cryptol. ePrint Arch. 2023: 256 (2023) - [i74]Dimitris Kolonelos, Giulio Malavolta, Hoeteck Wee:
Distributed Broadcast Encryption from Bilinear Groups. IACR Cryptol. ePrint Arch. 2023: 874 (2023) - [i73]Hoeteck Wee:
Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions. IACR Cryptol. ePrint Arch. 2023: 906 (2023) - 2022
- [c94]Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Witness Encryption and Null-IO from Evasive LWE. ASIACRYPT (1) 2022: 195-221 - [c93]Doreen Riepel, Hoeteck Wee:
FABEO: Fast Attribute-Based Encryption with Optimal Security. CCS 2022: 2491-2504 - [c92]Hoeteck Wee:
Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions. EUROCRYPT (2) 2022: 217-241 - [c91]Brent Waters, Hoeteck Wee, David J. Wu:
Multi-authority ABE from Lattices Without Random Oracles. TCC (1) 2022: 651-679 - [i72]Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Witness Encryption and Null-IO from Evasive LWE. IACR Cryptol. ePrint Arch. 2022: 1140 (2022) - [i71]Brent Waters, Hoeteck Wee, David J. Wu:
Multi-Authority ABE from Lattices without Random Oracles. IACR Cryptol. ePrint Arch. 2022: 1194 (2022) - [i70]Hoeteck Wee:
ABE for DFA from LWE against Bounded Collusions, Revisited. IACR Cryptol. ePrint Arch. 2022: 1348 (2022) - [i69]Doreen Riepel, Hoeteck Wee:
FABEO: Fast Attribute-Based Encryption with Optimal Security. IACR Cryptol. ePrint Arch. 2022: 1415 (2022) - [i68]Hoeteck Wee, David J. Wu:
Succinct Vector, Polynomial, and Functional Commitments from Lattices. IACR Cryptol. ePrint Arch. 2022: 1515 (2022) - 2021
- [c90]Hoeteck Wee:
Broadcast Encryption with Size N1/3 and More from k-Lin. CRYPTO (4) 2021: 155-178 - [c89]Hoeteck Wee, Daniel Wichs:
Candidate Obfuscation via Oblivious LWE Sampling. EUROCRYPT (3) 2021: 127-156 - [c88]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. TCC (2) 2021: 256-287 - [c87]Hoeteck Wee:
ABE for DFA from LWE Against Bounded Collusions, Revisited. TCC (2) 2021: 288-309 - [i67]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR abs/2105.01459 (2021) - [i66]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. IACR Cryptol. ePrint Arch. 2021: 1226 (2021) - 2020
- [j10]Lucas Kowalczyk, Hoeteck Wee:
Compact Adaptively Secure ABE for sf NC1 from k-Lin. J. Cryptol. 33(3): 954-1002 (2020) - [j9]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16: 1-55 (2020) - [c86]Sergey Gorbunov, Leonid Reyzin, Hoeteck Wee, Zhenfei Zhang:
Pointproofs: Aggregating Proofs for Multiple Vector Commitments. CCS 2020: 2007-2023 - [c85]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. CRYPTO (1) 2020: 157-186 - [c84]Michel Abdalla, Junqing Gong, Hoeteck Wee:
Functional Encryption for Attribute-Weighted Sums from k-Lin. CRYPTO (1) 2020: 685-716 - [c83]Junqing Gong, Hoeteck Wee:
Adaptively Secure ABE for DFA from k-Lin and More. EUROCRYPT (3) 2020: 278-308 - [c82]Benoît Libert, Alain Passelègue, Hoeteck Wee, David J. Wu:
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More. EUROCRYPT (3) 2020: 410-441 - [c81]Naty Peter, Rotem Tsabary, Hoeteck Wee:
One-One Constrained Pseudorandom Functions. ITC 2020: 13:1-13:22 - [c80]Hoeteck Wee:
Functional Encryption for Quadratic Functions from k-Lin, Revisited. TCC (1) 2020: 210-228 - [c79]Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More. TCC (2) 2020: 502-531 - [c78]Manu Drijvers, Sergey Gorbunov, Gregory Neven, Hoeteck Wee:
Pixel: Multi-signatures for Consensus. USENIX Security Symposium 2020: 2093-2110 - [i65]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR abs/2010.05586 (2020) - [i64]Junqing Gong, Hoeteck Wee:
Adaptively Secure ABE for DFA from k-Lin and More. IACR Cryptol. ePrint Arch. 2020: 194 (2020) - [i63]Benoît Libert, Alain Passelègue, Hoeteck Wee, David J. Wu:
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More. IACR Cryptol. ePrint Arch. 2020: 265 (2020) - [i62]Sergey Gorbunov, Leonid Reyzin, Hoeteck Wee, Zhenfei Zhang:
Pointproofs: Aggregating Proofs for Multiple Vector Commitments. IACR Cryptol. ePrint Arch. 2020: 419 (2020) - [i61]Naty Peter, Rotem Tsabary, Hoeteck Wee:
One-One Constrained Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2020: 714 (2020) - [i60]Michel Abdalla, Junqing Gong, Hoeteck Wee:
Functional Encryption for Attribute-Weighted Sums from k-Lin. IACR Cryptol. ePrint Arch. 2020: 762 (2020) - [i59]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2020: 770 (2020) - [i58]Hoeteck Wee, Daniel Wichs:
Candidate Obfuscation via Oblivious LWE Sampling. IACR Cryptol. ePrint Arch. 2020: 1042 (2020) - [i57]Hoeteck Wee:
Functional Encryption for Quadratic Functions from k-Lin, Revisited. IACR Cryptol. ePrint Arch. 2020: 1420 (2020) - [i56]Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More. IACR Cryptol. ePrint Arch. 2020: 1431 (2020)
2010 – 2019
- 2019
- [c77]Junqing Gong, Brent Waters, Hoeteck Wee:
ABE for DFA from k-Lin. CRYPTO (2) 2019: 732-764 - [c76]Lucas Kowalczyk, Hoeteck Wee:
Compact Adaptively Secure ABE for \mathsf NC^1 from k-Lin. EUROCRYPT (1) 2019: 3-33 - [c75]Ward Beullens, Hoeteck Wee:
Obfuscating Simple Functionalities from Knowledge Assumptions. Public Key Cryptography (2) 2019: 254-283 - [c74]Yilei Chen, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee:
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. TCC (1) 2019: 55-80 - [i55]Ward Beullens, Hoeteck Wee:
Obfuscating simple functionalities from knowledge assumptions. IACR Cryptol. ePrint Arch. 2019: 56 (2019) - [i54]Lucas Kowalczyk, Hoeteck Wee:
Compact Adaptively Secure ABE for NC1 from k-Lin. IACR Cryptol. ePrint Arch. 2019: 224 (2019) - [i53]Sergey Gorbunov, Hoeteck Wee:
Digital Signatures for Consensus. IACR Cryptol. ePrint Arch. 2019: 269 (2019) - [i52]Manu Drijvers, Sergey Gorbunov, Gregory Neven, Hoeteck Wee:
Pixel: Multi-signatures for Consensus. IACR Cryptol. ePrint Arch. 2019: 514 (2019) - [i51]Junqing Gong, Brent Waters, Hoeteck Wee:
ABE for DFA from k-Lin. IACR Cryptol. ePrint Arch. 2019: 630 (2019) - [i50]Yilei Chen, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee:
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. IACR Cryptol. ePrint Arch. 2019: 1085 (2019) - 2018
- [j8]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Improved, black-box, non-malleable encryption from semantic security. Des. Codes Cryptogr. 86(3): 641-663 (2018) - [j7]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption. J. Cryptol. 31(1): 172-201 (2018) - [c73]Jie Chen, Junqing Gong, Hoeteck Wee:
Improved Inner-Product Encryption with Adaptive Security and Full Attribute-Hiding. ASIACRYPT (2) 2018: 673-702 - [c72]Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee:
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. CRYPTO (2) 2018: 577-607 - [c71]Jie Chen, Junqing Gong, Lucas Kowalczyk, Hoeteck Wee:
Unbounded ABE via Bilinear Entropy Expansion, Revisited. EUROCRYPT (1) 2018: 503-534 - [c70]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Towards Breaking the Exponential Barrier for General Secret Sharing. EUROCRYPT (1) 2018: 567-596 - [c69]Willy Quach, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and Applications. FOCS 2018: 859-870 - [c68]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. FSTTCS 2018: 41:1-41:13 - [c67]Romain Gay, Lucas Kowalczyk, Hoeteck Wee:
Tight Adaptively Secure Broadcast Encryption with Short Ciphertexts and Keys. SCN 2018: 123-139 - [c66]Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs:
Traitor-Tracing from LWE Made Simple and Attribute-Based. TCC (2) 2018: 341-369 - [i49]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. CoRR abs/1810.02396 (2018) - [i48]Jie Chen, Junqing Gong, Lucas Kowalczyk, Hoeteck Wee:
Unbounded ABE via Bilinear Entropy Expansion, Revisited. IACR Cryptol. ePrint Arch. 2018: 116 (2018) - [i47]Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee:
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. IACR Cryptol. ePrint Arch. 2018: 360 (2018) - [i46]Romain Gay, Lucas Kowalczyk, Hoeteck Wee:
Tight Adaptively Secure Broadcast Encryption with Short Ciphertexts and Keys. IACR Cryptol. ePrint Arch. 2018: 391 (2018) - [i45]Willy Quach, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and Applications. IACR Cryptol. ePrint Arch. 2018: 409 (2018) - [i44]Jie Chen, Junqing Gong, Hoeteck Wee:
Improved Inner-product Encryption with Adaptive Security and Full Attribute-hiding. IACR Cryptol. ePrint Arch. 2018: 833 (2018) - [i43]Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs:
Traitor-Tracing from LWE Made Simple and Attribute-Based. IACR Cryptol. ePrint Arch. 2018: 897 (2018) - [i42]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. IACR Cryptol. ePrint Arch. 2018: 945 (2018) - 2017
- [c65]Miguel Ambrona, Gilles Barthe, Romain Gay, Hoeteck Wee:
Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions. CCS 2017: 647-664 - [c64]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Conditional Disclosure of Secrets via Non-linear Reconstruction. CRYPTO (1) 2017: 758-790 - [c63]Michel Abdalla, Romain Gay, Mariana Raykova, Hoeteck Wee:
Multi-input Inner-Product Functional Encryption from Pairings. EUROCRYPT (1) 2017: 601-626 - [c62]Hoeteck Wee:
Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited. TCC (1) 2017: 206-233 - [c61]Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. TCC (1) 2017: 264-302 - [i41]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
New Protocols for Conditional Disclosure of Secrets (and More). Electron. Colloquium Comput. Complex. TR17 (2017) - [i40]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
New Protocols for Conditional Disclosure of Secrets (and More). IACR Cryptol. ePrint Arch. 2017: 359 (2017) - [i39]Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. IACR Cryptol. ePrint Arch. 2017: 795 (2017) - [i38]Miguel Ambrona, Gilles Barthe, Romain Gay, Hoeteck Wee:
Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions. IACR Cryptol. ePrint Arch. 2017: 983 (2017) - [i37]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Towards Breaking the Exponential Barrier for General Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 1062 (2017) - 2016
- [b1]Hoeteck Wee:
Advances in Functional Encryption. École Normale Supérieure, Paris, France, 2016 - [j6]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. J. Cryptol. 29(3): 514-551 (2016) - [c60]Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee:
FHE Circuit Privacy Almost for Free. CRYPTO (2) 2016: 62-89 - [c59]Romain Gay, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee:
Tightly CCA-Secure Encryption Without Pairings. EUROCRYPT (1) 2016: 1-27 - [c58]Hugo Krawczyk, Hoeteck Wee:
The OPTLS Protocol and TLS 1.3. EuroS&P 2016: 81-96 - [c57]Zvika Brakerski, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Obfuscating Conjunctions under Entropic Ring LWE. ITCS 2016: 147-156 - [c56]Hoeteck Wee:
KDM-Security via Homomorphic Smooth Projective Hashing. Public Key Cryptography (2) 2016: 159-179 - [c55]Hoeteck Wee:
Déjà Q: Encore! Un Petit IBE. TCC (A2) 2016: 237-258 - [c54]Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee:
Targeted Homomorphic Attribute-Based Encryption. TCC (B2) 2016: 330-360 - [i36]Romain Gay, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee:
Tightly Secure CCA-Secure Encryption without Pairings. IACR Cryptol. ePrint Arch. 2016: 94 (2016) - [i35]Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee:
FHE Circuit Privacy Almost For Free. IACR Cryptol. ePrint Arch. 2016: 381 (2016) - [i34]Michel Abdalla, Mariana Raykova, Hoeteck Wee:
Multi-Input Inner-Product Functional Encryption from Pairings. IACR Cryptol. ePrint Arch. 2016: 425 (2016) - [i33]Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee:
Targeted Homomorphic Attribute Based Encryption. IACR Cryptol. ePrint Arch. 2016: 691 (2016) - [i32]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption. IACR Cryptol. ePrint Arch. 2016: 720 (2016) - [i31]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Improved, Black-Box, Non-Malleable Encryption from Semantic Security. IACR Cryptol. ePrint Arch. 2016: 842 (2016) - 2015
- [j5]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-Based Encryption for Circuits. J. ACM 62(6): 45:1-45:33 (2015) - [c53]Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee:
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting. CRYPTO (2) 2015: 107-129 - [c52]Eike Kiltz, Jiaxin Pan, Hoeteck Wee:
Structure-Preserving Signatures from Standard Assumptions, Revisited. CRYPTO (2) 2015: 275-295 - [c51]Romain Gay, Iordanis Kerenidis, Hoeteck Wee:
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. CRYPTO (2) 2015: 485-502 - [c50]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Predicate Encryption for Circuits from LWE. CRYPTO (2) 2015: 503-523 - [c49]Eike Kiltz, Hoeteck Wee:
Quasi-Adaptive NIZK for Linear Subspaces Revisited. EUROCRYPT (2) 2015: 101-128 - [c48]Jie Chen, Romain Gay, Hoeteck Wee:
Improved Dual System ABE in Prime-Order Groups via Predicate Encodings. EUROCRYPT (2) 2015: 595-624 - [c47]Kenneth G. Paterson, Jacob C. N. Schuldt, Dale L. Sibborn, Hoeteck Wee:
Security Against Related Randomness Attacks via Reconstructive Extractors. IMACC 2015: 23-40 - [c46]Romain Gay, Pierrick Méaux, Hoeteck Wee:
Predicate Encryption for Multi-dimensional Range Queries from Lattices. Public Key Cryptography 2015: 752-776 - [i30]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Predicate Encryption for Circuits from LWE. IACR Cryptol. ePrint Arch. 2015: 29 (2015) - [i29]Eike Kiltz, Hoeteck Wee:
Quasi-Adaptive NIZK for Linear Subspaces Revisited. IACR Cryptol. ePrint Arch. 2015: 216 (2015) - [i28]Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee:
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting. IACR Cryptol. ePrint Arch. 2015: 246 (2015) - [i27]Hoeteck Wee:
Dual System Encryption via Predicate Encodings. IACR Cryptol. ePrint Arch. 2015: 273 (2015) - [i26]Jie Chen, Romain Gay, Hoeteck Wee:
Improved Dual System ABE in Prime-Order Groups via Predicate Encodings. IACR Cryptol. ePrint Arch. 2015: 409 (2015) - [i25]Eike Kiltz, Jiaxin Pan, Hoeteck Wee:
Structure-Preserving Signatures from Standard Assumptions, Revisited. IACR Cryptol. ePrint Arch. 2015: 604 (2015) - [i24]Romain Gay, Iordanis Kerenidis, Hoeteck Wee:
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2015: 665 (2015) - [i23]Hoeteck Wee:
KDM-Security via Homomorphic Smooth Projective Hashing. IACR Cryptol. ePrint Arch. 2015: 721 (2015) - [i22]Kenneth G. Paterson, Jacob C. N. Schuldt, Dale L. Sibborn, Hoeteck Wee:
Security Against Related Randomness Attacks via Reconstructive Extractors. IACR Cryptol. ePrint Arch. 2015: 892 (2015) - [i21]Hugo Krawczyk, Hoeteck Wee:
The OPTLS Protocol and TLS 1.3. IACR Cryptol. ePrint Arch. 2015: 978 (2015) - [i20]Hoeteck Wee:
Déjà Q: Encore! Un Petit IBE. IACR Cryptol. ePrint Arch. 2015: 1064 (2015) - 2014
- [j4]Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee:
Shorter identity-based encryption via asymmetric pairings. Des. Codes Cryptogr. 73(3): 911-947 (2014) - [j3]Jie Chen, Hoeteck Wee:
Doubly spatial encryption from DBDH. Theor. Comput. Sci. 543: 79-89 (2014) - [c45]Juan A. Garay, Yuval Ishai, Ranjit Kumaresan, Hoeteck Wee:
On the Complexity of UC Commitments. EUROCRYPT 2014: 677-694 - [c44]Yuval Ishai, Hoeteck Wee:
Partial Garbling Schemes and Their Applications. ICALP (1) 2014: 650-662 - [c43]Jie Chen, Hoeteck Wee:
Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula. SCN 2014: 277-297 - [c42]Hoeteck Wee:
Functional Encryption and Its Impact on Cryptography. SCN 2014: 318-323 - [c41]Hoeteck Wee:
Dual System Encryption via Predicate Encodings. TCC 2014: 616-637 - [i19]Jie Chen, Hoeteck Wee:
Doubly Spatial Encryption from DBDH. IACR Cryptol. ePrint Arch. 2014: 199 (2014) - [i18]Jie Chen, Hoeteck Wee:
Dual System Groups and its Applications - Compact HIBE and More. IACR Cryptol. ePrint Arch. 2014: 265 (2014) - [i17]Jie Chen, Hoeteck Wee:
Semi-Adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula. IACR Cryptol. ePrint Arch. 2014: 465 (2014) - [i16]Romain Gay, Pierrick Méaux, Hoeteck Wee:
Predicate Encryption for Multi-Dimensional Range Queries from Lattices. IACR Cryptol. ePrint Arch. 2014: 965 (2014) - [i15]Yuval Ishai, Hoeteck Wee:
Partial Garbling Schemes and Their Applications. IACR Cryptol. ePrint Arch. 2014: 995 (2014) - 2013
- [c40]Hugo Krawczyk, Kenneth G. Paterson, Hoeteck Wee:
On the Security of the TLS Protocol: A Systematic Analysis. CRYPTO (1) 2013: 429-448 - [c39]Jie Chen, Hoeteck Wee:
Fully, (Almost) Tightly Secure IBE and Dual System Groups. CRYPTO (2) 2013: 435-460 - [c38]Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption: New Perspectives and Lower Bounds. CRYPTO (2) 2013: 500-518 - [c37]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. EUROCRYPT 2013: 160-176 - [c36]S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee:
Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. EUROCRYPT 2013: 575-591 - [c35]Seung Geol Choi, Jonathan Katz, Hoeteck Wee, Hong-Sheng Zhou:
Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS. Public Key Cryptography 2013: 73-88 - [c34]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-based encryption for circuits. STOC 2013: 545-554 - [i14]S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee:
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction. IACR Cryptol. ePrint Arch. 2013: 267 (2013) - [i13]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-Based Encryption for Circuits. IACR Cryptol. ePrint Arch. 2013: 337 (2013) - [i12]Hugo Krawczyk, Kenneth G. Paterson, Hoeteck Wee:
On the Security of the TLS Protocol: A Systematic Analysis. IACR Cryptol. ePrint Arch. 2013: 339 (2013) - [i11]Jie Chen, Hoeteck Wee:
Fully, (Almost) Tightly Secure IBE from Standard Assumptions. IACR Cryptol. ePrint Arch. 2013: 803 (2013) - 2012
- [j2]Seung Geol Choi, Hoeteck Wee:
Lossy trapdoor functions from homomorphic reproducible encryption. Inf. Process. Lett. 112(20): 794-798 (2012) - [c33]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption with Bounded Collusions via Multi-party Computation. CRYPTO 2012: 162-179 - [c32]Hoeteck Wee:
Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More. EUROCRYPT 2012: 246-262 - [c31]Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee:
Shorter IBE and Signatures via Asymmetric Pairings. Pairing 2012: 122-140 - [c30]Hoeteck Wee:
Public Key Encryption against Related Key Attacks. Public Key Cryptography 2012: 262-279 - [c29]Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee:
Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices. Public Key Cryptography 2012: 280-297 - [c28]Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee:
Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466 - [i10]Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee:
Shorter IBE and Signatures via Asymmetric Pairings. IACR Cryptol. ePrint Arch. 2012: 224 (2012) - [i9]Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption: New Perspectives and Lower Bounds. IACR Cryptol. ePrint Arch. 2012: 468 (2012) - [i8]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption with Bounded Collusions via Multi-Party Computation. IACR Cryptol. ePrint Arch. 2012: 521 (2012) - [i7]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2012: 604 (2012) - [i6]Seung Geol Choi, Jonathan Katz, Hoeteck Wee, Hong-Sheng Zhou:
Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS. IACR Cryptol. ePrint Arch. 2012: 700 (2012) - 2011
- [c27]Hoeteck Wee:
Threshold and Revocation Cryptosystems via Extractable Hash Proofs. EUROCRYPT 2011: 589-609 - [i5]Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee:
Fuzzy Identity Based Encryption from Lattices. IACR Cryptol. ePrint Arch. 2011: 414 (2011) - 2010
- [c26]Hoeteck Wee:
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs. CRYPTO 2010: 314-332 - [c25]Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee:
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. EUROCRYPT 2010: 381-402 - [c24]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637 - [c23]Rafael Pass, Hoeteck Wee:
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. EUROCRYPT 2010: 638-655 - [c22]Hoeteck Wee:
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification. FOCS 2010: 531-540 - [c21]S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich:
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT 2010: 189-204 - [i4]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010: 120 (2010)
2000 – 2009
- 2009
- [j1]Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. Theory Comput. 5(1): 257-282 (2009) - [c20]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. ASIACRYPT 2009: 287-302 - [c19]Hoeteck Wee:
Zero Knowledge in the Random Oracle Model, Revisited. ASIACRYPT 2009: 417-434 - [c18]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible entropy. STOC 2009: 611-620 - [c17]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Simple, Black-Box Constructions of Adaptively Secure Protocols. TCC 2009: 387-402 - [c16]Rafael Pass, Hoeteck Wee:
Black-Box Constructions of Two-Party Protocols from One-Way Functions. TCC 2009: 403-418 - [i3]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c15]Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47 - [c14]Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. TCC 2008: 427-444 - 2007
- [c13]Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283 - [c12]Hoeteck Wee:
Lower Bounds for Non-interactive Zero-Knowledge. TCC 2007: 103-117 - [c11]Hoeteck Wee:
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments. TCC 2007: 419-433 - 2006
- [c10]Hoeteck Wee:
Finding Pessiland. TCC 2006: 429-442 - 2005
- [c9]Andrej Bogdanov, Hoeteck Wee:
More on Noncommutative Polynomial Identity Testing. CCC 2005: 92-99 - [c8]Cynthia Dwork, Moni Naor, Hoeteck Wee:
Pebbling and Proofs of Work. CRYPTO 2005: 37-54 - [c7]Hoeteck Wee:
On Round-Efficient Argument Systems. ICALP 2005: 140-152 - [c6]Hoeteck Wee:
On obfuscating point functions. STOC 2005: 523-532 - [c5]Henry C. Lin, Luca Trevisan, Hoeteck Wee:
On Hardness Amplification of One-Way Functions. TCC 2005: 34-49 - [c4]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee:
Toward Privacy in Public Databases. TCC 2005: 363-385 - [i2]Hoeteck Wee:
On Obfuscating Point Functions. IACR Cryptol. ePrint Arch. 2005: 1 (2005) - 2004
- [c3]Andrej Bogdanov, Hoeteck Wee:
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. APPROX-RANDOM 2004: 298-309 - [c2]Hoeteck Wee:
On Pseudoentropy versus Compressibility. CCC 2004: 29-41 - [c1]Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, John Kubiatowicz:
Selfish caching in distributed systems: a game-theoretic analysis. PODC 2004: 21-30 - 2003
- [i1]Hoeteck Wee:
Compressibility Lower Bounds in Oracle Settings. Electron. Colloquium Comput. Complex. TR03 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
