搜索结果: 1-5 共查到“Resettable zero-knowledge”相关记录5条 . 查询时间(0.067 秒)
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
zero knowledge resettable ZK resettable soundness
2017/9/25
In FOCS 2001 Barak et al. conjectured the existence of zero-knowledge arguments that remain secure against resetting provers and resetting verifiers. The conjecture was proven true by Deng et al. in F...
A constant-round resettably-sound resettable zero-knowledge argument in the BPK model
foundations / Resettable zero-knowlege Resettable sound
2012/3/27
In resetting attacks against a proof system, a prover or a verifier is reset and enforced to use the same random tape on various inputs as many times as an adversary may want. Recent deployment of clo...
Resettably-Sound Resettable Zero Knowledge Arguments for NP
Resettably-Sound Resettable Zero Knowledge Arguments NP non-black-box
2009/6/11
We construct resettably-sound resettable zero knowledge arguments for NP based
on standard hardness assumption (the existence of claw-free permutations) in the plain model.
This proves the simultane...
Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications
concurrent knowledge-extraction concurrent non-malleability concurrent/resettable zero-knowledge
2009/4/10
In this work, we investigate concurrent knowledge-extraction (CKE) and concurrent non-malleability
(CNM) for concurrent (and stronger, resettable) ZK protocols in the bare public-key model.
We formu...
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
Resettable Zero Knowledge Concurrent Soundness Bare Public-Key Model Resettably sound Zero Knowledge
2008/12/5
In this paper we resolve an open problem regarding resettable zero knowledge
in the bare public-key (BPK for short) model: Does there exist constant
round resettable zero knowledge argument with con...