Matt Franklin's Research (Selected Publications)



Fair Threshold Decryption with Semi-Trusted Third Parties

Communication-Efficient Private Protocols for Longest Common Subsequence .

Multi-party indirect indexing and applications.

Towards optimal and efficient perfectly secure message transmission.

Secure linear algebra using linearly recurrent sequences.

Weakly-private secret sharing schemes.

Improved efficiency for private stable matching.

Efficiency tradeoffs for malicious two-party computation.

Efficient polynomial operations in the shared-coefficients setting.

A survey of key evolving cryptosystems.

Byzantine Agreement given partial broadcast.

A generic construction for intrusion-resilient public key encryption.

Intrusion-resilient public key encryption.

Self-healing key distribution with revocation.

Data security (invited chapter).

Identity based encryption from the Weil Pairing.

Lower bounds for multicast message authentication.

An algebraic approach to IP traceback.

Cryptography as a network service.

Deniable payments and electronic campaign finance.

Distribution chain security.

Anonymous authentication with subset queries.

An efficient public key traitor tracing scheme.

Enhancing privacy and trust in electronic communities.

Self-testing/correcting protocols.

Secure communication in minimal connectivity models.

Mutual search.

Reliable communication over partially authenticated networks.

Efficient generation of shared RSA keys.

Fair exchange with a semi-trusted third party.

Auditable metering with lightweight security.

Key management in the Omega system.

Joint encryption and message-efficient secure computation.

The design and implementation of a secure auction service.

Low exponent RSA with related messages.

Multi-authority secret ballot elections with linear work.

Privacy from partial broadcast.

Verifiable signature sharing.

The blinding of weak signatures.

Eavesdropping games: a graph-theoretic approach to privacy in distributed systems''

Secure and efficient off-line digital money.

Communication complexity of secure computation.

Varieties of secure distributed computing.