|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 26 occurrences of 23 keywords
|
|
|
|
|
Results
Found 38 publication records. Showing 38 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee |
Shorter IBE and Signatures via Asymmetric Pairings.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee |
Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices.  |
Public Key Cryptography  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
Public Key Encryption against Related Key Attacks.  |
Public Key Cryptography  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee |
Efficient Password Authenticated Key Exchange via Oblivious Transfer.  |
Public Key Cryptography  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More.  |
EUROCRYPT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee |
Fuzzy Identity Based Encryption from Lattices.  |
IACR Cryptology ePrint Archive  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hoeteck Wee |
Threshold and Revocation Cryptosystems via Extractable Hash Proofs.  |
EUROCRYPT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Universal One-Way Hash Functions via Inaccessible Entropy.  |
IACR Cryptology ePrint Archive  |
2010 |
DBLP BibTeX RDF |
|
| 1 | S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich |
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.  |
LATINCRYPT  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee |
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks.  |
EUROCRYPT  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Universal One-Way Hash Functions via Inaccessible Entropy.  |
EUROCRYPT  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Hoeteck Wee |
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.  |
EUROCRYPT  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs.  |
CRYPTO  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification.  |
FOCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Inaccessible Entropy.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee |
Optimal Cryptographic Hardness of Learning Monotone Functions.  |
Theory of Computing  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee |
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.  |
ASIACRYPT  |
2009 |
DBLP DOI BibTeX RDF |
adaptive corruption, non-committing encryption, public-key encryption, secure multi-party computation |
| 1 | Hoeteck Wee |
Zero Knowledge in the Random Oracle Model, Revisited.  |
ASIACRYPT  |
2009 |
DBLP DOI BibTeX RDF |
sequential composition, zero-knowledge, obfuscation, random oracle model |
| 1 | Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee |
Simple, Black-Box Constructions of Adaptively Secure Protocols.  |
TCC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Hoeteck Wee |
Black-Box Constructions of Two-Party Protocols from One-Way Functions.  |
TCC  |
2009 |
DBLP DOI BibTeX RDF |
black-box constructions, zero-knowledge arguments, trapdoor commitments, parallel coin-tossing, non-malleable commitments, secure two-party computation |
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Inaccessible entropy.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
interactive hashing, computational complexity, cryptography, zero knowledge, one-way functions, commitment schemes |
| 1 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee |
Optimal Cryptographic Hardness of Learning Monotone Functions.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
black-box constructions, Public-key encryption, semantic security, non-malleability |
| 1 | Hoeteck Wee |
Lower Bounds for Non-interactive Zero-Knowledge.  |
TCC  |
2007 |
DBLP DOI BibTeX RDF |
set-up assumptions, lower bounds, Non-interactive zero-knowledge |
| 1 | Hoeteck Wee |
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments.  |
TCC  |
2007 |
DBLP DOI BibTeX RDF |
Interactive hashing, statistically hiding commitments, black-box lower bounds |
| 1 | Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee |
Amplifying Collision Resistance: A Complexity-Theoretic Treatment.  |
CRYPTO  |
2007 |
DBLP DOI BibTeX RDF |
hash functions, combiners, collision resistance, hardness amplification |
| 1 | Hoeteck Wee |
Finding Pessiland.  |
TCC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
On Obfuscating Point Functions.  |
IACR Cryptology ePrint Archive  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Hoeteck Wee |
On Round-Efficient Argument Systems.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry C. Lin, Luca Trevisan, Hoeteck Wee |
On Hardness Amplification of One-Way Functions.  |
TCC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee |
Toward Privacy in Public Databases.  |
TCC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Hoeteck Wee |
Pebbling and Proofs of Work.  |
CRYPTO  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Hoeteck Wee |
More on Noncommutative Polynomial Identity Testing.  |
IEEE Conference on Computational Complexity  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
On obfuscating point functions.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
obfuscation |
| 1 | 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 |
DBLP DOI BibTeX RDF |
game-theoretic models, distributed systems, caching, peer-to-peer systems, price of anarchy, Nash equilibria |
| 1 | Andrej Bogdanov, Hoeteck Wee |
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.  |
APPROX-RANDOM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
On Pseudoentropy versus Compressibility.  |
IEEE Conference on Computational Complexity  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoeteck Wee |
Compressibility Lower Bounds in Oracle Settings  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2003 |
DBLP BibTeX RDF |
|
Displaying result #1 - #38 of 38 (100 per page; Change: )
|
|