Matt Franklin's Research (Selected Publications)

Practical Dual-Receiver Encryption
Optimal Coding for Streaming Authentication and Interactive Communication
Unique Ring Signatures: A Practical Construction
Unique Group Signatures
Privacy-Preserving Alibi Systems .
  • With B. Davis, H. Chen.
  • Proc. ASIACCS 2012.
Secure and Efficient Evaluation of Multivariate Polynomials and Applications
  • With P. Mohassel.
  • Proc. Applied Cryptography and Network Security Conference (ACNS 2010)
Fair Threshold Decryption with Semi-Trusted Third Parties .
  • With J. Hong, J. Kim, J. Kim, K. Park.
  • International Journal of Applied Cryptography, 2010.
  • Earlier version in Proc. Australasian Conf. Inf. Sec. and Priv. (ACISP 2009)
Communication-Efficient Private Protocols for Longest Common Subsequence .
  • With M. Gondree and P. Mohassel
  • Proc. RSA Conference -- Cryptographer's Track (CT-RSA 2009).
Multi-party indirect indexing and applications.
  • With M. Gondree and P. Mohassel
  • Proc. Asiacrypt 2007
Towards optimal and efficient perfectly secure message transmission.
  • With M. Fitzi, J. Garay and S. Harsha Vardhan
  • Proc. Theory of Cryptography Conference (TCC) 2007
Secure linear algebra using linearly recurrent sequences.
  • With E. Kiltz, P. Mohassel and E. Weinreb
  • Proc. Theory of Cryptography Conference (TCC) 2007
Weakly-private secret sharing schemes.
  • With A. Beimel
  • Proc. Theory of Cryptography Conference (TCC) 2007
Improved efficiency for private stable matching.
  • With M. Gondree and P. Mohassel
  • Proc. RSA Conference -- Cryptographers Track (CT-RSA) 2007
Efficiency tradeoffs for malicious two-party computation.
  • With P. Mohassel
  • Proc. Public Key Cryptography (PKC) 2006
Efficient polynomial operations in the shared-coefficients setting.
  • With P. Mohassel
  • Proc. Public Key Cryptography (PKC) 2006
A survey of key evolving cryptosystems.
  • Int'l J. Security and Networks 1 (2006).
Byzantine Agreement given partial broadcast.
  • With J. Considine, M. Fitzi, L. Levin, U. Maurer, D. Metcalf.
  • J. Cryptology 3 (2005).
A generic construction for intrusion-resilient public key encryption.
  • With Y. Dodis, J. Katz, A. Miyaji, M. Yung
  • Proc. 2004 Cryptographers' Track RSA Conference.
Intrusion-resilient public key encryption.
  • With Y. Dodis, J. Katz, A. Miyaji, M. Yung
  • Proc. 2003 Cryptographers' Track RSA Conference.
Self-healing key distribution with revocation.
  • With J. Staddon, S. Miner, D. Balfanz, M. Malkin, D. Dean
  • Proc. 2002 IEEE Symposium on Security and Privacy.
Data security (invited chapter).
  • The Computer Engineering Handbook
  • CRC Press, 2002 (V. Oklobdzija, ed.)
Identity based encryption from the Weil Pairing.
  • With D. Boneh
  • SIAM J. Computing, April 2003.
  • earlier version in Advances in Cryptology -- Crypto 2001 Proceedings.
Lower bounds for multicast message authentication.
  • With D. Boneh and G. Durfee
  • Advances in Cryptology -- Eurocrypt 2001 Proceedings.
An algebraic approach to IP traceback.
  • With D. Dean and A. Stubblefield
  • ACM Trans. Information and System Security, May 2002.
  • Earlier version in Proc. 2001 Network and Distrib. System Security Symp. (Best Paper Award)
Cryptography as a network service.
  • With T. Berson, D. Dean, M. Spreitzer, D. Smetters
  • Proc. 2001 Network and Distributed System Security Symposium .
Deniable payments and electronic campaign finance.
  • With T. Sander
  • Advances in Cryptology -- AsiaCrypt 2000 Proceedings .
Distribution chain security.
  • With G. Durfee
  • Proc. ACM Conference on Computer and Communication Security, 2000.
Anonymous authentication with subset queries.
  • With D. Boneh
  • Proc. ACM Conference on Computer and Communications Security, 1999.
