STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Introduction to artificial neural systems
Introduction to artificial neural systems
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st 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
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Noisy polynomial interpolation and noisy chinese remaindering
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Information Security and Cryptology --- ICISC 2008
Oblivious Multi-variate Polynomial Evaluation
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Practical pay-TV scheme using traitor tracing scheme for multiple channels
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Unconditionally secure electronic voting
Towards Trustworthy Elections
Constant-Round private function evaluation with linear complexity
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Fast computation on encrypted polynomials and applications
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Accelerating the secure distributed computation of the mean by a chebyshev expansion
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P, and Bob who has an input x. The goal is for Bob to compute P(x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P(x). Previously existing protocols are based on some intractability assumptions that have not been well studied [15,14], and these protocols are only applicable for polynomials over finite fields. In this paper, we propose efficient OPE protocols which are based on Oblivious Transfer only. Unlike that of [15], slight modifications to our protocols immediately give protocols to handle multi-variate polynomials and polynomials over floating-point numbers. Many important real-world applications deal with floating-point numbers, instead of integers or arbitrary finite fields, and our protocols have the advantage of operating directly on floating-point numbers, instead of going through finite field simulation as that of [14]. As an example, we give a protocol for the problem of Oblivious Neural Learning, where one party has a neural network and the other, with some training set, wants to train the neural network in an oblivious way.