/** @file ***************************************************************************** Declaration of interfaces for a ppzkSNARK for TBCS. This includes: - class for proving key - class for verification key - class for processed verification key - class for key pair (proving key & verification key) - class for proof - generator algorithm - prover algorithm - verifier algorithm (with strong or weak input consistency) - online verifier algorithm (with strong or weak input consistency) The implementation is a straightforward combination of: (1) a TBCS-to-USCS reduction, and (2) a ppzkSNARK for USCS. Acronyms: - TBCS = "Two-input Boolean Circuit Satisfiability" - USCS = "Unitary-Square Constraint System" - ppzkSNARK = "PreProcessing Zero-Knowledge Succinct Non-interactive ARgument of Knowledge" ***************************************************************************** * @author This file is part of libsnark, developed by SCIPR Lab * and contributors (see AUTHORS). * @copyright MIT license (see LICENSE file) *****************************************************************************/ #ifndef TBCS_PPZKSNARK_HPP_ #define TBCS_PPZKSNARK_HPP_ #include "tbcs/tbcs.hpp" #include "uscs_ppzksnark/uscs_ppzksnark.hpp" namespace libsnark { /******************************** Proving key ********************************/ template class tbcs_ppzksnark_proving_key; template std::ostream& operator<<(std::ostream &out, const tbcs_ppzksnark_proving_key &pk); template std::istream& operator>>(std::istream &in, tbcs_ppzksnark_proving_key &pk); /** * A proving key for the TBCS ppzkSNARK. */ template class tbcs_ppzksnark_proving_key { public: typedef Fr FieldT; tbcs_circuit circuit; uscs_ppzksnark_proving_key uscs_pk; tbcs_ppzksnark_proving_key() {}; tbcs_ppzksnark_proving_key(const tbcs_ppzksnark_proving_key &other) = default; tbcs_ppzksnark_proving_key(tbcs_ppzksnark_proving_key &&other) = default; tbcs_ppzksnark_proving_key(const tbcs_circuit &circuit, const uscs_ppzksnark_proving_key &uscs_pk) : circuit(circuit), uscs_pk(uscs_pk) {} tbcs_ppzksnark_proving_key(tbcs_circuit &&circuit, uscs_ppzksnark_proving_key &&uscs_pk) : circuit(std::move(circuit)), uscs_pk(std::move(uscs_pk)) {} tbcs_ppzksnark_proving_key& operator=(const tbcs_ppzksnark_proving_key &other) = default; size_t G1_size() const { return uscs_pk.G1_size(); } size_t G2_size() const { return uscs_pk.G2_size(); } size_t G1_sparse_size() const { return uscs_pk.G1_sparse_size(); } size_t G2_sparse_size() const { return uscs_pk.G2_sparse_size(); } size_t size_in_bits() const { return uscs_pk.size_in_bits(); } void print_size() const { uscs_pk.print_size(); } bool operator==(const tbcs_ppzksnark_proving_key &other) const; friend std::ostream& operator<< (std::ostream &out, const tbcs_ppzksnark_proving_key &pk); friend std::istream& operator>> (std::istream &in, tbcs_ppzksnark_proving_key &pk); }; /******************************* Verification key ****************************/ /** * A verification key for the TBCS ppzkSNARK. */ template using tbcs_ppzksnark_verification_key = uscs_ppzksnark_verification_key; /************************ Processed verification key *************************/ /** * A processed verification key for the TBCS ppzkSNARK. * * Compared to a (non-processed) verification key, a processed verification key * contains a small constant amount of additional pre-computed information that * enables a faster verification time. */ template using tbcs_ppzksnark_processed_verification_key = uscs_ppzksnark_processed_verification_key; /********************************** Key pair *********************************/ /** * A key pair for the TBCS ppzkSNARK, which consists of a proving key and a verification key. */ template class tbcs_ppzksnark_keypair { public: tbcs_ppzksnark_proving_key pk; tbcs_ppzksnark_verification_key vk; tbcs_ppzksnark_keypair() {}; tbcs_ppzksnark_keypair(tbcs_ppzksnark_keypair &&other) = default; tbcs_ppzksnark_keypair(const tbcs_ppzksnark_proving_key &pk, const tbcs_ppzksnark_verification_key &vk) : pk(pk), vk(vk) {} tbcs_ppzksnark_keypair(tbcs_ppzksnark_proving_key &&pk, tbcs_ppzksnark_verification_key &&vk) : pk(std::move(pk)), vk(std::move(vk)) {} }; /*********************************** Proof ***********************************/ /** * A proof for the TBCS ppZKSNARK. */ template using tbcs_ppzksnark_proof = uscs_ppzksnark_proof; /***************************** Main algorithms *******************************/ /** * A generator algorithm for the TBCS ppZKSNARK. * * Given a TBCS circuit C, this algorithm produces proving and verification keys for C. */ template tbcs_ppzksnark_keypair tbcs_ppzksnark_generator(const tbcs_circuit &circuit); /** * A prover algorithm for the TBCS ppZKSNARK. * * Given a TBCS primary input X and a TBCS auxiliary input Y, this algorithm * produces a proof (of knowledge) that attests to the following statement: * ``there exists Y such that C(X,Y)=0''. * Above, C is the TBCS circuit that was given as input to the generator algorithm. */ template tbcs_ppzksnark_proof tbcs_ppzksnark_prover(const tbcs_ppzksnark_proving_key &pk, const tbcs_primary_input &primary_input, const tbcs_auxiliary_input &auxiliary_input); /* Below are four variants of verifier algorithm for the TBCS ppZKSNARK. These are the four cases that arise from the following two choices: (1) The verifier accepts a (non-processed) verification key or, instead, a processed verification key. In the latter case, we call the algorithm an "online verifier". (2) The verifier checks for "weak" input consistency or, instead, "strong" input consistency. Strong input consistency requires that |primary_input| = C.num_inputs, whereas weak input consistency requires that |primary_input| <= C.num_inputs (and the primary input is implicitly padded with zeros up to length C.num_inputs). */ /** * A verifier algorithm for the TBCS ppZKSNARK that: * (1) accepts a non-processed verification key, and * (2) has weak input consistency. */ template bool tbcs_ppzksnark_verifier_weak_IC(const tbcs_ppzksnark_verification_key &vk, const tbcs_primary_input &primary_input, const tbcs_ppzksnark_proof &proof); /** * A verifier algorithm for the TBCS ppZKSNARK that: * (1) accepts a non-processed verification key, and * (2) has strong input consistency. */ template bool tbcs_ppzksnark_verifier_strong_IC(const tbcs_ppzksnark_verification_key &vk, const tbcs_primary_input &primary_input, const tbcs_ppzksnark_proof &proof); /** * Convert a (non-processed) verification key into a processed verification key. */ template tbcs_ppzksnark_processed_verification_key tbcs_ppzksnark_verifier_process_vk(const tbcs_ppzksnark_verification_key &vk); /** * A verifier algorithm for the TBCS ppZKSNARK that: * (1) accepts a processed verification key, and * (2) has weak input consistency. */ template bool tbcs_ppzksnark_online_verifier_weak_IC(const tbcs_ppzksnark_processed_verification_key &pvk, const tbcs_primary_input &primary_input, const tbcs_ppzksnark_proof &proof); /** * A verifier algorithm for the TBCS ppZKSNARK that: * (1) accepts a processed verification key, and * (2) has strong input consistency. */ template bool tbcs_ppzksnark_online_verifier_strong_IC(const tbcs_ppzksnark_processed_verification_key &pvk, const tbcs_primary_input &primary_input, const tbcs_ppzksnark_proof &proof); } // libsnark #include "tbcs_ppzksnark/tbcs_ppzksnark.tcc" #endif // TBCS_PPZKSNARK_HPP_