- Mutual Search [Extended Abstract]
- 1st ACM Conference on Computer and Communications Secu rity, Nov. 1993, pp. 102--106.
- Eavesdropping Games: A GraphTheoretic Approach to Privacy in Distributed Systems \Lambda
- Secure and Efficient OffLine Digital Money Matthew Franklin
- Auditable Metering with Lightweight Security Matthew K. Franklin and Dahlia Malkhi
- An Efficient Public Key Traitor Tracing Scheme (Extended Abstract)
- Varieties of Secure Distributed Computing Matthew Franklin
- [3] M. BenOr, S. Goldwasser, and A. Wigderson, ``Completeness theorems for noncryptographic fault tolerant distributed computation,'' ACM STOC 1988, 1--9.
- [Che94] L. Chen. Witness Hiding Proofs and Applications. PhD thesis, Aarhus Uni versity, Computer Science Department, Aarhus, Denmark, August 1994.
- Commital Deniable Proofs and Electronic Campaign Finance
- Fair Exchange with a SemiTrusted Third Party (extended abstract)
- 3. M. K. Franklin and M. K. Reiter. Verifiable signature sharing. In Advances in Cryptology---EUROCRYPT '95 (Lecture Notes in Computer Science 921), L. C.
- Lower Bounds for Multicast Message Authentication
- An Algebraic Approach to IP Traceback Drew Dean Matt Franklin Adam Stubblefield
- of distributed checking centers (e.g., three or five) to compute together the role of a centralized one still yields a very practical system.
