Distributed oblivious function evaluation and its applications

Authors:
Hong-Da Li;Xiong Yang;Deng-Guo Feng;Bao Li
Affiliations:
State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039, P.R. China;College of Economy and Trade, South China University of Tropical Agriculture, Sanya 571737, P.R. China;State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039, P.R. China;State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 9
Cited 0

All-or-nothing disclosure of secrets

Proceedings on Advances in cryptology---CRYPTO '86
Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth 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
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Selective private function evaluation with applications to private statistics

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
General Adversaries in Unconditional Multi-party Computation

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Privacy-Preserving Cooperative Scientific Computations

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Oblivious transfers and intersecting codes

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a function f(x), and the other party (Bob) with an input α wants to learn f(α) in an oblivious way with the help of a set of servers. What Alice should do is to share her secret function f(x) among the servers. Bob obtains what he should get by interacting with the servers. This paper proposes the model and security requirements for DOFE and analyzes three distributed oblivious polynomial evaluation protocols presented in the paper.