Office: Gates-Hillman 7225
E-mail: [jblocki AT cs
DOT cmu DOT edu]
Research Interests: I am especially interested in developing usable authentication protocols
for humans. Are there easy ways for humans to create and remember multiple
strong passwords? Can we design secure cryptographic protocols that are so
simple that can be run by a human?
Other Research Interests: At a high level I am a theoretical computer scientist who is interested
in applying fundamental ideas from computer science to address practical
problems in usable privacy and security.
Is it possible for data curator to provide useful answers to questions
about a social network while preserving differential privacy? I am also
interested in game theory and learning theory and their applications to
practical security problems like auditing.
Repetition and Mnemonics Enable Recall of Multiple Strong Passwords. With Saranga Komanduri, Lorrie Cranor and Anupam Datta. NDSS 2015. (to appear) [arXiv]
Private Data Analysis of Social Networks via Restricted Sensitivity. With Avrim Blum, Anupam Datta, and Or Sheffet. ITCS
2013. [arXiv] [Slides]
The Johnson-Lindenstrauss transform itself preserves differential
privacy. With Avrim Blum, Anupam Datta, and Or Sheffet (lead author). FOCS 2012. [arXiv]
Audit Strategies for
Provable Risk Management and Accountable Data
Datta, Nicolas Christin
and Arunesh Sinha.
GameSec 2012. [Paper]
Audit Mechanisms for
Privacy Protection in Healthcare Environments. With Anupam Datta, Nicolas Christin and Arunesh Sinha.
HealthSec 2011. [Position Paper]
Regret Minimizing Audits:
A Learning-Theoretic Basis for Privacy Protection. With Anupam Datta, Nicolas Christin and Arunesh Sinha.
the Complexity of Some Data Privacy Problems. With Ryan Williams. ICALP 2010. [arXiv] [Slides]
with Low Pairwise Intersection. With Calvin Beideman. [arXiv]
Usable and Secure Password Management [Slides]
Differentially Private Data Analysis of Social
Networks via Restricted Sensitivity [Slides]
Regret Minimization in Bounded Memory Games [Slides]
Resolving the Complexity of Some Data Privacy Problems [Slides]
[CMU, Spring 2012] TA. 15-453 Formal Languages, Automata and Computability. (Instructor: Lenore Blum)
[CMU, Fall 2010] Head TA. 15-451 Algorithms. (Instructor: Manuel Blum)
2008] TA. 15-859P Introduction to
Theoretical Cryptography. (Instructor: Manuel Blum)
2008] TA. 15-251 Great Theoretical Ideas in Computer Science. (Instructor: Luis von Ahn)
Senior Research Thesis: Direct Zero-Knowledge Proofs [Extended
The Turing Machine Kernel Is Not Computable [Blog Post]
The Computational Complexity of Kn
I am happy to be married to my beautiful wife
I am involved in
Graduate Christian Fellowship at CMU.
I am a huge fan
of Pitt basketball and
football, the Penguins, and the Steelers. It has also been exciting to see
the Pirates play well in
I enjoy playing
basketball, Frisbee, softball, and most other sports that mankind has invented.