-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathresume.txt
185 lines (168 loc) · 8.07 KB
/
resume.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
Christopher T. Lesniewski-Laas
http://lesniewski.org/
ctl at mit dot edu
Updated March 2010.
Home Address Work Address
112 Hancock Street 32 Vassar Street 32-G996
Somerville, MA 02144 Cambridge, MA 02139
+1 617 253 0004
Experience
MIT CSAIL, Parallel and Distributed Operating Systems
Cambridge, MA
2001 - 2010
* Research focus: computer systems, especially security of
large-scale decentralized Internet systems.
* Thesis: Whanau, a structured overlay routing protocol
(DHT) which uses a social network to provide robustness
against powerful pseudonym (Sybil) attacks.
Advisor: M. Frans Kaashoek.
* UIA & Eyo: decentralized routing, naming, & storage in a
zero-configuration, secure, ad-hoc network.
* Alpaca: secure and flexible PKI based on a higher-order
logical framework.
* Other work: distributed and dynamic compact routing for the
Internet; coroutine-based asynchronous I/O programming framework;
game theory, economics, mechanism design, and reputation in
decentralized systems; distributed Web caching; RSA acceleration
using a commodity GPU.
* Master's thesis: SSL Splitting and Barnraising: Cooperative
Caching with Authenticity Guarantees.
* Instructor, 6.033 Computer Systems Engineering, 2003-2005.
* Visiting scholar, Cambridge University Computer Lab, 2004.
Permabit
Cambridge, MA
2001
* Developed highly available, robust, secure, scalable data storage
system based on commodity hardware.
Microsoft Research
Redmond, WA
2000
* I-Campus Secure Successor to the MIT Card project:
cryptographic protocol design.
SensAble Technologies, Inc.
Cambridge, MA
1999
* R&D: hardware and software development for the PHANToM haptic
interface.
MIT AI Lab, Mathematics and Computation
Cambridge, MA
1998
* Programmed randomly generated amorphous computers.
Advisors: Hal Abelson, Gerry Sussman.
Education
Massachusetts Institute of Technology
Cambridge, MA
1997 - Present
* Doctoral candidate, Computer Science, 2003 - present. (GPA 5.0)
* M.Eng. and B.S. Electrical Engineering and Computer Science,
June 2003. (GPA 5.0)
* B.S. Mathematics (Minor in Physics), June 2001. (GPA 4.9)
* Topics: algorithms, complexity, compilers, software design,
modeling, cryptography, architecture, digital design, signal
processing, probability, algebra, quantum+stat physics, general
relativity, economics.
Cohasset High School
Cohasset, MA
1992 - 1997
* Valedictorian, early graduation, Harvard Extension School,
Center for Talented Youth (CTY).
Societies
* MIT Student Information Processing Board (Chair, 2003-2004)
* Eta Kappa Nu (editor of UG6, 2000-2001)
* Phi Beta Kappa
Skills
* Languages: Python, Haskell, C, C++ STL/Boost, Java, Perl,
Javascript, LISP, Matlab, VHDL, Postscript, various assembly,
SQL, XML, HTML, CSS, LaTeX, GLSL, LF, Intercal, French, Chinese
* Network/system programming: TCP/IP, sockets, SSL/TLS, Kerberos,
asynchronous, threads, load balancing, scheduling, consistency,
kernels, compilers, JIT, virtualization, RDBMS, web apps, etc.
* Unix development: Make, GCC, git, Subversion, svk, VIM, X11,
test suites, Ubuntu, Solaris, etc.
* Digital design: Xilinx FPGA development tools, use of
oscilloscope, logic analyzer, datasheets, etc.
* Hobbies: coding, cycling, photography, cooking, SCUBA, travel,
hiking, karate, economics
Software systems developed at MIT
Whanau
2010
* Designed and implemented a secure distributed hash table (DHT),
a decentralized structured overlay network which can quickly
look up the node responsible for a given key. (Existing DHT
applications include distributed databases, filesystems,
caching, rendezvous, and streaming multicast.)
* Novelty: Whanau uses an online social network to bootstrap a
robust overlay network. It is secure against powerful denial of
service (DoS) attacks, including the pseudonym-based "Sybil
attack."
* Implementation: high-performance in-memory simulator
(C++/Boost), asynchronous network daemon (Python) deployed on
PlanetLab testbed. Solo.
* Supervised Master's thesis implementing secure SIP rendezvous
over Whanau (Java).
UIA
2006
* Designed, implemented, debugged, and demoed a routing and naming
system which ties together users' many personal devices (e.g.,
laptops, phones, cameras, media players) into a coherent
cluster. After devices are named and introduced to each other,
UIA ensures that they can communicate whenever physically
possible. Users can refer to each others' devices by recursive
names such as phone.dad.bob.
* Novelty: UIA maintains a shared, concurrently-modified namespace
across intermittently-connected devices, and securely propagates
peer-to-peer updates without relying on a master server.
* Implementation: routing module and kernel hooks (C++/Boost), UI
(C++/QT), name database and resolver (Python).
Team: 4 core developers, 2 PIs.
Also incorporated into a Nokia product demo.
Eyo
2009
* Continues the UIA project. Eyo is a data storage system and API
which provides a consistent view of a user's data objects (e.g.,
photos, music, email) across all of her devices. Eyo tracks
object updates, forwards changes to running applications,
handles network partitions and concurrent updates, and
proactively partitions and replicates data across heterogeneous
devices.
* Novelty: Eyo separates objects' metadata from their content and
distributes all metadata to all devices, while partially
replicating content to some devices.
* Implementation: storage system (Python), C API (C/D-Bus),
example applications (Python and C).
Team: 3 core developers, 1 collaborator, 2 PIs.
Alpaca
2007
* Invented and implemented a logic-based proof-carrying
authorization protocol. Alpaca provides an API enabling network
applications to state and prove logical assertions such as "the
principal Alice says to delete the file X" using cryptographic
operations specified in the accompanying proof.
* Novelty: verifiers don't care how the proof is structured, as
long as it is valid. Thus, Alpaca permits provers to use
different cryptographic techniques (e.g., new hash functions or
data transport mechanisms) without breaking compatibility with
existing verifiers. Alpaca's flexibility is more "future-proof"
than crypto protocols such as Kerberos and TLS, which can only
be updated by installing new software.
* Implementation: logic language, logic engine, cryptography, test
suites, demos (Python). Solo.
Barnraising
2003
* Designed and implemented a peer-to-peer content distribution
network (CDN). Barnraising enables Web sites to delegate some
of their load to a distributed network of cooperating cache
hosts.
* Novelty: Barnraising uses a new technique called SSL Splitting
to securely serve data using untrusted caches. Because a
malicious cache cannot send clients bogus data, Barnraising can
safely permit any Internet host to contribute cache space. Other
systems are limited to centrally-controlled cache servers.
* Implementation: SSL Splitting library (drop-in replacement for
popular OpenSSL library, C), caching Web proxy, tracker, and DNS
server (Perl). Solo.
See also
* CV: http://lesniewski.org/cv.pdf
* Twitter: http://twitter.com/lesniewski
* LinkedIn: http://www.linkedin.com/in/chrislesniewski
* Facebook: http://www.facebook.com/lesniewski