| Cryptography and Information Security Group: Theses |
The CIS Group is part of the Theory Group of MIT's Computer Science and Artificial Intelligence Laboratory.
This page is very much under construction.
Please add CIS theses you have written or supervised.
(Archive an electronic copy of your thesis in /b/cis/WWW/theses)
Thank You.
Note that recent MIT theses may also be available electronically from MIT Theses Online.
(Theses listed in reverse chronological order, within category.)
Ph.D. Theses
M.S. Theses
Bachelor's Theses and Advanced Undergraduate Projects
PH.D. THESES
Order Computations in Generic Groups, June 2007.
Advances in Cryptographic Voting Systems, September 2006.
Cryptographic Error Correction, July 2006.
Advances in Signatures, Encryption, and E-Cash from Bilinear Groups, May 2006.
New Foundations for Efficient Authentication, Commutative
Cryptography, and Private Disjointness Testing, May 2006.
Integrity and access control in untrusted content distribution networks, September 2005.
Design Principles and Patterns for Computer Systems That Are
Simultaneously Secure and Usable, May 2005.
Towards Constant Bandwidth Overhead Integrity Checking of Untrusted Data, May 2005.
New Tools in Cryptography: Mutually Independent Commitments,
Tweakable Block Ciphers, and Plaintext Awareness via Key
Registration, May 2004.
Computational Soundness for Standard Assumptions of Formal Cryptography, May 2004.
Signature Schemes and Applications to Cryptographic Protocol
Design, September 2002.
Efficient Threshold Cryptosystems,
June 2001.
Zero-Knowledge with Public Keys, June 2001.
A Study of Luby-Rackoff Ciphers, January 2001.
Exposure-Resilient Cryptography,
August 2000.
On All-or-Nothing Transforms and Password-Authenticated Key
Exchange Protocols,
May 2000 (version of 5/28/00, with some clarifications added as
compared to the submitted version of 5/22/00).
A Study of Secure Database Access and General Two-Party Computation,
February 2000.
A Study of Statistical Zero-Knowledge Proofs,
August 1999.
(Winner of 2000 ACM Dissertation Award.)
On the Hardness of the Shortest Vector Problem,
September 1998.
Software Protection and Simulation on Oblivious RAMs, 1992.
Randomness in Interactive Proofs,
August 1991.
On the Complexity of Algebraic Functions,
June 1990.
Complexity Aspects of Interactive Proofs,
June 1988.
Cryptographic Protocols,
August 1988.
Elliptic Curves and Cryptography: A Pseudorandom Bit
Generator and Other Tools, January 1988.
Primality Testing and the Power of Noisy Communication Channel,
May 1988.
Cryptology and VLSI: A Two-Part Dissertation,
october 1986.
Computational Limitations for Small Depth Circuits.,
May 1986.
Two Issues in Public Key Cryptography: RSA Bit Security
and A New Knapsack Type System,
May, 1985.
(Note: This thesis won the 1985 ACM Distinguished Dissertation Award.)
MASTER'S THESES
,
May 1998.
Security Proofs for the MD6 Hash Function Mode of Operation, June 2008.
End-to-End Verifiability for Optical Scan Voting Systems, June 2008.
POSH: A Generalized CAPTCHA With Security Applications, June 2008.
A Fair Payment System with Online Anonymous Transfer ,
October 2006
Encrypted Receipts for Voter-Verified Elections Using Homomorphic Encryption. September 2005.
Automated Analysis of Security APIs,
May 2005
On Symbolic Analysis of Cryptographic Protocols,
May 2005
Error-Free Message Transmission in the Universal Composability Framework.
May 2005.
The Analysis of Cryptographic APIs Using The Theorem Prover Otter,
May 2004.
Graph-Based Privacy Preference Expression for the Semantic Web,
May 2004.
Security and Privacy in Radio-Frequency Identification Devices,
May 2003
The Cryptographic Impact of Groups with Infeasible Inversion, May 2003.
National Identification Systems,
March 2003.
Computational Soundness of Formal Adversaries,
September 2002.
Detection and Recovery from the Oblivious Engineer Attack,
September 2002.
On the Existence of 3-Round Zero-Knowledge Proofs, June 2002.
Cryptography in an Unbounded Computational Model, May 2002.
SPKI/SDSI HTTP Server / Certificate Chain Discovery in
SPKI/SDSI , September 2001.
Multi-party Quantum Computing, September 2001.
Adaptive Security in the Threshold Setting: From Cryptosystems
to Signatures, June 2001.
Amortized E-Cash, February 2001.
Using Compression For Source Based Classification Of Text, February 2001.
The Free Haven Project: Design and Deployment of an Anonymous
Secure Data Haven, June 2000.
An Implementation of a Secure Web Client Using SPKI/SDSI Certificates, June 2000.
Self-Describing Cryptography through Certified Universal Code, June 1999.
Pseudonym Systems, May 1999
Group Sharing and Random Access in Cryptographic Storage File Systems, May 1999
Group Blind Digital Signatures: Theory and Applications,
May 1999.
Improving the Exact Security of Digital Signature Schemes,
May 1999.
A Pre-Computation Scheme for Speeding Up Public-Key Cryptosystems,
May 1998.
An Implementation of MicroMint
BACHELOR'S THESES and ADVANCED UNDERGRADUATE PROJECTS
,
May, 1999.
Prototyping a Lightweight Trust Architecture To Fight Phishing,
(May 2005).
The Free Haven User Interface: Methods for Inserting and Retrieiving Information
Stored in Free Haven,
May, 2000.
(Note: this copy seems to be a preliminary version rather than the final version.)
Trust Economies in the Free Haven Project,
May, 2000.
Design and Analysis of an Anonymous Communication Channel for the Free Haven Project,
May, 2000.
SPKI/SDSI Secure Web Server Project