Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Information Security and Applications

A constant round quantum secure protocol for oblivious polynomial evaluation

Tapaswini Mohanty, Vikas Srivastava, Sihem Mesnager, Sumit Kumar Debnath

Published Aug 4, 2023• 2 citations
Publisher
DOI
10.1016/j.jisa.2023.103560

Related papers

A New Unconditionally-secure Oblivious Polynomial Evaluation Protocol

Wang Jiang-an, WANG Qinglong -

INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences•Jan 30, 2013•0 citations

Unconditionally Secure Distributed Oblivious Polynomial Evaluation

Louis Cianciullo, Hossein Ghodosi

Lecture notes in computer science•Jan 1, 2019•6 citations

Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results

Louis Cianciullo, Hossein Ghodosi

Journal of Computer Science and Technology•Mar 31, 2022•5 citations

Augmented Oblivious Polynomial Evaluation Protocol and Its Applications

Huafei Zhu, Feng Bao

Lecture notes in computer science•Jan 1, 2005•16 citations

Information theoretic secure oblivious polynomial evaluation: Model, bounds and constructions

J. Mueller-Quade, A Otsuka, G Hanaoka +3 more

•Jan 1, 2004•0 citations

Distributed Protocols for Oblivious Transfer and Polynomial Evaluation

Aviad Ben Arie, Tamir Tassa

Lecture notes in computer science•Jan 1, 2024•1 citation