# Any functioning system for interactive proof?

My problem is to outsource an array of data and ask the prover to sort the data.

I am wonder if there is any working system out there that support interactive proof for the above computation? Or if none, any particular protocol that may be efficient enough and implementable for the problem of verifiable sorting?

-
Could you provide a bit more details on which application you have in mind? Do you want to outsource plain data for sorting and then get the data back (the other party should just do the sorting for you)? Is the data collected somewhere and you want to be sure that it is sorted when you retrieve it? –  DrLecter Oct 29 '13 at 22:56
Alternatively, is the comparison operator a secret that has been committed to? $\hspace{1.61 in}$ –  Ricky Demer Oct 30 '13 at 8:02
@Richard You may have a look at this paper and there is also some work on sorting fully homomorphic encrypted data here. –  DrLecter Dec 12 '13 at 17:52