An efficient public key traitor tracing scheme.
  • With D. Boneh
  • Advances in Cryptology -- Crypto '99 Proceedings .
Enhancing privacy and trust in electronic communities.
  • With B. Huberman and T. Hogg
  • Proc. 1st ACM Conference on Electronic Commerce (EC '99).
Self-testing/correcting protocols.
  • With J. Garay and M. Yung
  • Proc. 13th International Symposium on Distributed Computing (DISC/WDAG '99).
Secure communication in minimal connectivity models.
  • With R. Wright
  • Journal of Cryptology , Vol. 13, No. 1, 2000, 9--30.
  • earlier version in Advances in Cryptology -- Eurocrypt '98 Proceedings .
Mutual search.
  • With H. Buhrman, J. Garay, J. Hoepman, J. Tromp, and P. Vitanyi
  • Journal of the ACM , Vol. 46, No. 4, 1999, 517--536.
  • earlier version in Proc. 9th ACM Symposium on Discrete Algorithms (SODA 1998).
Reliable communication over partially authenticated networks.
  • With A. Beimel
  • Journal of Theoretical Computer Science, Vol. 220, No. 1, 1999, 185--210.
  • earlier version in Proc. 11th International Workshop on Distributed Algoritms (WDAG 1997).
Efficient generation of shared RSA keys.
  • With D. Boneh
  • Journal of the ACM, Vol. 48, No. 4, July 2001.
  • Earlier version in Advances in Cryptology -- Crypto '97 Proceedings .
Fair exchange with a semi-trusted third party.
  • With M. Reiter
  • Proc. ACM Conference on Computer and Communications Security, 1997.
Auditable metering with lightweight security.
  • With D. Malkhi
  • Journal of Computer Security, Vol. 6, No. 4, 1998.
  • Earlier version in Proc. Financial Cryptography '97, Springer-Verlag.
Key management in the Omega system.
  • With M. Reiter, R. Wright, and J. Lacy
  • Journal of Computer Security., Vol. 4, No. 4, 1996, 267--287.
  • Earlier version in Proc. ACM Conference on Computer and Communications Security, 1996.
Joint encryption and message-efficient secure computation.
  • With S. Haber
  • Journal of Cryptology , Vol. 9, No. 4, Autumn 1996, 217--232.
  • Earlier version in Advances in Cryptology -- Crypto '93 Proceedings .
The design and implementation of a secure auction service.
  • With M. Reiter
  • IEEE Transactions on Software Enginerring, Vol. 22, No. 5, May 1996, 302--312.
  • Earlier version in Proc. 1995 IEEE Conference on Security and Privacy.
Low exponent RSA with related messages.
  • With D. Coppersmith, J.Patarin, and M. Reiter
  • Advances in Cryptology -- Eurocrypt '96 Proceedings
  • Earlier version in IBM Research Report RC 20318, December 27, 1995.
Multi-authority secret ballot elections with linear work.
  • With R. Cramer, B. Schoenmakers, and M. Yung
  • Advances in Cryptology -- Eurocrypt '96 Proceedings
  • Earlier version in CWI Research Report CS-R9571, January 1996.
Privacy from partial broadcast.
  • With M. Yung
  • SIAM Journal on Discrete Math, Vol. 18, No. 3, 2004, 437--450.
  • Earlier version in Proc. 27th Annual ACM Symposium on Theory of Computing (STOC 1995).
Verifiable signature sharing.
  • With M. Reiter
  • Advances in Cryptology -- Eurocrypt '95 Proceedings.
The blinding of weak signatures.
  • With M. Yung
  • Advances in Cryptology -- Eurocrypt '94 Proceedings.
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems''
  • With Z. Galil and M. Yung
  • Journal of the ACM, Vol. 47, 2000, 225--243.
  • earlier version in Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS 1993).
Secure and efficient off-line digital money.
  • With M. Yung
  • Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP 1993).
  • Earlier version in Columbia University Research Report, 1992.
Communication complexity of secure computation.
  • With M. Yung
  • Proc. 24th Annual ACM Symposium on Theory of Computing (STOC 1992).
Varieties of secure distributed computing.
  • With M. Yung
  • Proc. Sequences II, Methods in Communications, Security and Computer Science , 1991.