[PDF] Top 20 Proposal for Protocol on a Quorum Blockchain with Zero Knowledge

... In this paper, we present an implementation scheme of an RTGS 1 on Quorum using the Solidity language. It is heavily inspired by the Schnorr signature protocol to verify the identity of the participants. We ... See full document

... unified zero-knowledge (UZK) protocol, namely a unified generic zero-knowledge (UGZK) ...UGZK protocol and discuss special cases. Compared to UZK, the new protocol allows ... See full document

... “CMT protocol” of Cormode et ...of knowledge for NP, which is succinct if the circuit is “parallelizable” ...5–121×. Zero-Knowledge Verifiable ...of knowledge (SNARKs) from ... See full document

... of zero-knowledge proofs contemplated a single prover and a single verifier executing a single protocol session in ...Concurrent zero-knowledge [DNS98] (cZK) extends ... See full document

... efficient zero-knowledge proof of knowledge for committed values (essentially a Σ-protocol), but also for such proofs showing any kind of relation amongst committed values, ... See full document

... Independently, Costa, Martínez and Morillo [6] have published a shuffle for lattice based schemes. Their shuffle is based on an idea of Wikström using permutation matrices. Unfortunately, one cannot guarantee the secrecy ... See full document

... efficient zero-knowledge au- thentication protocol which can be implemented on smart cards for environments with tight security ...our protocol with those without a ZK-like ...base ... See full document

... The protocol is witness hiding, due to the followed proce- dure for developing it [23]; thanks to the statistically hiding property of the commitments, all the values generated for the false proof will be ... See full document

... We use a commitment scheme in the CRS model with the property that it is perfectly binding given the correctly constructed CRS, but is equivocal to a simulator who generates the CRS in an alternative but ... See full document

... Advances in technology have made it possible to develop sensor nodes which are compact and inexpensive. They are mounted with a variety of sensors and are wireless enabled. Once sensor nodes have been deployed, there ... See full document

... Hao et al. proposed a voting system, called DRE-i (DRE with integrity) [15], to achieve E2E verifiability without involving any tallying authorities (TAs). However, the pre- computation strategy requires that the ... See full document

... true knowledge that will end up helping “revealing” the true ...the blockchain protocol itself is not equipped with a sophisticated theorem proving capability, it can still use the basic logic to ... See full document

... the protocol, ...the protocol can be utilized in already working environments alongside other implementations, without requiring new standardizations and/or implementations of big and system-wide ... See full document

... a protocol which allows a prover to commit to a polynomial in the discrete-logarithm setting, using a homomorphic commitment ...term zero, whose coefficients were single field ... See full document

... current zero-knowledge protocol require at least ( log n) ...non-malleable zero- knowledge ...malleable zero-knowledge argument system for NP in the Bare Public-Key ... See full document

... The network field is 2000m x 2000m with 400 initially uniformly-distributed nodes. For the physical propagation model we used the two-way ground model. We applied the parameters of a 2.4GHZ Lucent Orinoco WaveLAN DSSS ... See full document

... fair protocol which requires non-trivial computation on the inputs needs to be fully trusted and can get the output or inputs of the protocol if one party raises a ...signatures protocol [26] allows ... See full document

... Theorem 2 The 3-pass protocol is proof of zero knowledge with zero knowledge error 3/4 when the commitment scheme Com is computationally binding. Proof. Suppose that there exists a ... See full document

... of zero- knowledge proofs for cluster computations. Zero-knowledge proofs are useful even when applied to relatively-small computations, and even with high overheads ... See full document

... Because that this might be due to a lack of effect of these drugs on degenerating neurons, even when they are able to potentiate the brain in nondegenerative conditions, we propose her[r] ... See full document