• No results found

zero-knowledge proof

Zero-Knowledge  Proof  of  Decryption  for  FHE  Ciphertexts

Zero-Knowledge Proof of Decryption for FHE Ciphertexts

... a zero-knowledge proof of decryption for Gentry-style schemes, and in combination with our ciphertext switching technique this resolves our motivating scenario: use a BGV-type scheme to efficiently ...

16

Transparent  Polynomial  Delegation   and  Its  Applications  to  Zero  Knowledge  Proof

Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

... Extending to other ZKP schemes. We notice that our technique can be potentially applied to generic zero knowledge proof schemes in [5, 14] to improve the verification time for circuits/con- straint ...

34

PRIVACY PRESERVING CLUSTERING ON HORIZONTALLY PARTITIONED DATA USING ZERO KNOWLEDGE PROOF

PRIVACY PRESERVING CLUSTERING ON HORIZONTALLY PARTITIONED DATA USING ZERO KNOWLEDGE PROOF

... Abstract---Zero Knowledge Proof is one of the classical construct that acts as cryptographic primitive in basic multiparty protocols implementing identification schemes and secure ...interactive ...

5

A  Note  On  Groth-Ostrovsky-Sahai  Non-Interactive   Zero-Knowledge  Proof  System

A Note On Groth-Ostrovsky-Sahai Non-Interactive Zero-Knowledge Proof System

... Non-interactive zero-knowledge (NIZK) proof in the common random string model, introduced by Blum et ...NIZK proof systems for proving a single statement about any NP ...NIZK proof ...

6

Quantum  Bit  Commitment  with  Application  in  Quantum  Zero-Knowledge  Proof

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof

... NP proof system (in which prover sends witness to verifier for verifica- tion), through zero-knowledge proof prover can convince verifier to accept without leaking anything that is hard to ...

23

An Efficient Zero-Knowledge Proof Based Identification Scheme for Securing Software Defined Network

An Efficient Zero-Knowledge Proof Based Identification Scheme for Securing Software Defined Network

... efficient Zero-knowledge proof based identification scheme for securing the SDN controller during data and control plane ...their knowledge about secrecy without revealing the actual secret or ...

9

A Zero-Knowledge Proof Based on a Multivariate Polynomial Reduction of the Graph Isomorphism Problem

A Zero-Knowledge Proof Based on a Multivariate Polynomial Reduction of the Graph Isomorphism Problem

... Abstract: Zero-Knowledge Proofs ZKP provide a reliable option to verify that a claim is true without giving detailed information other than the answer. A classical example is provided by the ZKP based in ...

9

DIZK:  A  Distributed  Zero  Knowledge  Proof  System

DIZK: A Distributed Zero Knowledge Proof System

... Authenticity of photos is crucial for journalism and investigations but is difficult to ensure due to powerful digital editing tools. One approach is to rely on special cameras that sign photos via secret keys embedded ...

30

An Improved Security enabled Distribution of Protected Cloud Storage Services by Zero Knowledge Proof based on RSA Assumption

An Improved Security enabled Distribution of Protected Cloud Storage Services by Zero Knowledge Proof based on RSA Assumption

... In the first recent work, Gentry et al [12] proposed hierarchical identity based encryption (HIBE) system that has full security for more than a constant number of levels by using identity based broadcast encryption with ...

5

Significance of Workforce Management to Organizational Performance:  A Study of Islamic Banks in Bahrain

Significance of Workforce Management to Organizational Performance: A Study of Islamic Banks in Bahrain

... When a node want to rejoin an existing ad-hoc network it should prove its identity to its neighbor nodes to access the applications and to utilize the resources. This can be achieved by Zero Knowledge ...

6

Zero-Knowledge  for   Multivariate  Polynomials

Zero-Knowledge for Multivariate Polynomials

... In [12], a very efficient zero-knowledge proof based on the MQ problem (multi- variate quadratic polynomials) is given. In this paper we proved that this con- struction can be generalized to ...

23

Compact  Zero-Knowledge  Proofs  of  Small  Hamming  Weight

Compact Zero-Knowledge Proofs of Small Hamming Weight

... a zero- knowledge proof that a committed vector has Hamming weight bounded by a given ...The proof has unconditional soundness and is very compact: It has size independent of the length of the ...

31

Commitments   and  Efficient  Zero-Knowledge  Proofs  from  Learning  Parity  with  Noise

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

... a zero-knowledge proof of knowledge is a two party protocol between a prover P and a verifier V which allows the former to convince the latter that it knows some secret piece of information ...

22

Efficient  Interval  Check  in  the  Presence  of  Malicious  Adversaries

Efficient Interval Check in the Presence of Malicious Adversaries

... Our main result is a constant-round protocol that exhibit the square of log e communication and the square of log e exponentiations with simulation-based security. At the heart of the construction is perfec- t k-ary ...

17

An  Efficient  Transform  from  Sigma  Protocols  to  NIZK  with  a  CRS   and  Non-Programmable  Random  Oracle

An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle

... interactive zero knowledge proofs (that are not proofs of ...non-interactive zero-knowledge proof is just 4 exponentiations, and the transmission of a single number in Z q (where q is ...

16

Secure  Similarity  Coefficients  Computation  with  Malicious  Adversaries

Secure Similarity Coefficients Computation with Malicious Adversaries

... regard zero-knowledge proof of knowledge as a subprotocol, and use the hybrid model in our ...the zero-knowledge proof of knowledge for ...simulation proof, ...

15

Privacy-Preserving  Multi-Party  Reconciliation  Secure  in  the  Malicious  Model (Extended  version)

Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model (Extended version)

... The algorithm for the simulator is given in Algorithm 3. The simulator starts by constructing random inputs to the real-world protocol, i.e., selecting a random ordered set of size k and constructing and sending the ...

22

Graded  Encoding  Schemes  from  Obfuscation

Graded Encoding Schemes from Obfuscation

... Assumptions. In summary, our construction uses a cyclic group in which the SDDH assumption holds, a probabilistic indistinguishability obfuscation scheme [CLTV15], a perfectly correct fully homomorphic encryption (FHE), ...

31

Computational  Soundness  of  Symbolic  Zero-knowledge  Proofs:  Weaker  Assumptions   and  Mechanized  Verification

Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification

... otherwise ⊥ is returned. iscrs(t) and iszk(t) allow us to test if t is a CRS or a (possibly invalid) zero-knowledge proof. Protocols. We use the protocol model from the CoSP framework [5]. There, a ...

36

Practical  Dual-Receiver  Encryption---Soundness,  Complete  Non-Malleability,   and  Applications

Practical Dual-Receiver Encryption---Soundness, Complete Non-Malleability, and Applications

... general zero-knowledge proof of knowledge and non-malleable non-interactive zero-knowledge (NIZK) proof, which is rather ...

29

Show all 10000 documents...

Related subjects