Carl A. Miller
Mathematician, NIST Computer Security Division
Fellow, Joint Center for Quantum Information and Computer Science (QuICS)
UMD phone: (301) 4057367
UMD office: 3102 Atlantic Building
Curriculum vitae
QuICS Profile



I am an affiliate faculty of the Mathematics Department and an adjunct in the Computer Science Department and UMIACS.
Research:
I work on quantum information processing, a field
where a number of different disciplines and styles
of thinking converge. My
particular
focus is on quantum cryptography, where proving the security
of new protocols often involves some creative and interesting
mathematics. I am interested more generally in applications of
higher mathematics to theoretical computer science.
Activities:
CoLeader of the RIT on Quantum Information at the University of Maryland.
Program Committee Member for QCRYPT 2018, QIP
2016, TQC
2016, and QCRYPT 2016.
Committee Member for the UMD High School Mathematics Competition.
Organizer (2016) and Local Organizer (2015) for the first two
Workshops on Trustworthy Quantum
Information.
Selected work:
 An elementary
proof of private random number generation from Bell inequalities.
Carl A. Miller.
 Graphical methods
in deviceindependent quantum cryptography.
Spencer Breiner,
Carl A. Miller, Neil J. Ross
 Parallel deviceindependent quantum key distribution.
Rahul Jain, Carl A. Miller, Yaoyun Shi.
 Rigidity of the magic pentagram game.
Amir Kalev, Carl A. Miller.
Quantum Science and Technology 3, No. 1, 015002 (2018).
 Randomness in nonlocal games between mistrustful players.
Carl A. Miller,
Yaoyun Shi.
Quantum Information and Computation 17, No. 7&8, pp. 595610 (2017).
 Universal security
for randomness expansion from the spotchecking protocol.
Carl A. Miller,
Yaoyun Shi.
SIAM Journal on Computing 46, No. 4, pp. 13041335 (2017).
 Robust
protocols for securely expanding randomness and distributing
keys using untrusted quantum devices.
Carl A. Miller,
Yaoyun Shi.
Journal of the ACM 63, Issue 4, Article 33 (2016).
Proceedings of the 46th Annual ACM Symposium on Theory of Computing
(STOC), pp. 417426 (2014).
 Evasiveness of graph properties
and topological fixedpoint theorems. (Expository.)
Foundations and Trends in Theoretical Computer Science 7
(2013),
No. 4, pp. 337415.
 An EulerPoincare bound for
equicharacteristic etale sheaves.
(A condensed version of my dissertation.)
Algebra & Number Theory 4 (2010), No. 1, 2145.
Grants:
 NSF STARSS: TTP. A Quantum Approach to Hardware Security: from Theory
to
Optical Implementation. CoPI. September 1, 2015  August 31, 2018.
$388,333.
 NSF PFI: AIRTT. Prototyping UntrustedDevice Quantum Cryptography.
CoPI. April 1, 2015  March 31, 2016. $211,924.
 NSF ICorps Program. Practical and Provably Secure Random Number
Generator. Entreprenurial Lead. Dec. 1, 2014  May 31, 2015.
$50,000.
Teaching Files (University of Michigan):
Miscellaneous: