Augmented oblivious polynomial evaluation protocol and its applications

Authors:
Huafei Zhu;Feng Bao
Affiliations:
Department of Information Security, Institute for Infocomm Research, A-Star, Singapore;Department of Information Security, Institute for Infocomm Research, A-Star, Singapore
Venue:
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Year:
2005

Citing 12
Cited 2

Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
Client/Server Tradeoffs for Online Elections

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Oblivious keyword search

Journal of Complexity - Special issue on coding and cryptography
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Noisy polynomial interpolation and noisy chinese remaindering

EUROCRYPT'00 Proceedings of the 19th 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
Keyword search and oblivious pseudorandom functions

TCC'05 Proceedings of the Second international conference on Theory of Cryptography

More on shared-scalar-product protocols

ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Oblivious scalar-product protocols

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

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...).