• No results found

statistical zero-knowledge

An  Efficiency-Preserving  Transformation  from  Honest-Verifier  Statistical  Zero-Knowledge  to  Statistical  Zero-Knowledge

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge

... of zero-knowledge proofs, called instance- dependent zero-knowledge, and show that it suffices for the [8] approach when constructing a compiler from honest-verifier statistical ...

23

Efficient  Statistical  Zero-Knowledge  Authentication  Protocols  for  Smart  Cards  Secure  Against  Active &  Concurrent  Attacks

Efficient Statistical Zero-Knowledge Authentication Protocols for Smart Cards Secure Against Active & Concurrent Attacks

... Zero Knowledge). The protocol hV, P (y)i(x) is (black-box ) statistical zero-knowledge (SZK) for P on some relation R = {(x, y)} if there exists a PPT algorithm S (the simulator ) and a ...

39

Secret  Sharing   and  Statistical  Zero  Knowledge

Secret Sharing and Statistical Zero Knowledge

... We view this theorem as an avenue to constructing efficient secret sharing schemes for languages L outside L : namely, to construct a secret-sharing scheme for A L,n , it suffices to con[r] ...

26

Languages  with  Efficient  Zero-Knowledge  PCP's  are  in  SZK

Languages with Efficient Zero-Knowledge PCP's are in SZK

... strategy beforehand, but are unable to communicate once the interaction with V starts, then all languages in NP can be proved in a (statistical) zero-knowledge way without any computational ...

19

Augmented  Black-Box  Simulation   and  Zero  Knowledge  Argument  for  NP

Augmented Black-Box Simulation and Zero Knowledge Argument for NP

... is statistical zero-knowledge arguments, first presented by Bras- sard, Chaum, and Crepeau in ...perfect zero-knowledge protocol for any statement in NP with constant rounds, which is a ...

23

Improved  Zero-knowledge  Proofs  of  Knowledge  for  the  ISIS  Problem,   and  Applications

Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications

... of knowledge of a solution to the infinity norm Inhomogeneous Small Integer Solution (ISIS ∞ ) problem, the knowledge extractor outputs a solution vector that is only guaranteed to be O(n) e times longer ...

14

An  Unconditionally  Hiding   and  Long-Term  Binding  Post-Quantum  Commitment  Scheme

An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme

... (statistical) zero-knowledge protocols and allows to refreshes the binding property over ...in zero-knowledge fashion that the value committed to did not ...

25

Computationally  binding  quantum  commitments

Computationally binding quantum commitments

... the zero-knowledge property of sigma- protocols (see also Theorem 41 ...of knowledge under a specific additional condition called “strict ...be statistical zero- knowledge), and ...

60

Weak  Zero-Knowledge  Beyond  the  Black-Box  Barrier

Weak Zero-Knowledge Beyond the Black-Box Barrier

... Intuitively, if the verifier does not behave in an explainable manner, the statement x 0 is false, the prover’s message is hidden, and the verifier learns nothing. If the verifier is explainable, then the weak ...

46

Zero-Knowledge  Protocols  for  Search  Problems

Zero-Knowledge Protocols for Search Problems

... the zero-knowledge property (as in definition 11) is denoted by ZP − Search − ZK (as usual, ZK is replaced by CZK , SZK and P ZK depending on the quality of ...

32

Constant-Round  Leakage-Resilient  Zero-Knowledge  Arguments  of  Knowledge  for  NP

Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP

... The key problem in constructing LR-ZK protocol is how to respond to leakage queries in simulation such that the responses are consistent to the simulated view. To solve this problem, [13] adds a preamble to Blum’s ...

28

Practical  Relativistic  Zero-Knowledge  for  NP

Practical Relativistic Zero-Knowledge for NP

... provide Zero-Knowledge ...not zero-knowledge follows from the undesirable fact that dishonest verifiers can discover the (random) colouring of non-edge pairs of nodes in the graph, revealing ...

17

On  Constant-Round  Concurrent  Zero-Knowledge  from  a  Knowledge  Assumption

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

... Furthermore, knowledge assumptions present challenges with regard to auxiliary inputs as is also pointed out in the early works of Hada and Tanaka ...a knowledge assumption, which is expected to hold for ...

31

Efficient  Delegation  of  Zero-Knowledge  Proofs  of  Knowledge  in  a  Pairing-Friendly  Setting

Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting

... proving knowledge of a discrete logarithm in finite groups with known order, and even with unknown order [14, ...of knowledge are heavily used for authentication but also as building blocks in more complex ...

13

Implementation of Zero Knowledge Protocol in Wireless Security

Implementation of Zero Knowledge Protocol in Wireless Security

... a zero value. These zero elements making relationship among neighbors s, that actually represent the social characteristic of sensor node ...a zero element in the boolean sum of Xu s as the social ...

5

Proposal  for  Protocol  on  a  Quorum  Blockchain  with  Zero  Knowledge

Proposal for Protocol on a Quorum Blockchain with Zero Knowledge

... Another important reason for choosing Quorum is that it is built by JPMorgan Chase with the support of Microsoft. By choosing Quorum, we can not only do our implementation of a Zero Knowledge Proof for ...

22

Efficient  Post-Quantum  Zero-Knowledge   and  Signatures

Efficient Post-Quantum Zero-Knowledge and Signatures

... We specify the Share function in this manner as it will lead to more compact zero- knowledge proofs. Moving now to the ZKB protocol, for each round, the prover is required to “open” two views. In order to ...

36

Concurrent  Zero  Knowledge  in  the  Bounded  Player  Model

Concurrent Zero Knowledge in the Bounded Player Model

... In order to analyze this protocol, we will restrict our discussion to the simplified case where only one verifier is present in the system (but the total number of concurrent sessions are unbounded). At this point, one ...

26

Efficient  Designated-Verifier  Non-Interactive  Zero-Knowledge  Proofs  of  Knowledge

Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge

... non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian groups, under standard ...of knowledge, enjoy statistical, and unbounded soundness (the ...

34

Zero-Knowledge  Accumulators   and  Set  Operations

Zero-Knowledge Accumulators and Set Operations

... Verification is also different in the two cases, but always very efficient. Finally, the way updates are handled is especially important as it is another strong point of divergence from previous schemes that seek to ...

46

Show all 10000 documents...

Related subjects