• No results found

[PDF] Top 20 Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions

Has 10000 "Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions" found on our website. Below are the top 20 most common "Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions".

Statistical  Concurrent  Non-malleable  Zero-knowledge  from  One-way  Functions

Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions

... switched from the hybrid proofs to the simulated ...the concurrent extractability), we can show this by using the concurrent extractability of CCA - CECom ...the concurrent extractor of CCA - ... See full document

38

One-Message  Zero  Knowledge   and  Non-Malleable  Commitments

One-Message Zero Knowledge and Non-Malleable Commitments

... their one-way product functions and our amplifiable one-way functions are very related, there are some notable ...For one, we make a stronger requirement than the hardness ... See full document

59

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

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

... of Knowledge Assumptions and their ...a knowledge assumption recursively for each ...a knowledge assumption transforms an adversary circuit A into another (potentially polynomially larger) circuit A ... See full document

31

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

... fully concurrent ZK ...GM11], non- malleable protocols [Bar02, PR05b, PR05a], leakage-resilient ZK [Pan14], bounded-concurrent secure com- putation [PR03, Pas04], adaptive security [GS12a], ... See full document

40

Constant-Round  Concurrent  Zero  Knowledge  From  Falsifiable  Assumptions

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

... that from a theoretical point of view, we find the notion of uniform soundness of interactive arguments as well-motivated as the one of non-uniform soundness; see ...discussion. From a ... See full document

37

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

... mations from honest-verifier zero-knowledge protocols to protocols in which the zero-knowledge property holds against arbitrary ...of one-way ...existence one- ... See full document

23

Adaptive One-way Functions and Applications

Adaptive One-way Functions and Applications

... preposterous. One cri- terion in determining the acceptability of a cryptographic assumption A is to consider (1) what the assumption is used for (for instance, to construct a primi- tive P , say) and (2) how much ... See full document

18

One-Way  Functions   and (Im)perfect  Obfuscation

One-Way Functions and (Im)perfect Obfuscation

... require from C is that it is a “witness encryption” [GGSW13] (at least according to the definition from [BCP14]) of the string ...enables one to encrypt a message m with respect to an NP-language L, ... See full document

26

Non-Interactive  Secure  Computation  from  One-Way  Functions

Non-Interactive Secure Computation from One-Way Functions

... on one way functions: resettable zero knowledge argument of knowledge and resettably sound zero knowledge ... See full document

22

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

... Resettable Zero-Knowledge. The notion of resettable zero-knowledge (rZK) was first intro- duced by Canetti, Goldreich, Goldwasser and Micali ...the zero-knowledge condition holds ... See full document

15

On  the  Existence  of  Extractable  One-Way  Functions

On the Existence of Extractable One-Way Functions

... outline one such solution, based on 1-hop homomorphic ...13]. From EOWFs to 2-message zero ...of knowledge with a 2-message WI proof ...of knowledge are not ...the one-wayness of ... See full document

42

Foundations of Cryptography   Vol  1, Basic Tools pdf

Foundations of Cryptography Vol 1, Basic Tools pdf

... specific statistical tests. The choices of statistical tests to which these programs are subjected are quite arbitrary and lack any systematic ...efficient statistical tests that will foil the ... See full document

393

Adaptively  Secure  Garbled  Circuits  from  One-Way  Functions

Adaptively Secure Garbled Circuits from One-Way Functions

... (One could hope to bypass InputDepSimGate mode altogether and define the hybrids by changing a gate directly from RealGate mode to SimGate mode. Unfortunately, this change is easily distinguishable already ... See full document

37

Estimation of Zero-Inflation Parameter in Zero-Inflated Poisson Model

Estimation of Zero-Inflation Parameter in Zero-Inflated Poisson Model

... For making inferences about the inflation parameter  of the ZIP distribution, we introduced a new estimator using the non-zero probabilities of Poisson and ZIP distribution. And the advantage of using the ... See full document

6

Secret  Sharing   and  Statistical  Zero  Knowledge

Secret Sharing and Statistical Zero Knowledge

... Aside from their theoretical interest, such secret-sharing schemes may find use in scenarios where sharing happens in the present (and thus has to be efficient) but reconstruction happens in a future where ... See full document

26

Non-malleable  Randomness  Encoders   and  their  Applications

Non-malleable Randomness Encoders and their Applications

... introduced Non-malleable Randomness Encoders as a re- laxation of NMCs, applicable in settings where randomness is ...constructed from t-state NMREs in black box ... See full document

30

Proving  the  correct  execution  of  concurrent  services  in  zero-knowledge

Proving the correct execution of concurrent services in zero-knowledge

... approval from a quorum of existing verifiers), then verifiers can agree on a single trace by employing traditional distributed consensus [27, 55], thus prevent- ing ... See full document

26

Towards  Non-Interactive  Zero-Knowledge  for  NP  from  LWE

Towards Non-Interactive Zero-Knowledge for NP from LWE

... This issue turns out to be a key one which we do not know how to handle directly. Instead, we shall bypass it by introducing and considering a generalization of OCS in which the (untrusted) prover is allowed to ... See full document

34

Privacy  Amplification  from  Non-malleable  Codes

Privacy Amplification from Non-malleable Codes

... responses from her, acting as ...responses from him, then she actually gains no additional information than what she would have in the synchronous ... See full document

37

Non-Interactive  Zero-Knowledge  Proofs  of  Non-Membership

Non-Interactive Zero-Knowledge Proofs of Non-Membership

... introduced zero-knowledge proofs with witness elimination which enable to prove that a committed message m belongs to a set L in such a way that the verifier accepts the interaction only if m does ... See full document

18

Show all 10000 documents...