A constant round quantum secure protocol for oblivious polynomial evaluation
- 4 August 2023
- journal article
- research article
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 77, 103560
Abstract
No abstract availableKeywords
Funding Information
- International Mathematical Union
This publication has 20 references indexed in Scilit:
- Entangled cloud storageFuture Generation Computer Systems, 2016
- Information-theoretically secure oblivious polynomial evaluation in the commodity-based modelInternational Journal of Information Security, 2014
- The no-cloning theoremPhysics Today, 2009
- Oblivious Polynomial EvaluationSIAM Journal on Computing, 2006
- Oblivious polynomial evaluation and oblivious neural learningTheoretical Computer Science, 2005
- Distributed oblivious function evaluation and its applicationsJournal of Computer Science and Technology, 2004
- Oblivious keyword searchJournal of Complexity, 2004
- Privacy Preserving Data MiningJournal of Cryptology, 2002
- Oblivious transfer and polynomial evaluation1999
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999