UNIVERSITY OF TARGU MURES
Crypto-computing is a set of well-known techniques for computing with encrypted data. The security of the corresponding protocols is usually proven in the semi-honest model. In this paper, the authors propose a new class of zero-knowledge proofs, which are tailored for crypto-computing protocols. First, these proofs directly employ properties of the underlying crypto systems and thus many facts have more concise proofs compared to generic solutions. Second, they show how to achieve universal composability in the trusted set-up model where all zero-knowledge proofs share the same system-wide parameters. Third, they derive a new protocol for multiplicative relations and show how to combine it with several crypto-computing frameworks to get security in the malicious model.