Sub-linear, Secure Comparison with Two Non-colluding Parties

@inproceedings{Toft2011SublinearSC,
  title={Sub-linear, Secure Comparison with Two Non-colluding Parties},
  author={Tomas Toft},
  booktitle={Public Key Cryptography},
  year={2011}
}
The classic problem in the field of secure computation is Yao’s millionaires’ problem; we consider two new protocols solving a variation of this: a number of parties, P1, . . . , Pn, securely hold two `bit values, x and y – e.g. x and y could be encrypted or secret shared. They wish to obtain a bit stating whether x is greater than y using only secure arithmetic; this should be done without revealing any information, even the output should remain secret. The present setting is special in the… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

Similar Papers

Loading similar papers…