您当前的位置: 首页 >  ar

mutourend

暂无认证

  • 2浏览

    0关注

    661博文

    0收益

  • 0浏览

    0点赞

    0打赏

    0留言

私信
关注
热门博文

QAP-based Simulation-Extractable SNARK with a Single Verification及代码实现

mutourend 发布时间:2019-06-17 10:17:04 ,浏览量:2

Jihye Kim and Jiwon Lee and Hyunok Oh 发表于2019年6月的论文《QAP-based Simulation-Extractable SNARK with a Single Verification》,摘要内容如下:

The pairing-based simulation-extractable succinct non-interactive arguments of knowledge (SE-SNARKs) are attractive since they enable a prover to generate a proof with the knowledge of the witness to an instance in a manner which is succinct - proofs are short and the verifier’s computation is small, zero-knowledge - proofs do not reveal the witness, and simulation-extractable - it is only possible to prove instances to which a witness is known although a number of simulated proofs are provided. The state-of-the-art pairing-based SE-SNARK is based on a square arithmetic program (SAP), instead of a more generalized quadratic arithmetic program (QAP). In order to add simulation extractability, the SE-SNARK requires to verify an additional equation compared to the state-of-the-art SNARKs. In this paper, we propose a QAP-based SE-SNARK which consists of only 3 group elements for a QAP circuit and a single verification equation in asymmetric groups (Type III pairing). The proposed scheme is secure under concrete intractability assumptions in the random oracle model. Moreover, we propose a scheme with two elements as a proof and a single verifying equation, based on SAP in a symmetric group (Type I pairing).

在iden3 snarkjs中,以protocol名为kimleeoh做了代码支持。 当前snarkjs共支持original 8points protocol and the Groth Protocol (3 point only and 3 pairings) 和kimleeoh 三种协议

 --protocol [original|groth|kimleeoh]
关注
打赏
1664532908
查看更多评论
立即登录/注册

微信扫码登录

0.0402s