A Zero-knowledge Undeniable Signature Scheme in Non-abelian Group Setting
Author(s): Tony Thomas | Arbind Kumar LalJournal: International Journal of Network Security ISSN 1816-353X
Volume: 6; Issue: 3; Start page: 265; Date: 2008;
Original pageKeywords: Homomorphic encryption | PET | plaintext equivalence test | secure multi-party computation
ABSTRACT
Consider the following scenario with N+2 parties, A, B, X_1, X_2, cdots, X_N. Party A has a secret a, party B has a secret b, and party X_i has a secret x_i, for i=1,cdots,N. They want to know if a=b without revealing any information about their secrets. We propose a distributed protocol for this problem based on the Paillier threshold homomorphic encryption scheme with a public broadcast channel. This protocol is suitable for voting which requires public verifiability. This protocol is secure and robust in an honest majority environment. We proved the security in a formal framework for secure multi-party computation.
Add to my list
My list