@inproceedings{04de03d64dc54073adfb49ae4cd89346,
title = "Efficient cryptographic protocol design based on distributed El gamal encryption",
abstract = "We propose a set of primitives based on El Gamal encryption that can be used to construct efficient multiparty computation protocols for certain low-complexity functions. In particular, we show how to privately count the number of true Boolean disjunctions of literals and pairwise exclusive disjunctions of literals. Applications include efficient two-party protocols for computing the Hamming distance of two bitstrings and the greater-than function. The resulting protocols only require 6 rounds of interaction (in the random oracle model) and their communication complexity is script O sign(kQ) where k is the length of bit-strings and Q is a security parameter. The protocols are secure against active adversaries but do not provide fairness. Security relies on the decisional Diffie-Hellman assumption and error probability is negligible in Q.",
author = "Felix Brandt",
year = "2006",
doi = "10.1007/11734727_5",
language = "English",
isbn = "3540333541",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "32--47",
booktitle = "Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers",
note = "8th International Conference on Information Security and Cryptology, ICISC 2005 ; Conference date: 01-12-2005 Through 02-12-2005",
}