The following pages link to Hoeteck Wee (Q315544):
Displayed 46 items.
- Attribute-Based Encryption for Circuits (Q3177752) (← links)
- Targeted Homomorphic Attribute-Based Encryption (Q3181032) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
- Structure-Preserving Signatures from Standard Assumptions, Revisited (Q3457070) (← links)
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption (Q3457081) (← links)
- Predicate Encryption for Circuits from LWE (Q3457082) (← links)
- Security Against Related Randomness Attacks via Reconstructive Extractors (Q3460096) (← links)
- Optimal Cryptographic Hardness of Learning Monotone Functions (Q3521906) (← links)
- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks (Q3563846) (← links)
- Universal One-Way Hash Functions via Inaccessible Entropy (Q3563858) (← links)
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions (Q3563859) (← links)
- On obfuscating point functions (Q3581448) (← links)
- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs (Q3582762) (← links)
- On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations (Q3584983) (← links)
- Lower Bounds for Non-interactive Zero-Knowledge (Q3596376) (← links)
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments (Q3596393) (← links)
- Simple, Black-Box Constructions of Adaptively Secure Protocols (Q3611778) (← links)
- Black-Box Constructions of Two-Party Protocols from One-Way Functions (Q3611779) (← links)
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment (Q3612554) (← links)
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols (Q3650698) (← links)
- Zero Knowledge in the Random Oracle Model, Revisited (Q3650706) (← links)
- Shorter IBE and Signatures via Asymmetric Pairings (Q4912492) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Leakage-Resilient Cryptography from Minimal Assumptions (Q4924409) (← links)
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction (Q4924433) (← links)
- (Q5090982) (← links)
- (Q5140842) (← links)
- Partial Garbling Schemes and Their Applications (Q5167780) (← links)
- Inaccessible entropy (Q5172756) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313033) (← links)
- On the Complexity of UC Commitments (Q5418722) (← links)
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One (Q5445519) (← links)
- Pebbling and Proofs of Work (Q5451017) (← links)
- Attribute-based encryption for circuits (Q5495825) (← links)
- Selfish caching in distributed systems (Q5501481) (← links)
- Theory of Cryptography (Q5711663) (← links)
- Automata, Languages and Programming (Q5716769) (← links)
- Multi-input Inner-Product Functional Encryption from Pairings (Q5738891) (← links)
- Dual System Encryption via Predicate Encodings (Q5746356) (← links)
- Theory of Cryptography (Q5898367) (← links)
- One-One Constrained Pseudorandom Functions. (Q6059373) (← links)
- Succinct vector, polynomial, and functional commitments from lattices (Q6063525) (← links)
- Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin (Q6063536) (← links)
- Multi-authority ABE from lattices without random oracles (Q6114256) (← links)
- Witness encryption and null-iO from evasive LWE (Q6135397) (← links)
- On the Inner Product Predicate and a Generalization of Matching Vector Families (Q6307726) (← links)