Scribd
Upload
22 views15 pages

Enhanced - Security - and - Efficiency - in - Blockchain - Review2

The document discusses the challenges of current blockchain data verification methods, particularly in terms of efficiency and computational overhead, and proposes a new Blockchain Designated Verifier Proof (BDVP) system that enhances security while reducing resource requirements. The BDVP scheme allows verifiers to simulate proofs without revealing the prover's secrets and is designed to be secure against quantum attacks. Additionally, the document outlines the necessary hardware and software requirements for implementing the proposed system.

Uploaded by

Govind G
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views15 pages

Enhanced - Security - and - Efficiency - in - Blockchain - Review2

The document discusses the challenges of current blockchain data verification methods, particularly in terms of efficiency and computational overhead, and proposes a new Blockchain Designated Verifier Proof (BDVP) system that enhances security while reducing resource requirements. The BDVP scheme allows verifiers to simulate proofs without revealing the prover's secrets and is designed to be secure against quantum attacks. Additionally, the document outlines the necessary hardware and software requirements for implementing the proposed system.

Uploaded by

Govind G
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

ENHANCED SECURITY AND EFFICIENCY IN

BLOCKCHAIN WITH AGGREGATED ZERO-


KNOWLEDGE PROOF MECHANISMS
ABSTRACT

• Blockchain technology has emerged as a revolutionary tool in ensuring


data integrity and security in digital transactions.
• However, the current approaches to data verification in blockchain
systems, particularly in Ethereum, face challenges in terms of
efficiency and computational overhead.
• A system that significantly reduces the size of the proof and the
computational resources needed for its generation and verification. Our
approach represents a paradigm shift in blockchain data verification,
balancing security with efficiency.
EXISTING SYSTEM

• Zero-Knowledge Proof (ZKP) is a useful tool for proving that a


prover possesses a secret without revealing it to the verifier.
• Designated Verifier Proof (DVP) is a special type of ZKP that adds
the ability to restrict the identity of verifiers so that only pre-
determined authorized verifiers can verify.
• However, DVP and other similar schemes do not work if the verifier
provides some additional information to indicate the provenance of
the proof. While ZKPs allow for secrecy, ZKPs cannot prevent a
verifier from revealing to others the fact that the prover holds a
secret.
DISADVANTAGE

• Another challenge facing Zero Knowledge Proof technology


is scalability and performance.
• ZKP protocols can be computationally intensive, requiring
significant processing power and time, which may not be feasible
for real-time applications or systems with high transaction
volumes.
• Developing and verifying ZK-proofs can be resource- and
computationally intensive, particularly for more complicated
proofs.
PROPOSED SYSTEM

• Propose the concept of Blockchain Designated Verifier Proof


(BDVP), and design a BDVP scheme suitable for blockchain
applications.
• The key technique behind our BDVP scheme is that the verifier can
forge a fake secret to simulate the proof. Therefore, a third party
cannot determine whether the prover possesses the secret.
• This enables the verifier to protect the privacy of the prover, which
is required by law or regulation. We also address the quantum
attack problem and propose a post-quantum solution and evaluate
and compare he performances of the proposed protocol with other
related protocols.
ADVANTAGE

 In our scheme, a verifier can forge a valid signature even if the


communication records are immutable, like in the blockchain
scenario.
 The proposed BDVP uses post-quantum cryptography algorithms,
which means our scheme is secure in the era of quantum computing.
 And analyze the computing performance of the proposed schemes.
The results show that with the addition of non negotiability, the cost
is still acceptable.
SYSTEM ARCHITECTURE
SOFTWARE SPECIFICATION

HARDWARE REQUIREMENTS:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 500 GB.
• Monitor : 15 VGA Color.
• Mouse : Logitech.
• RAM : 4 GB.
SOFTWARE REQUIREMENTS:
• Operating System : Windows-10/11 (64-bit).
• Language : Python 3.10 (64-bit)
• Web Framework : Flask 3.0
• Database : MYSQL 6.0
• IDE Tools : Visual Studio Code 1.7
MODULES:

Zero-Knowledge Proof Module


Designated Verifier Proof Module
Deniable Authentication Module
Chameleon Hash Function
Module
ZERO-KNOWLEDGE PROOF MODULE:

 In ZKP there are two parties, a prover and a verifier,


that can communicate to each other. A valid ZKP
protocol must satisfy three properties:
 1) Completeness, which states that if the prover and
the verifier follow the protocol, the verifier has a very
high probability to accept the proof;
 2) Zero-Knowledge, which prevents the verifier from
learning any additional knowledge about the prover’s
secret from the execution of the protocol;
 3) Soundness, which guarantees the prover can not
fool the verifier into accepting the validity of a false
statement.
DESIGNATED VERIFIER PROOF MODULE:

 ZKP cannot avoid revealing the fact that the prover has or owns
the secret.
 ZKP with non-transferable property are required to protect
prover’s privacy. The following schemes realized the non-
transferable property.
 The protocol with designated verifier. They included the
undeniable signature as the public information. An application of
the general idea of DVP.
 They called it designated verifier signature scheme. Non-
interactive deniable authentication scheme based on designated
verifier.
 They showed that their scheme is both deniable and unforgettable
against a probabilistic polynomial time adversary, and the
performance of this scheme is better than other related schemes.
DENIABLE AUTHENTICATION MODULE:

 Deniable authentication scheme, added a party, inquisitor INQ,


to the communication between sender S and receiver R.
 INQ cannot prove that the message M was authored by S, and
also R cannot prove the fact to a third party that M was
authored by S.
 Deniable authentication protocol based on Diffie-Hellman
problem. Deniable authentication protocol based on ElGamal
signature scheme, and enable to forge a fake signature having
the same authenticator as the original signature.
 They designed a deniable authentication protocol that did not
allow the pay-TV system to prove video contents that the user
has watched to a third party over an unsecured network.
CHAMELEON HASH FUNCTION MODULE:

 Chameleon hash function (CH) is a special type of hash


function.
 A hash function is usually collision-resistant, which means
that it is computationally hard to find different inputs with
the same hash value.
 In CH, collisions can be found with trapdoor key, but
without the trapdoor, the CH is still collision-resistant.
 The signer who knows about the CH trapdoor can
collaborate with others to deny any signatures that are
designated to be verified by the same public key.
 Their protocol can achieve mutual authentication with a
much lower computational cost, and showed that it is
suitable for a realistic vehicular environment.
THANK YOU

You might also like