Result 1 to 20 of 147 total
Incentive-compatible interdomain routing. (English)
Distrib. Comput. 23, No. 5-6, 301-319 (2011).
1
Preventing active timing attacks in low-latency anonymous communication. (Extended abstract). (English)
Atallah, Mikhail J. (ed.) et al., Privacy enhancing technologies. 10th international symposium, PETS 2010, Berlin, Germany, July 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14526-1/pbk). Lecture Notes in Computer Science 6205, 166-183 (2010).
2
Approximate privacy: pars for set problems. (English)
Comput. Res. Repos. 2010, Article No. 1001.3388 (2010).
3
Approximate privacy: foundations and quantification (extended abstract) (English)
ACM Conference on Electronic Commerce, 167-178 (2010).
4
Preventing active timing attacks in low-latency anonymous communication (English)
Privacy Enhancing Technologies, 166-183 (2010).
5
Approximate privacy: foundations and quantification. (English)
Comput. Res. Repos. 2009, Article No. 0910.5714 (2009).
6
Computational challenges in e-commerce. (English)
Commun. ACM 52, No. 1, 70-74 (2009).
7
Graph distances in the data-stream model. (English)
SIAM J. Comput. 38, No. 5, 1709-1727 (2008).
8
Information accountability. (English)
Commun. ACM 51, No. 6, 82-87 (2008).
9
A model of onion routing with provable anonymity. (English)
Dietrich, Sven (ed.) et al., Financial cryptography and data security. 11th international conference, FC 2007, and 1st international workshop on usable security, USEC 2007, Scarborough, Trinidad and Tobago, February 12‒16, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-77365-8/pbk). Lecture Notes in Computer Science 4886, 57-71 (2008).
10
Workshop report: netecon’08 (English)
SIGecom Exchanges 7, No. 3 (2008).
11
Proceedings of the ACM SIGCOMM 2008 workshop on economics of networked systems, netecon 2008, Seattle, WA, USA, August 22, 2008 (English)
NetEcon (2008).
12
Towards a theory of data entanglement. (English)
Theor. Comput. Sci. 389, No. 1-2, 26-43 (2007).
13
Subjective-cost policy routing. (English)
Theor. Comput. Sci. 378, No. 2, 175-189 (2007).
14
A model of onion routing with provable anonymity (English)
Financial Cryptography, 57-71 (2007).
15
Probabilistic analysis of onion routing in a black-box model (English)
WPES, 1-10 (2007).
16
Private web search (English)
WPES, 84-90 (2007).
17
Mechanism design for policy routing. (English)
Distrib. Comput. 18, No. 4, 293-305 (2006).
18
Secure multiparty computation of approximations (English)
ACM Transactions on Algorithms 2, No. 3, 435-472 (2006).
19
Towards a theory of networked computation (English)
SIGACT News 37, No. 4, 22-26 (2006).
20
Result 1 to 20 of 147 total
Start
Contact
Print
General Help
