Secure Comparison Without Explicit XOR

Details Secure Comparison Without Explicit XOR Secure Comparison Without Explicit XOR

2012-04-12

arxiv.org/abs/1204.2854v1

Computer Science

Cryptography and Security

Ninth European Dependable Computing Conference, Sibiu, Romania

Scientific paper

We propose an efficient protocol for secure comparison of integers when both integers are shared between two parties. Such protocols are useful for implementing secure auctions. The proposed protocol's computational complexity is roughly half the complexity of the best known efficient protocol. The efficiency of the proposed protocol stems from the removal of the XOR computation which is a time consuming operation.

Affiliated with

Also associated with

No associations

Rating

Secure Comparison Without Explicit XOR does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure Comparison Without Explicit XOR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Comparison Without Explicit XOR will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-142944