The SCEAS System
| |||||||

## Search the dblp DataBase
Hoeteck Wee:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Andrej Bogdanov, Hoeteck Wee
**A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:298-309 [Conf] - Andrej Bogdanov, Hoeteck Wee
**More on Noncommutative Polynomial Identity Testing.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:92-99 [Conf] - Hoeteck Wee
**On Pseudoentropy versus Compressibility.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:29-41 [Conf] - Cynthia Dwork, Moni Naor, Hoeteck Wee
**Pebbling and Proofs of Work.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2005, pp:37-54 [Conf] - Hoeteck Wee
**On Round-Efficient Argument Systems.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:140-152 [Conf] - Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, John Kubiatowicz
**Selfish caching in distributed systems: a game-theoretic analysis.**[Citation Graph (0, 0)][DBLP] PODC, 2004, pp:21-30 [Conf] - Hoeteck Wee
**On obfuscating point functions.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:523-532 [Conf] - Henry Lin, Luca Trevisan, Hoeteck Wee
**On Hardness Amplification of One-Way Functions.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:34-49 [Conf] - Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee
**Toward Privacy in Public Databases.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:363-385 [Conf] - Hoeteck Wee
**Finding Pessiland.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:429-442 [Conf] - Hoeteck Wee
**Lower Bounds for Non-interactive Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] TCC, 2007, pp:103-117 [Conf] - Hoeteck Wee
**One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments.**[Citation Graph (0, 0)][DBLP] TCC, 2007, pp:419-433 [Conf] - Hoeteck Wee
**Compressibility Lower Bounds in Oracle Settings**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:065, pp:- [Journal] - Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
**Amplifying Collision Resistance: A Complexity-Theoretic Treatment.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:264-283 [Conf] **Zero Knowledge in the Random Oracle Model, Revisited.**[Citation Graph (, )][DBLP]**Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.**[Citation Graph (, )][DBLP]**Efficient Chosen-Ciphertext Security via Extractable Hash Proofs.**[Citation Graph (, )][DBLP]**Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.**[Citation Graph (, )][DBLP]**Universal One-Way Hash Functions via Inaccessible Entropy.**[Citation Graph (, )][DBLP]**Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks.**[Citation Graph (, )][DBLP]**Optimal Cryptographic Hardness of Learning Monotone Functions.**[Citation Graph (, )][DBLP]**Inaccessible entropy.**[Citation Graph (, )][DBLP]**Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.**[Citation Graph (, )][DBLP]**Simple, Black-Box Constructions of Adaptively Secure Protocols.**[Citation Graph (, )][DBLP]**Black-Box Constructions of Two-Party Protocols from One-Way Functions.**[Citation Graph (, )][DBLP]**On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |