“Efficient Cryptographic Protocol Design Based on Distributed EL Gamal and Paillier Encription”
Abstract: This is a Senior Project presentation
We offer El Gamal and Paillier encryption that can be used to construct efficient multipartycomputation for low-complexity functions . In particular, we describe El Gamal and Paillier encryption and apply them some protocols and this application take 4 rounds of interaction. Protocols we look are secure against adversaries..Security relies on decisional Diffie-Hellmanassumption if we use El Gamal encryption and it relies on desicional Composite Residuosity assumption if we use Paillier encryption. A detailed computations of protocols will be presented.
Date: Friday , December 26, 2014
Place: Mathematics Seminar Room, SA-141