Amanote Research

Amanote Research

    RegisterSign In

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-40084-1_6
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2013

Authors
Eli Ben-SassonAlessandro ChiesaDaniel GenkinEran TromerMadars Virza
Publisher

Springer Berlin Heidelberg


Related search

Compactly Representing Parallel Program Executions

2003English

Combining Hardware and Software Instrumentation to Classify Program Executions

2010English

Interactive Physical Zero-Knowledge Proof for Norinori

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Zero Knowledge and Soundness Are Symmetric

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Super-Perfect Zero-Knowledge Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Point Obfuscation and 3-Round Zero-Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Zero-Knowledge Against Quantum Attacks

SIAM Journal on Computing
MathematicsComputer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy