STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Cryptographic techniques for privacy-preserving data mining
ACM SIGKDD Explorations Newsletter
Oblivious Polynomial Evaluation
SIAM Journal on Computing
Homomorphic encryption and secure comparison
International Journal of Applied Cryptography
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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Hi-index | 0.00 |
Consider the following problem in secure multiparty computation: Alice and Bob possess integers x and y respectively. Charlie is a researcher who would like to compute the value of some function f(x, y). The requirement is that Charlie should not gain any knowledge about x and y other than that which can be obtained from the function itself. Moreover, Alice and Bob do not trust each other and should not gain knowledge about each other's data. This paper contains initial work on a methodology to enable such secure function evaluation using additive and multiplicative homomorphisms as cryptographic primitives instead of oblivious transfer. It is shown that Charlie can compute the encrypted value of any polynomial in x and y. We present two secure function evaluation protocols for semi-honest participants that can be extended to polynomial functions of an arbitrary number of variables.