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

Ben–Sasson, Eli; Bentov, Iddo; Chiesa, Alessandro; Gabizon, Ariel; Genkin, Daniel; Hamilis, Matan; Pergament, Evgenya; Riabzev, Michael; Silberstein, Mark; Tromer, Eran; Virza, Madars

doi:10.1007/978-3-319-56617-7_19

Cited by 41 publications

(30 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first is CMT [36,79] (and [77]) when applied to highly regular wiring patterns; however, such wiring patterns substantially limit applicability. The second is SCI [17], which aims to be general purpose. SCI is, roughly speaking, an argument protocol built atop "short PCPs" [23], and is an exciting development.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Full Accounting for Verifiable Outsourcing

Wahby

Blumberg

et al. 2017

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation; outsourcing makes sense when the combination of these costs is cheaper than not outsourcing. Yet, when prior works impose quantitative thresholds to analyze whether outsourcing is justified, they generally ignore prover costs. Verifiable ASICs (VA)-in which the prover is a custom chip-is the other way around: its cost calculations ignore precomputation. This paper describes a new VA system, called Giraffe; charges Giraffe for all three costs; and identifies regimes where outsourcing is worthwhile. Giraffe's base is an interactive proof geared to dataparallel computation. Giraffe makes this protocol asymptotically optimal for the prover and improves the verifier's main bottleneck by almost 3×, both of which are of independent interest. Giraffe also develops a design template that produces hardware designs automatically for a wide range of parameters, introduces hardware primitives molded to the protocol's data flows, and incorporates program analyses that expand applicability. Giraffe wins even when outsourcing several tens of sub-computations, scales to 500× larger computations than prior work, and can profitably outsource parts of programs that are not worthwhile to outsource in full.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Its costs are usually proportional to the time to run the computation. (Precomputation can be asymptotically suppressed or even eliminated, but at vastly higher concrete cost [17,21,22,34]; see §10.) • Verifier overhead.…”

Section: Introductionmentioning

confidence: 99%

Full Accounting for Verifiable Outsourcing

Wahby

Blumberg

et al. 2017

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

show abstract

“…Then, some different properties of the protocol could be desirable, such as not disclosing the result but instead just providing a proof-of-work. This results in general in zero-knowledge protocols over confidential data, such as cryptocurrency transactions, as in, e.g., [39], with recent efficient implementations [13,10,11,14].…”

Section: Public Verification Delegatability and Zero-knowledgementioning

confidence: 99%

Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk)

Dumas

2018

Developments in Language Theory

View full text Add to dashboard Cite

In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users over communication networks as a cloud-based service. There, demanding computations are outsourced in order to limit infrastructure costs.The idea of verifiable computing is to associate a data structure, a proof-of-work certificate, to the result of the outsourced computation. This allows a verification algorithm to prove the validity of the result, faster than by recomputing it. We talk about a Prover (the server performing the computations) and a Verifier.Goldwasser, Kalai and Rothblum gave in 2008 a generic method to verify any parallelizable computation, in almost linear time in the size of the, potentially structured, inputs and the result. However, the extra cost of the computations for the Prover (and therefore the extra cost to the customer), although only almost a constant factor of the overall work, is nonetheless prohibitive in practice.Differently, we will here present problem-specific procedures in computer algebra, e.g. for exact linear algebra computations, that are Proveroptimal, that is that have much less financial overhead.

show abstract

“…These basic, natural requirements are further complicated by the increasing governance (or lack thereof) of intelligence operations by secret laws: that is, where even the details of law itself are classified as top secret information. 2 The very concept of secret law seems to go against the principles of accountability and transparency. Today's abundant use of secret law can render entirely indistinguishable to the public a lawfully behaving government from one that wantonly abuses power.…”

Section: Introductionmentioning

confidence: 99%

“…Note that we refer to US government practices in this paper, while noting that evidence indicates that many other countries engage in similar behavior [21]. 2 Those not interested in legal subtleties may wish to skip this footnote, which provides clarification on the usage of the term "secret law" herein. In the U.S., laws themselves may not be secret.…”

Section: Introductionmentioning

confidence: 99%

Public Accountability vs. Secret Laws: Can They Coexist?

Goldwasser

Park

2017

Proceedings of the 2017 on Workshop on Privacy in the Electronic Society

View full text Add to dashboard Cite

"Our Laws are not generally known; they are kept secret by the small group of nobles who rule us. We are convinced that these ancient laws are scrupulously administered; nevertheless it is an extremely painful thing to be ruled by laws that one does not know. "-Franz Kafka, Parables and Paradoxes. Post 9/11, journalists, scholars and activists have pointed out that secret laws-a body of law whose details and sometime mere existence is classified as top secret-were on the rise in all three branches of the US government due to growing national security concerns. Amid heated current debates on governmental wishes for exceptional access to encrypted digital data, one of the key issues is: which mechanisms can be put in place to ensure that government agencies follow agreed-upon rules in a manner which does not compromise national security objectives? This promises to be especially challenging when the rules, according to which access to encrypted data is granted, may themselves be secret. In this work we show how the use of cryptographic protocols, and in particular, the idea of zero knowledge proofs can ensure accountability and transperancy of the government in this extraordinary, seemingly deadlocked, setting. We propose an efficient record-keeping infrastructure with versatile publicly verifiable audits that preserve (information-theoretic) privacy of record contents as well as of the rules by which the records are attested to abide. Our protocol is based on existing blockchain and cryptographic tools including commitments and zero-knowledge SNARKs, and satisfies the properties of indelibility (i.e., no backdating), perfect data privacy, public auditability of secret data with secret laws, accountable deletion, and succinctness. We also propose a variant scheme where entities can be required to pay fees based on record contents (e.g., for violating regulations) while still preserving privacy. Our scheme can be directly instantiated on the Ethereum blockchain (and a simplified version with weaker guarantees can be instantiated with Bitcoin).

show abstract

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

Cited by 41 publications

References 65 publications

Full Accounting for Verifiable Outsourcing

Full Accounting for Verifiable Outsourcing

Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk)

Public Accountability vs. Secret Laws: Can They Coexist?

Contact Info

Product

Resources

About