• No results found

[PDF] Top 20 Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP

Has 10000 "Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP" found on our website. Below are the top 20 most common "Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP".

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

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

... to leakage queries in simulation such that the responses are consistent to the simulated ...3-round zero knowledge ...respond leakage queries under the help of the leakage ... See full document

28

Augmented  Black-Box  Simulation   and  Zero  Knowledge  Argument  for  NP

Augmented Black-Box Simulation and Zero Knowledge Argument for NP

... all zero knowledge protocols are black-box zero ...concurrent constant-round zero knowledge ar- gument for NP which was proved not to exist in black-box setting ... See full document

23

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 ... See full document

23

Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds

Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds

... the round complexity of all the above protocols based on the standard assumptions is at least O(log n) ...current zero-knowledge protocol require at least ( log n) ...non-malleable zero- ... See full document

15

Obfuscation-based  Non-black-box  Simulation   and  Four  Message  Concurrent  Zero  Knowledge  for  NP

Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP

... It has proven difficult to extend Barak’s NBB techniques to the setting of fully concurrent ZK (i.e., to unbounded polynomially many sessions) in o(log n) rounds. Nevertheless, NBB techniques have enjoyed great success ... See full document

40

Making  the  Best  of  a  Leaky  Situation:  Zero-Knowledge  PCPs  from  Leakage-Resilient  Circuits

Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits

... global leakage [20, 11, 28] cannot be transformed into SAT-respecting non-relaxed LRCCs ...unless NP ⊆ ...the leakage function, and the simulated values “fool” all functions in ...for NP ... See full document

65

Constant-Round  Concurrent  Zero  Knowledge  From  Falsifiable  Assumptions

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

... non-interactive arguments of knowledge) for NP; roughly speaking, [BCCT12b] shows that if for some sufficiently large c, any non-deterministic n c computation can be proved using an “argument of ... See full document

37

Impossibility  of  Black-Box  Simulation  Against  Leakage  Attacks

Impossibility of Black-Box Simulation Against Leakage Attacks

... non-transferable arguments/proofs that remain secure against continual leakage attacks without relying on a CRS? This problem has similarities with Open Problem ...Indeed, zero knowledge ... See full document

21

On  the  Existence  of  Three  Round  Zero-Knowledge  Proofs

On the Existence of Three Round Zero-Knowledge Proofs

... Private-coin vs Public-coin. In the study of ZK proofs, whether or not the verifier makes its random coins public or keeps them private has a strong bearing on the round-complexity. Indeed, constructing ... See full document

31

Implicit  Zero-Knowledge  Arguments   and  Applications  to  the  Malicious  Setting

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting

... implicit zero-knowledge proofs (iZK) in Section ...on zero-knowledge proofs “à la Schnorr” [Sch90] in Appendix ...ZK arguments to generically convert any protocol secure in the ... See full document

35

Constant-round  Leakage-resilient  Zero-knowledge  from  Collision  Resistance

Constant-round Leakage-resilient Zero-knowledge from Collision Resistance

... a constant-round leakage-resilient zero-knowledge argument system for NP under the assumption of the existence of collision-resistant hash function ...a ... See full document

37

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

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

... 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

31

Achieving  Constant  Round  Leakage-Resilient  Zero-Knowledge

Achieving Constant Round Leakage-Resilient Zero-Knowledge

... a constant > 0 allows the simulator to learn strictly more information about the internal secret than the actual leakage allows! Qualitatively, it means that a protocol proven to be (1 +)-LRZK “secure” ... See full document

28

Zero-knowledge  Argument  for  Polynomial  Evaluation  with  Application  to  Blacklists

Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists

... To define an argument of knowledge we follow Groth and Ishai [17] that borrowed the term witness-extended emulation from Lindell [25]. Informally, their definition says that given an adversary that produces an ... See full document

17

Proofs that Yield Nothing But Their Validity All Languages in NP Have Zero-Knowledge Proof Systems

Proofs that Yield Nothing But Their Validity All Languages in NP Have Zero-Knowledge Proof Systems

... When verifying that the modified protocol still constitutes an interactive proof system for graph nonisomorphism, we have to show that the information revealed by the verifier in Step (V[r] ... See full document

39

Leveraging zero knowledge succinct arguments of knowledge for efficient verification of outsourced training of artificial neural networks

Leveraging zero knowledge succinct arguments of knowledge for efficient verification of outsourced training of artificial neural networks

... Can Zero-Knowledge ARguments of Knowledge verify correct training of Artifical Neural Networks fulfilling the completeness, soundness, succinct and zero-knowledge ...and ... See full document

69

Client-Server  Concurrent  Zero  Knowledge  with  Constant  Rounds   and  Guaranteed  Complexity

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity

... concurrent zero knowledge considers a server that proves a statement in zero-knowledge to multiple clients in multiple concurrent sessions, where the server’s actions in a session are ... See full document

12

Predictable  Arguments  of  Knowledge

Predictable Arguments of Knowledge

... dictable arguments are secret-coin; (ii) ZAP are witness indistinguishable, whereas predictable arguments are interesting even without requiring such a ...satisfying knowledge soundness, but we do ... See full document

40

Fair  Exchange  of  Short  Signatures  without  Trusted  Third  Party

Fair Exchange of Short Signatures without Trusted Third Party

... non-interactive zero-knowledge proofs of knowledge (ZKPoK) in order to make the protocol simpler and more efficient, we require the use of random oracle [15] or some non-black box assumptions ... See full document

23

Knowledge on Nursing Process among Nurses in Selected County Referral Hospitals in Kenya

Knowledge on Nursing Process among Nurses in Selected County Referral Hospitals in Kenya

... nurses’ knowledge on nursing process in selected health care facilities in ...poor knowledge on nursing process, hence the need to implement measures to promote the nurses’ knowledge on nursing ... See full document

6

Show all 10000 documents...