Conference Template Anirudh
Conference Template Anirudh
Conference Template Anirudh
Abstract— There are many crime scenes occurring in our collection of blocks that holds data. Bitcoin, on the other
daily lives nowadays, and if they are reported to a police hand, is a type of digital currency that makes transactions
station, they must be recorded in the form of a FIR. A First through peer-to-peer networks using the Blockchain public
Information Report (FIR) is a type of complaint registration record.
that occurs in a police station to make a complaint against a
criminal for any cause. It contains basic information on the II. CONCEPT AND ALGORITHM
offence that happened, the offender, and the person who want
to submit a criminal complaint against the criminal. It contains In Blockchain concept, the data are converted into a number
basic information on the offence that happened, the offender, of blocks and each block having its own unique hash key
and the person who want to submit a criminal complaint which is generated by the SHA-256 algorithm, which
against the criminal. This procedure saves the scanned copies belongs to the SHA family, so that once a data has been
of the FIR to a regular disc or hard disc. In the instance of an entered into a block, remains the same and cannot be
E-FIR, they are stored directly on the drive or hard disc. This tampered. Also, for initial encryption of data, Hybrid AES
has a high danger of being tampered with, which means that
the data on a FIR replica can be easily changed or altered. As a
and ECC are used. Since, a data when encrypted into a
result, the criminal has a fair probability of being released.
There is no data encryption in this case. In a few cases, data
encrypted with some of the most basic algorithms can be
hacked and modified with. Encryption and decoding are done
with either AES or ECC. Both ways make it easier to crack the
hash key. As a result, the data must be encrypted with a more
powerful algorithm if it is to be maintained safe and secure
from tampering. Thus, the major objective of this project is to
use blockchain technology to safeguard encrypted data in the
cloud and to retrieve it in case someone wants to look at it. The
data is changed into a chain of blocks and remains untampered
in the cloud storage. The main goal, however, is not to recover
the stored data, but to secure it from tampering because each block, takes a few minutes of time, the encrypted blocks are
block has a unique hash key to which it is linked. Keywords— stored in a Cloud server where data can be stored and
Blockchain, AES, ECC, E-FIR, Block, Hashing, SHA 256. retrieved. For retrieval of the data, the user is provided with
a private key. Once if the key is entered, and if it matches
I. INTRODUCTION (HEADING 1) with the original key, the user can view the decrypted data
In recent years, cryptocurrency has grown in popularity and A. AES Algorithm
effectiveness in both industry and academia. Bitcoin has The Advanced Encryption Standards Algorithm is a
been a major success as one of the most successful symmetric key cryptographic algorithm published by the
cryptocurrency, with its capital market surpassing $20 NIST. Since for both encryption and decryption the same
billion in 2020. Transactions in the Bitcoin network could key is being used, it is a symmetric key algorithm.
take place without the involvement of a third party thanks to
a specially built data storage structure, and the key B. ECC Alogorithm
technology used to develop Bitcoin is blockchain, which ECC is a more emerging cryptography technology that can
was first proposed in 2008 and implemented in 2009. be used instead of RSA. It generates security between key
Blockchain is a distributed database storage system that is pairs for public key encryption using elliptic curve
non-centralized, dependable, and difficult to hack. It's a mathematics. To achieve a similar result, RSA employs
C. SHA-256 Algorithm
The Secure Hash Algorithm (SHA) 256 is a member of the
SHA 2 family of algorithms. SHA stands for Secure Hash
Algorithm. It was a joint effort between the National
Security Agency and the National Institute of Standards and
Technology to introduce a successor to the SHA 1 family,
which was slowly losing power against brute force attacks.
III. WORKING FLOW
The first and most important stage in the system is to
obtain data from the dataset. A Criminal FIR database from
kaggle.com was employed in this procedure, and it
comprises of grouped data with quantitative analysis of Encryptionand Decryption Time 0.1 ms
offenders organised by crime sections, subgroups of crime
sections, state of occurrence, and year of occurrence. These
data fields are then preprocessed, and any fields with a null Blockchain Creation Time 17 minutes
or misplaced value are replaced with a mean value. This
phase verifies that all of the database's fields have values,
guaranteeing that there are no null fields.Once after Data Retrieval Time 2-3 seconds
completing the preprocessing, the data are then converted
into a blocks using the SHA 256 algorithm. In general, it
takes a few minutes of time for a block to be created and to
be specific, it takes 17 minutes exactly for the database that IV CHARACTERISTICS OF BLOCKCHAIN
is used in this system.
As a result, the blocks are encrypted using a hybrid AES In summary, blockchain has following key characteristics.
and ECC technique before being stored in the cloud and • Decentralization. In conventional centralized transaction
retrievable when needed. Only the inspector in charge or the systems, each transaction needs to be validated through
head of the station in charge is given access to utilise the the central trusted agency (e.g., the central bank), inevitably
secret key to get the data in a particular police station. As a resulting to the cost and the performance bottlenecks at the
result, the user must fill out the query in order to retrieve central servers. Contrast to the centralized
data. The semantic search procedure begins when the query mode, third party is no longer needed in blockchain.
is given, and after all of the search queries have been given Consensus algorithms in blockchain are used to maintain
inputs, the final query with the private key displays. The data consistency in distributed network.
user must provide the private key here. • Persistency. Transactions can be validated quickly and
The user can retrieve the data that he or she is looking invalid transactions would not be admitted by honest
for if it matches the initial private key specified in the code. miners. It is nearly impossible to delete or rollback
transactions once they are included in the blockchain.
IV.********** Blocks that contain invalid transactions could be discovered
On encrypting the data, the blocks are created. And once immediately.
if the data are converted into a block, they remain • Anonymity. Each user can interact with the blockchain
unchanged. When these are blocks are created, the creation with a generated address, which does not reveal the
of block is rechecked using an IF condition. In this real identity of the user. Note that blockchain cannot
condition, there are two conditions where if the created guarantee the perfect privacy preservation due to the
block’s data matches with the original data, then it prints intrinsic constraint
“The Blockchain is valid. Decrypted msg: 0.0” • Auditability. Bitcoin blockchain stores data about user
A. Retrieval of data balances based on the Unspent Transaction Output (UTXO)
model : Any transaction has to refer to some previous
Once if the key matches with the original key provided, unspent transactions. Once the current transaction is
then the semantic searching is done by the console and it recorded into the blockchain, the state of those referred
displays the number of column fields returned to the script unspent transactions switch from unspent to spent. So
when the search is performed on the cloud. This process in transactions could be easily verified and tracked.
detail can be checked in the variable explorer. The variable
explorer box displays 4 fields which includes Name of the
V . CHALLENGES IN BLOCKCHAIN
field, Data type of the field, Size occupied by the fields and
the Values returned.
Despite the fact that blockchain technology has immense
potential for the development of future Internet services, it is
plagued by technological challenges. To begin, scalability is Young, The Technical Writer’s Handbook. Mill Valley, CA:
University Science, 1989.
a significant hurdle. A Bitcoin block can now only be 1 MB
5. P. K. Samantaray, N. K. Randhawa, and S. L. Pati, “An Efficient
in size, and a new block is mined every ten minutes. As a Multi-keyword Text Search Over Outsourced Encrypted Cloud Data
result, Bitcoin's network can only process 7 transactions per with Ranked Results”, Computational Intelligence in Data Mining, pp.
second, making it unsuitable for high-frequency trading. 31-40, 2018.
Larger blocks, on the other hand, necessitate more storage 6. Z. Fu, F. Huang, K. Ren, J. Weng, and C. Wang, “Privacy-Preserving
and take longer to propagate via the network. As fewer Smart Semantic Search Based on Conceptual Graphs Over Encrypted
Outsourced Data”, IEEE Transactions On Information Forensics And
people wish to maintain such a large blockchain, Security, vol. 12(8), pp. 1874-1884, 2017.
centralization will gradually occur. As a result, it's been 7. B. Lang, J. Wang, M. Li, and Y. Liu, “Semantic-based Compound
challenging to strike a compromise between block size and Keyword Search over Encrypted Cloud Data”, IEEE Transactions On
security. Services Computing, 2018.
8. Z. Fu, L. Xia, X. Sun, A. X. Liu, and G. Xie, “Semantic-aware
REFERENCES Searching over Encrypted Data for Cloud Computing”, IEEE
Transactions on Information Forensics and Security, vol. 13(9), pp.
2359-2371, 2018.
1. L. Zhang, Y. Zhang and H. Ma, “Privacy-Preserving and Dynamic 9. Z. Wu, and K. Li, “VBTree: forward secure conjunctive queries over
Multi-Attribute Conjunctive Keyword Search Over Encrypted Cloud encrypted data for cloud computing”, The VLDB Journal, pp. 1–22,
Data”, IEEE Access, vol. 6, pp. 34214-34225, 2018.. 2018.
2. Z. Xiangyang, D. Hua, Y. Xun, Y. Geng, and L. Xiao, “MUSE: An 10. Y. Yang, X. Liu, and R. H. Deng, “Multi-user Multi-Keyword Rank
Efficient and Accurate Verifiable Privacy-Preserving Multi-keyword Search over Encrypted Data in Arbitrary Language”, IEEE
Text Search over Encrypted Cloud Data”, Security and Transactions on Dependable and Secure Computing, 2018.
Communication Networks, vol. 2017, pp. 1-17, 2017.K. Elissa, “Title
of paper if known,” unpublished.
3. L. Chen, L. Qiu, K-C. Li, W. Shi, and N. Zhang, "DMRS: an efficient IEEE conference templates contain guidance text for
dynamic multi-keyword ranked search over encrypted cloud data", composing and formatting conference papers. Please
Soft Computing, vol. 21(16), pp. 4829–4841, 2017.. ensure that all template text is removed from your
conference paper prior to submission to the
4. R. Zhang, R. Xue, L. Liu, and L. Zheng, “Oblivious Multi-Keyword conference. Failure to remove template text from
Search for Secure Cloud Storage Service”, 2017 IEEE 24th your paper may result in your paper not being
International Conference on Web Services, pp. 269-276, 2017.M. publish