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
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Cryptology
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Privacy preserving association rule mining in vertically partitioned data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Building decision tree classifier on private data
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE 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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
More on shared-scalar-product protocols
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Augmented oblivious polynomial evaluation protocol and its applications
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Secure two-party k-means clustering
Proceedings of the 14th ACM conference on Computer and communications security
Hi-index | 0.00 |
In this paper, a new notion which we call oblivious scalar-product protocols is introduced and formalized. We then propose an efficient implementation of oblivious scalar-product protocols based on homomorphic cryptographic primitives (e.g., homomorphic encryptions and homomorphic commitments). Finally we show that our implementation is provably secure assuming that the underlying Fujisaki-Okamoto's commitment scheme is statistically hiding and computationally binding, and Paillier's encryption scheme is semantically secure in the common reference string model.