COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Anonymity via networks of mixes

## Anonymity via networks of mixesAdd to your list(s) Download to your calendar using vCal - Venkat Anantharam, EECS Department, University of California Berkeley.
- Monday 18 January 2010, 15:00-16:00
- MR5, CMS, Wilberforce Road, Cambridge, CB3 0WB.
If you have a question about this talk, please contact Neil Walton. Mixes are relay nodes that accept packets arriving from multiple sources and release them after variable delays to prevent an eavesdropper from associating outgoing packets to their sources. We assume that each mix has a hard latency constraint. Using an entropy-based measure to quantify anonymity, we analyze the anonymity provided by networks of such latency-constrained mixes. Our results are of most interest under light traffic conditions. A general upper bound is presented that bounds the anonymity of a single-destination mix network in terms of a linear combination of the anonymity of two-stage networks. By using a specific mixing strategy, a lower bound is provided on the light traffic derivative of the anonymity of single-destination mix networks. The light traffic derivative of the upper bound coincides with the lower bound for the case of mix-cascades (linear single-destination mix networks). Bio: Venkat Anantharam received the B.Tech in Electronics in 1980 from the Indian Institute of Technology, Madras (IIT-M) and the M.A. and C.Phil degrees in Mathematics and the M.S. and Ph.D. degrees in Electrical Engineering in 1983, 1984, 1982 and 1986 respectively, from the University of California at Berkeley (UCB). From 1986 to 1994 he was on the faculty of the School of EE at Cornell University. From 1994 he has been on the faculty of the EECS department at UCB . Anantharam received the Philips India Medal and the President of India Gold Medal from IIT -M in 1980, and an NSF Presidential Young Investigator award (1988 -1993). He a co-recipient of the 1998 Prize Paper award of the IEEE Information Theory Society (with S. VerdĂș) and a co-recipient of the 2000 Stephen O. Rice Prize Paper award of the IEEE Communications Theory Society (with N. Mckeown and J. Walrand). He received the Distinguished Alumnus Award from IIT -M in 2008. He is a Fellow of the IEEE . This talk is part of the Optimization and Incentives Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Computer Laboratory Security Seminar
- Computer Laboratory talks
- DPMMS Lists
- DPMMS info aggregator
- DPMMS lists
- Economics and Computer Science Talks
- MR5, CMS, Wilberforce Road, Cambridge, CB3 0WB
- Optimization and Incentives Seminar
- School of Physical Sciences
- School of Technology
- Security-related talks
- Statistical Laboratory info aggregator
Note that ex-directory lists are not shown. |
## Other listsCausal Inference Seminar and Discussion Group Sandars Lectures in Bibliography The Centre For Financial Analysis & Policy## Other talksA 6d interpretation of 3d gravity Don't multiply lightly: exploring how DNN depth interacts with HMM independence assumptions in hybrid HMM/DNN's used for ASR Food Allergy 2016 String Theory, Scattering Equations and Analytic Gluon Amplitudes Metabolomics 2016 Cafe Synthetique: Are synthetic biologists engineers, tinkerers or hackers? |