| Spare CPU cycles can now be shared through Internet. More and more applications are now running through Internet computation instead of super computers. Much previous work has been done for different purposes.This paper summarizes the security requirements of secure distributed computing. Then we introduced a new security framework and study two classes of such distributed computing within this framework, analysis the security properties and performance properties of current protocols. After that, an attack is introduced for magic number scheme.Then we introduce a new distributed computing scheme named'ringer task scheme'to solve an open question of how to secure a distributed computing of inversing a one-way predicate arisen in paper [5]. The new scheme can be applied to the realistic problem of Hamilton path. The new ringer task scheme avoids disadvantages in former schemes. Theoretical analysis shows that with a little redundant computation cost, the adversary cannot gain more profit than a honest participant, so the scheme meets the financial security terms that we introduced.At last, this paper concludes the advantages and disadvantages of former... |