We study the problem of secure two-party computation in the presence of a trusted setup. If there is an unconditionally UC-secure protocol for f that makes use of calls to an ideal g, then we say that f reduces to g (and write
f⊑g). Some g are complete in the sense that all functions reduce to g. However, almost nothing is known about the power of an incomplete g in this setting. We shed light on this gap by showing a characterization of
f⊑g for incomplete g.
UC security is the framework in treating a stand-alone protocol and guaranteeing the secure composition.This means that a protocol may run concurrently with many other protocols,on arbitrary inputs and in adversarial controlled way,if it is UC security in the sense that it emulates an ideal functionality,it can be treated as a piece of that ideal functionality in overall system security analysis.In this paper,ZK under UC framework is studied,and the study proves that Blum protocol is closed under sequential composition in the Fwzk-hybrid model.