OpenAlex
PricingAboutJobs
Log inGet started
Work

Proof and Argument Based Verifiable Computing

HTML

Year: 2017
Type: book-chapter
Source: SpringerBriefs in computer science
Parent work: Privately and Publicly Verifiable Computing Techniques: A Survey
DOI: 10.1007/978-3-319-53798-6_3
Authors: Denise Demirel, Lucas Schabhüser, Johannes Buchmann
Institution: Technische Universität Darmstadt
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: verifiable computation, interactive proofs, snarks, Pinocchio, pepper, ginger, pantry, rivers, allspice, Geppetto, buffet

Open Access status: closed
OpenAlex ID: W2601273954
FWCI:
Cites: 34
Cited by: 2
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security