Verifiable Multi-party Computation with Perfectly Private Audit Trail

Cuvelier, Édouard; Pereira, Olivier

doi:10.1007/978-3-319-39555-5_20

Cited by 5 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is nothing but the same as 𝑔 𝑥 (𝑔 𝑎 ) 𝑟 mod p = 𝑔 𝑥 + 𝑎𝑟 mod p Reveal: Sender exposes x and r to open the commitment, receiving party then validates that C= 𝑔 𝑥 ℎ 𝑟 mod p Cuvelier et al [23] used Pedersen commitment to generate the proof which is perfectly Zero-knowledge proof for verification of election ballot system. Cuvelier and Periera [24] proposed verifiable MPC with PPAT which uses Pedersen commitment with NIZK. This work is illustrated by three different test applications: Solving a system of linear equations, electronic auctions, and finding the shortest path in a graph.…”

Section: Commitmentioning

confidence: 99%

“…He and Wang [63] discussed applications of secure MPC in computational geometric problems. Cuvelier and Pereira [24] present verifiable Multiparty computation with Perfectly Private Audit Trail [PPAT] for MPC using Pedersen commitment scheme. This scheme is single-phase: the users share their inputs asynchronously, and afterward, all parties can collect the result.…”

Section: ) Verifiable Multi-party Computation Using Iomentioning

confidence: 99%

“…In 1999, Cachin [64] proposed a novel and efficient private bidding and auction scheme using a combination of homomorphic encryption with ϕ-hiding assumption. Cuvelier and Pereira [24] also presented PPAT scheme for electronic auction. Galal and Youssef [65] proposed solution for a verifiable online auction with [47] 🗶…”

Section: ) Verifiable Multi-party Computation Using Iomentioning

confidence: 99%

See 2 more Smart Citations

Towards Lightweight Provable Data Possession for Cloud Storage Using Indistinguishability Obfuscation

Chaudhari

Swain

2022

IEEE Access

View full text Add to dashboard Cite

Cloud Computing has proved to be a boon for many individuals and organizations who cannot afford infrastructure and maintenance cost of resources. But the untrusted nature of Cloud Server (CS) brings many challenges related to security and trust. Public auditing is one process that enables users to delegate the integrity verification of outsourced data to external party such as Third-Party Auditor (TPA). Provable Data Possession (PDP) is one approach of auditing that can verify the integrity using cryptographic algorithms. Many PDP schemes are based on bilinear pairing and homomorphic authenticators that involves complex computations that leads to increased verification time. The lightweight auditing processes is a need today using modern cryptographic techniques. Indistinguishability Obfuscation (IO) is one of the modern but weaker primitive that, if used with one-way functions, provide multiple cryptographic constructs. Sahai and Waters proposed construction of cryptographic constructs using IO. Zhang et al. proposed lightweight public auditing scheme using these IO. But still there are many goals to achieve such as group support, collusion handling, privacy-preserving etc. using IO. In this paper, we are trying to explore these issues and lists future research directions in this field. INDEX TERMSPublic Auditing, Provable Data Possession, Homomorphic verifiable Tags, Indistinguishability Obfuscation. I. INTRODUCTION Evolution in the field of computer technology and Internetbased services open up the era of Cloud Computing. Highspeed processors with improved service computing architecture led to the development of large data centers.Flexible and increased network bandwidth enables a client to access or subscribe to data and services from remote data centers. This improved computing architecture helps many organizations or individuals to expand their businesses without any investment in infrastructure and maintenance costs. This paradigm mainly provides services in computing and storage. Multiple computing resources are easily assigned and released to cloud users based on their needs. Cloud datastore is one of the widely used services among cloud users. Cloud users can easily store and share information on cloud storage. Although it provides a promising platform, this paradigm has brought many security and performance issues with it. The main concern is that of integrity verification of outsourced data at remote

show abstract

Section: Commitmentioning

confidence: 99%

Section: ) Verifiable Multi-party Computation Using Iomentioning

confidence: 99%

Section: ) Verifiable Multi-party Computation Using Iomentioning

confidence: 99%

See 1 more Smart Citation

Towards Lightweight Provable Data Possession for Cloud Storage Using Indistinguishability Obfuscation

