[PDF] Top 20 Indistinguishable proofs of work or knowledge

... Our third application relates to zero-knowledge protocols and concerns quasi-poly- nomial time straight-line simulatable arguments of knowledge. This class of protocols was introduced by [Pas03] and was ... See full document

... of Work or Knowledge (PoWorK) enables the prover to achieve this objective while at the same time ensuring that the verifier is incapable of distinguishing which way the prover has followed : performing the ... See full document

... of knowledge of a message m and a signature σ, where σ is a valid signature on message m with respect to the verification key ...the knowledge of a valid signature. A large body of work has studied ... See full document

... Although natural, this intuitive approach has proven quite tough to analyze. In [DFN06], the authors had to rely on a new complexity-leveraging-type assumption tailored to their scheme, which (informally) states that the ... See full document

... Acknowledgements. The authors would like to thank D. Micciancio and the anonymous reviewers for their helpful comments. This work was supported by the LaBaCry MERLION grant. The research of S. Ling and H. Wang is ... See full document

... recent work, Bitansky, Kalai and Paneth [14] construct a four round private coin -ZK proof system for NP, assuming the existence of keyless multi- collision-resistant hash functions (MCRH) [14, 9, ... See full document

... Recent work on commitments in the standard model proves to be even more efficient and adds no additional assumptions, see the PKC 2015 paper in [4] (improving on ...Zero-knowledge proofs of linear ... See full document

... on proofs of work (PoW) currently account for more than 90% of the total market capital- ization of existing digital ...(Entangled proofs of WOrk and ...of knowledge and couples them ... See full document

... Ideal Functionality for Zero-Knowledge with Witness Elimination In the universal composability (UC) frame- work, once a protocol is proved secure, it can be used in arbitrary contexts retaining its security ... See full document

... the work of [BRSV17a], which introduced PoWs whose hardness is based on the same worst-case assumptions we consider ...zero knowledge and note that our PoWs can be distributed across many worker in way that ... See full document

... Generic techniques using NP reductions will of course always work, but are extremely inefficient. If proof size is the only goal to optimise for, then Succinct Non-Interactive Arguments (SNARGs) give a much better ... See full document

... zero knowledge— the prover does not leak any knowledge beyond the truth of the statement being proven, and (2) soundness—no cheating prover can convince the verifier of a false statement except with small ... See full document

... of work on lattice- based group signatures that combines signature schemes (usually variants of Boyen’s signature [Boy10] or B¨ ohl signature [BHJ + 15]) with non-interactive zero-knowledge (NIZK) ... See full document

... zero-knowledge proofs can incur a large communication cost, which in- creases the overall communication complexity of the MPC protocol in which they are ...all proofs. In this work, we answer ... See full document

... of knowledge for the same relation R with knowledge error 1/|C| ...a knowledge error of (m −1)/|C| if 1 − α > (m −1)/|C|, and special cases of this result were already used implicitly in previous ... See full document

... At a closer look, however, it becomes clear that there are some important differences between both areas. In particular the main reason why the MPCs cannot be used directly to construct the cryptocurrencies is that the ... See full document

... Their work pre- sented such a transformation under the assumption of intractability of solving the discrete-logarithm ...zero- knowledge property to hold against computationally unbounded verifiers which ... See full document

... witness-indistinguishable proofs in [BP15] requires a perfectly correct indistinguishability obfuscation, and the construction of 3-message zero knowledge against uniform verifiers [BCPR14], requires ... See full document

... Most interesting are E XP T IME - and 2E XP T IME -complete- ness of DL-Lite H core and Horn-ALCI, respectively, which contrast with NP- and E XP T IME -completeness of CQ eval- uation in these logics. For DL-Lite ... See full document

... In this paper we propose multi-party protocols solving the reconciliation on ordered sets problem that are provably secure in the malicious model. Our con- structions are based on the semantically secure, additively ... See full document