STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
RFID in the supply chain: panacea or Pandora's box?
Communications of the ACM
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
On the practical importance of communication complexity for secure multi-party computation protocols
Proceedings of the 2009 ACM symposium on Applied Computing
Secure Multiparty Computation Goes Live
Financial Cryptography and Data Security
Adapting Privacy-Preserving Computation to the Service Provider Model
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 03
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Almost-everywhere secure computation
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
An access control model for mobile physical objects
Proceedings of the 15th ACM symposium on Access control models and technologies
Privacy-preserving multi-objective evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Securely disseminating RFID events
Proceedings of the 5th ACM international conference on Distributed event-based system
A novel k-out-of-n oblivious transfer protocol from bilinear pairing
Advances in Multimedia - Special issue on Web Services in Multimedia Communication
| Hi-index | 0.00 |
Currently, companies are about to optimize their internal processes by monitoring items they handle with Radio Frequency Identification (RFID). However, there is a risk that sensitive information is disclosed when sharing RFID data with other companies. Therefore, companies are unwilling to share RFID data. At first glance, Secure Multi-Party Computation (SMC) might reconciliate data sharing with the privacy concerns. However, SMC requires the collaboration of all parties involved in a protocol. This prevents using SMC for many applications based on item-level RFID data collected in supply chains, since some parties may be competitors or have conflicting interests. We present protocols for securely and privately computing item-level metrics using only existing communication links (e.g., messages stored on RFID tags) and an oblivious third party. This enables optimizing the supply chain using novel item-level metrics without compromising sensitive information.