STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Communications of the ACM
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
A practical approach to solve Secure Multi-party Computation problems
Proceedings of the 2002 workshop on New security paradigms
A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Leveraging the "Multi" in secure multi-party computation
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Secure two-party computational geometry
Journal of Computer Science and Technology
Secure set intersection cardinality with application to association rule mining
Journal of Computer Security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Blinded additively homomorphic encryption schemes for self-tallying voting
Proceedings of the 6th International Conference on Security of Information and Networks
Hi-index | 0.00 |
Users of an online trading system rely on Reputation Systems to better judge whom should be trusted and to what degree. This is achieved through users building up reputations in the system. In these types of environments, it has been shown that users with good reputations do more business than users with bad reputations. The ballot stuffing scheme exploits this and has fraudulent users placing a number of false bids in an attempt to better the reputation of a single user.Though previous research has dealt with thwarting the one man ballot stuffing scheme, the issue of privacy was neglected. The solution proposed relied on looking up the coordinates of a user who is a cellular phone holder. Upon placing a bid, the user's geographical coordinates are compared to the coordinates of other users involved in the transaction. If the users were within a predefined distance to one another, the transaction was marked as suspicious. This mechanism relies on storing the coordinates of a user over time and, from a privacy perspective, is unacceptable.The intention of this paper is to propose several solutions that attempt to safeguard the privacy of all users involved when calculating the distance between two cellular phone holders, i.e., thwarting the one man ballot stuffing scheme. We discuss solutions that cater for service providers who may be willing or unwilling to participate in safeguarding the privacy of their users. These techniques include Secure Multi-party Computation, polynomial interpolation and the addition of untrusted third parties.