On the Classification of Finite Boolean Functions up to Fairness

@article{Makriyannis2014OnTC,
  title={On the Classification of Finite Boolean Functions up to Fairness},
  author={Nikolaos Makriyannis},
  journal={IACR Cryptology ePrint Archive},
  year={2014},
  volume={2014},
  pages={516}
}
Two parties, P1 and P2, wish to jointly compute some function f(x, y) where P1 only knows x, whereas P2 only knows y. Furthermore, and most importantly, the parties wish to reveal only what the output suggests. Function f is said to be computable with complete fairness if there exists a protocol computing f such that whenever one of the parties obtains the correct output, then both of them do. The only protocol known to compute functions with complete fairness is the one of Gordon et al (STOC… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…