scispace - formally typeset
Book ChapterDOI

Computational Integrity with a Public Random String from Quasi-Linear PCPs

Reads0
Chats0
TLDR
A party executing a computation on behalf of others may benefit from misreporting its output as mentioned in this paper, and it is moreover imperative to use publicly verifiable protocols that have no backdoors or secret keys that enable forgery.
Abstract
A party executing a computation on behalf of others may benefit from misreporting its output. Cryptographic protocols that detect this can facilitate decentralized systems with stringent computational integrity requirements. For the computation’s result to be publicly trustworthy, it is moreover imperative to usepublicly verifiable protocols that have no “backdoors” or secret keys that enable forgery.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

The knowledge complexity of interactive proof-systems

TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Proceedings ArticleDOI

Bulletproofs: Short Proofs for Confidential Transactions and More

TL;DR: Bulletproofs is a new non-interactive zero-knowledge proof protocol with very short proofs and without a trusted setup; the proof size is only logarithmic in the witness size.
Proceedings ArticleDOI

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

TL;DR: A simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the verification circuit size, which is attractive not only for very large verification circuits but also for moderately large circuits that arise in applications.
Book ChapterDOI

Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS

TL;DR: A methodology to construct preprocessing zkSNARKs where the structured reference string (SRS) is universal and updatable and fast verification is achieved provided the statement being checked is given in encoded form.
Journal ArticleDOI

Privacy-Preserving Solutions for Blockchain: Review and Challenges

TL;DR: The survey covers privacy techniques in public and permissionless blockchains, e.g. Bitcoin and Ethereum, as well as privacy-preserving research proposals and solutions in permissioned and private blockchains.
References
More filters
Book ChapterDOI

How to prove yourself: practical solutions to identification and signature problems

TL;DR: Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.
Journal ArticleDOI

The knowledge complexity of interactive proof systems

TL;DR: A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.
Journal ArticleDOI

Polynomial Codes Over Certain Finite Fields

TL;DR: A mapping of m symbols into 2 symbols will be shown to be (2 m)/2 or ( 2 m 1)/2 symbol correcting, depending on whether m is even or odd.
Journal ArticleDOI

Some optimal inapproximability results

TL;DR: It is proved optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting.
Journal ArticleDOI

A study of non-blocking switching networks

TL;DR: In this article, the authors describe a method of designing arrays of crosspoints for use in telephone switching systems in which it will always be possible to establish a connection from an idle inlet to an idle outlet regardless of the number of calls served by the system.
Related Papers (5)