Verifiable Outsourcing Computation of Modular Exponentiations with Single Server
نویسندگان
چکیده
Verifiable computation (VC) allows a computationally weak client to outsource evaluation of a function on many inputs to a powerful but untrusted server. In this paper, we propose an algorithm of verifiable outsourcing computation with single server on modular exponentiation, which has wide applications in public key cryptosystems. We also extend the algorithm to verifiable outsourcing of simultaneous modular exponentiations. The proposed two algorithms improve checkability based on one server compare with the previous ones, where the outsourcer can detect the failure with probability close to 1 if the server misbehaves. The experiments show that our algorithms are the implementations of secure and verifiable outsourcing for single modular exponentiation and simultaneous modular exponentiations.
منابع مشابه
New Approaches for Secure Outsourcing Algorithm for Modular Exponentiations
Outsourcing paradigm is one of the most attractive benefits of cloud computing, where computation workloads can be outsourced to cloud servers by the resourceconstrained devices, such as RFID tags. With this paradigm, cloud users can avoid setting up their own infrastructures. As a result, some new challenges, such as security and checkability, are inevitably introduced. In this paper, we addre...
متن کاملSecure Modular Exponentiation Outsource With Two Untrusted Programs and Improved Checkability
With the development of cloud computing, more and more mobile devices have the requirement to outsource expensive computations in an untrusted environment. Among all such computations, exponentiations modulo a large prime are basic and frequent operations in many discrete-logarithm-based cryptographic protocols. Currently the most efficient outsourcing algorithm of modular exponentiations is un...
متن کاملPrivacy preserving, verifiable and efficient outsourcing algorithm for matrix multiplication to a malicious cloud server
Matrix Multiplication is a basic engineering and scientific problem, which has application in various domains. There exists many cryptographic solutions for secure computation of matrix multiplication, but cryptographic preamble makes them infeasible for outsourcing with large input size to the cloud server. In this paper, we propose a privacy-preserving, verifiable and efficient algorithm for ...
متن کاملMulti-User Non-Interactive Verifiable Computation
Gennaro et al. (Crypto 2010) introduced the notion of verifiable computation, which allows a computationally weak client to outsource the computation of a function F on dynamically chosen inputs x1, . . . , x` to a more powerful but untrusted server. Following a pre-processing phase (that is only carried out once), the client can send some representation of its input xi to the server; the serve...
متن کاملA Two-Server, Sealed-Bid Auction Protocol
Naor, Pinkas, and Sumner introduced and implemented a sealed-bid, two-server auction system that is perhaps the most efficient and practical to date. Based on a cryptographic primitive known as oblivious transfer, their system aims to ensure privacy and correctness provided that at least one auction server behaves honestly. As observed in [19], however, the NPS system suffers from a security fl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 19 شماره
صفحات -
تاریخ انتشار 2017