Cryptology ePrint Archive: Report 2009/019
Available versions in chronological order
20090113:054605 (posted 13-Jan-2009 05:46:05 UTC)
Communication-Efficient Private Protocols for Longest Common Subsequence
Matthew Franklin and Mark Gondree and Payman Mohassel
Publication Info: This is the full version of an article to appear in CT-RSA 2009.
20090113:071114 (posted 13-Jan-2009 07:11:14 UTC)
Communication-Efficient Private Protocols for Longest Common Subsequence
Matthew Franklin and Mark Gondree and Payman Mohassel
Publication Info: This is the full version of an article to appear in CT-RSA 2009.
20090113:191456 (posted 13-Jan-2009 19:14:56 UTC)
Communication-Efficient Private Protocols for Longest Common Subsequence
Matthew Franklin and Mark Gondree and Payman Mohassel
Publication Info: This is the full version of an article to appear in CT-RSA 2009.
[
Cryptology ePrint archive
]