Chaudhari

Swain

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Neither party is knowing the value of a, but collectively they can calculate it. It means for each i, party has , [15]. By this protocol, the users share their inputs to the worker.…”

Section: Related Work 21 Multi-party Computation and Auditmentioning

confidence: 99%

“…The architecture, workflow and proposed algorithms are elaborated in this section. Section 4 compares the performance of results with existing NIZK [15] scheme.…”

Section: Introductionmentioning

confidence: 99%

Secure and Verifiable Multi-Party Computation Using Indistinguishability Obfuscation

Chaudhari¹,

Swain²,

Mishra³

2020

IJIES

View full text Add to dashboard Cite

In most practical cloud computing applications such as e-voting, auctions, health, and financial applications or cloud services in common, to prove the exactness of outsourced data is one of the major needs today. Most of the time, third party auditing is employed for this task. This auditing work is controlled by assigning the secret inputs to an entity trusted third party, or worker, who is liable for performing computations and hand over the result of the computation to the cloud users or clients. To verify the integrity of computations using traditional cryptographic techniques, the time required to generate and validate the proof is a major computation issue. This paper proposes an improved public auditing technique for multi-party computation to check the integrity of outsourced data using a cryptographic solution. Many researchers have given auditing protocols that generate and verify proof using a cryptographic solution. Most of these scheme uses Non-Interactive Zero-Knowledge Proof (NIZK) which are basically built on bilinear map technology. The verification time using these existing technique is computationally expensive which affect the performance of the auditing system. We propose an efficient protocol that verifies the result correctness using modern cryptographic technique Indistinguishability Obfuscation. The proposed system works in two phases, (i) auction and (ii) audit. During the auction phase, multiple clients share their encrypted bid value to the worker. The worker generates auction result and proof using Pedersen Commitment Scheme. The audit phase starts only after the completion of the auction phase which results in reduced verification time. During the Audit phase, clients can verify the integrity of results using NIZK with the IO technique. The results for reduced verification time in auction system have been presented. It is found that the performance of the proposed system has improved compared to the pertinent NIZK Proof technique. In our setting, we assumed that a worker is one of the trusted entity. By this notion, our protocol also guarantees privacy to the clients during the audit phase.

show abstract

Ordinos: A Verifiable Tally-Hiding E-Voting System

Küsters

Liedtke

Müller

et al. 2020

2020 IEEE European Symposium on Security and Privacy (EuroS&P)

View full text Add to dashboard Cite

Modern electronic voting systems (e-voting systems) are designed to provide not only vote privacy but also (end-to-end) verifiability. Several verifiable e-voting systems have been proposed in the literature, with Helios being one of the most prominent ones.Almost all such systems, however, reveal not just the voting result but also the full tally, consisting of the exact number of votes per candidate or even all single votes. There are several situations where this is undesirable. For example, in elections with only a few voters (e.g., boardroom or jury votings), revealing the complete tally leads to a low privacy level, possibly deterring voters from voting for their actual preference. In other cases, revealing the complete tally might unnecessarily embarrass some candidates. Often, the voting result merely consists of a single winner or a ranking of candidates, so revealing only this information but not the complete tally is sufficient. This property is called tallyhiding and it offers completely new options for e-voting.In this paper, we propose the first provably secure endto-end verifiable tally-hiding e-voting system, called Ordinos. We instantiated our system with suitable cryptographic primitives, including an MPC protocol for greater-than tests, implemented the system, and evaluated its performance, demonstrating its practicality. Moreover, our work provides a deeper understanding of tally-hiding in general, in particular in how far tally-hiding affects the levels of privacy and verifiability of e-voting systems.

show abstract

Verifiable Multi-party Computation with Perfectly Private Audit Trail

Cited by 5 publications

References 20 publications

Towards Lightweight Provable Data Possession for Cloud Storage Using Indistinguishability Obfuscation

Towards Lightweight Provable Data Possession for Cloud Storage Using Indistinguishability Obfuscation

Secure and Verifiable Multi-Party Computation Using Indistinguishability Obfuscation

Ordinos: A Verifiable Tally-Hiding E-Voting System

Contact Info

Product

Resources

About