Corpus ID: 203687293

Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification

@inproceedings{Kim2019UpdatableCS,
  title={Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification},
  author={Jihye Kim and Jiwon Lee and Hyunok Oh},
  year={2019}
}
  • Jihye Kim, Jiwon Lee, Hyunok Oh
  • Published 2019
  • This paper proposes pairing-based simulation-extractable zeroknowledge succinct non-interactive arguments of knowledge (SE-SNARK) schemes for QAP (Quadratic Arithmetic Program). In the proposed schemes, the proof size is 3 group elements for a QAP (Quadratic Arithmetic Program) circuit in asymmetric groups (Type III pairing), and 2 group elements for an SAP (Square Arithmetic Program) circuit in symmetric groups (Type I pairing), respectively. Moreover, the proposed schemes have only a single… CONTINUE READING

    Tables from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES
    On the Size of Pairing-Based Non-interactive Arguments
    • 176
    • Open Access
    ZKBoo: Faster Zero-Knowledge for Boolean Circuits
    • 103
    • Open Access
    Short Pairing-Based Non-interactive Zero-Knowledge Arguments
    • 290
    • Open Access