搜索结果: 1-9 共查到“密码学 snark”相关记录9条 . 查询时间(0.062 秒)
Simulation Extractability in Groth's zk-SNARK
Zero-knowledge proofs zk-SNARKs simulation extractability
2019/6/4
A Simulation Extractable (SE) zk-SNARK enables a prover to prove that she knows a witness for an instance in a way that the proof: (1) is succinct and can be verified very efficiently; (2) does not le...
QAP-based Simulation-Extractable SNARK with a Single Verification
SNARK non-interactive zero-knowledge proof simulation-extractability
2019/5/31
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 ...
The main result of this note is a severe flaw in the description of the zk-SNARK in [BCTV14]. The flaw stems from including redundant elements in the CRS, as compared to that of the original Pinocchio...
Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model
zk-snarks generic group model non-malleability
2018/3/6
We describe a variant of Groth's zk-SNARK [Groth, Eurocrypt 2016] that satisfies simulation extractability, which is a strong form of adaptive non-malleability. The proving time is almost identical to...
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model
SNARKs zero-knowledge multi-party computation
2017/11/1
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have emerged as a valuable tool for verifiable computation and privacy preserving protocols. Currently practical schemes requ...
A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK
SNARKs zero-knowledge cryptocurrencies
2017/6/26
Recent efficient constructions of zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs), require a setup phase in which a common-reference string (CRS) with a certain structure is...
A Subversion-Resistant SNARK
Common reference string generic group model non-interactive zero knowledge
2017/6/22
While succinct non-interactive zero-knowledge arguments of knowledge (zk-SNARKs) are widely studied, the question of what happens when the CRS has been subverted has received little attention. In ASIA...
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationallysound
proofs where the verifier’s work is essentially independent of the complexity of the NP nondeter...
Gennaro, Gentry, Parno, and Raykova (GGPR) introduced Quadratic Arithmetic Programs (QAPs) as a way of representing arithmetic circuits in a form amendable to highly efficient cryptographic protocols ...