Consider two schemes both have computation complexity linear to the input size (i.e. number of inputs). One scheme is based on Paillier encryption and the other one is based on fully homomorphic encryption.
Question 1: In general, can we compare their performance (i.e. which one is faster)?
Question 2: In general, can we compare their ciphertext size( i.e. which one has smaller sized ciphertex)?