International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Matthew K. Franklin

Publications

Year
Venue
Title
2013
CRYPTO
2009
EPRINT
Communication-Efficient Private Protocols for Longest Common Subsequence
Matthew Franklin Mark Gondree Payman Mohassel
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to passive adversaries, under reasonable cryptographic assumptions. We benefit from the somewhat surprising interplay of an efficient block-retrieval PIR (Gentry-Ramzan, ICALP 2005) with the classic “four Russians” algorithmic design. This result is the first improvement to the communication complexity for this application over generic results (such as Yao’s garbled circuit protocol) and, as such, is interesting as a contribution to the theory of communication efficiency for secure two-party and multiparty applications.
2007
ASIACRYPT
2007
TCC
2007
TCC
2007
TCC
2007
EPRINT
Multi-Party Indirect Indexing and Applications
Matthew Franklin Mark Gondree Payman Mohassel
We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmic blow-up. Our most efficient instantiation (built from length-flexible additively homomorphic public key encryption) improves the communication complexity of secure multi-party computation for a number of problems in the literature. Underlying our approach is a new multi-party variant of oblivious transfer which may be of independent interest.
2006
PKC
2006
PKC
2006
EPRINT
Improved Efficiency for Private Stable Matching
Matthew Franklin Mark Gondree Payman Mohassel
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity of Golle's main protocol is substantially greater than what was claimed in that paper, in part due to surprising pathological behavior of Golle's variant of the Gale-Shapley stable matching algorithm. We also develop new protocols in Golle's basic framework with greatly reduced communication complexity.
2005
JOFC
2001
CRYPTO
2001
EUROCRYPT
2001
EPRINT
Identity Based Encryption From the Weil Pairing
Dan Boneh Matthew Franklin
We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. We give precise definitions for secure identity based encryption schemes and give several applications for such systems.
2000
ASIACRYPT
2000
JOFC
1999
CRYPTO
1998
EUROCRYPT
1997
CRYPTO
1996
EUROCRYPT
1996
EUROCRYPT
1996
JOFC
1995
EUROCRYPT
1994
EUROCRYPT
1993
CRYPTO

Program Committees

TCC 2009
Crypto 2008
PKC 2008
Crypto 2007
Eurocrypt 2006
Crypto 2004 (Program chair)
Asiacrypt 2002
Crypto 2002
Eurocrypt 2001
Crypto 1998