Abstract
In this paper, we first introduce a new notion called augmented oblivious polynomial evaluation (AOPE), a useful notion to deal with the general oblivious polynomial evaluation protocol. And then we propose a novel implementation of our AOPE protocol. Finally we show that our construction is provably secure within our model. The potential areas of application of this protocol are numerous (two-party computation, bidding protocol, keyword search problem, and so on...). © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Zhu, H., & Bao, F. (2005). Augmented oblivious polynomial evaluation protocol and its applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3679 LNCS, pp. 222–230). Springer Verlag. https://doi.org/10.1007/11555827_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
