DOCSLIB.ORG

Enhancing the Security Through the Usage of Merkle Tree and Timestamp in Peerto Peer Messaging

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Enhancing the Security Through the Usage of Merkle Tree and Timestamp in Peerto Peer Messaging International Journal of Pure and Applied Mathematics Volume 119 No. 7 2018, 13-20 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu Special Issue ijpam.eu Enhancing the security through the usage of merkle tree and timestamp in peerto peer messaging Katyayani Sharma Dr. VairamuthuS* School of Computer Science and Engineering Associate Professor VIT University, Vellore Campus School of Computer Science and Engineering VIT Tamil Nadu, India University, Vellore Campus [email protected] Tamil Nadu, India [email protected] Abstract— One of the critical aspects of resource sharing The first distributed type of Merkle‟s authentication tree among p2p clients is security. Common security issues like trust, was Distributed Merkle Tree.This has provided authentication privacy and message integrity still extends to peers and affecting framework for decentralized systems with little trust the reliability of services over P2P. In this paper, we propose a presumptions.In order to detect the infected content peer to time stamped algorithm of merkle tree based on block chain peer streaming peer protocol (PPSPP) came into effect with concepts which provides an authentication tree that is secure against pre-image attack. The proposed algorithm is tested using the use of merkle hash tree with protection of integrity [10]. python and verified with different hash values that are generated Here we have proposed a more secure distributed merkle tree for secure messaging. hashing algorithm with the usage of timestamps to provide integrity to the data shared among the peers in messaging.The Keywords— timestamped algorithm, merkle tree , p2p clients. merkle tree concept with usage of timestamp is used in blockchain technology. The popular example of blockchain I. INTRODUCTION technology is bitcoin.Small part of hash calendar has been implemented in this paper [1]. In this not only the time but Security in peer to peer[4] messaging has been a major also integrity and identity of every piece of data can be concern even if it is decentralized system, where data and verified independently using the concept of blockchain in peer other resources are shared. Availability,confidentiality and to peer messaging. integrity comes under the properties of security in peer to peer Merkle tree is a technique of hashing a substantial messaging. Taking the security into consideration several amountof chunks of data together which depends more on algorithms are proposed such as public key certificates which bifurcating the chunks into buckets and buckets can contain involve the trusted third party and have to rely on Certified hardly any chunks and then hashing each of the bucket. This Authority that the peers can start before they exchange the process would repeat until we get the single root hash out of data among themselves. This comes under the symmetric and all hashes [3]. asymmetric encryption techniques but the keys can be Each leaf node containing the data will be appended with the compromised [6].Rivest-Shamir-Aldeman(RSA)algorithm current timestamp to provide uniqueness to the hash value which is used widely as the encryption algorithm and provides generated. The merkle tree which allows the neat procedure authenticity and confidentiality over the unsecure environment called as merkle proof. This merkle proof includes a root hash which claims to provide secure environment in peer to peer of the created tree and the arm contains all the hashes offering messaging but came across certain attacks such as the path from chunks to the root of the tree. The user scanning mathematicalattacks ,bruteforce key search attack,chosen the proof can substantiate that the hashing is at least carried cipher attack and Timing attack. To overcome this for that chunk and would be unwavering going all the way up disadvantage more secure hybrid RSA algorithm was that created tree. Hence position for that chunk can be proposed. [5] determined [3]. The distributed hash tables focused on providing security The timestamp added to each chunk present in leaf node for more complex systems. If algorithms are executed will be unique even in microseconds and would uniquely correctly but handling misbehaving nodes is general issue identify the hash value for that chunk. Subsequently, hashes [15]. generated would provide the unique value even if hashes are The application can receive inappropriate data from the generated same for the same text. A user who needs to look up system in distributed hash tables. But, the techniques for a key value on the database can ask for the merkle proof and cryptography such as path names which performs self- when received can verify that it is correct and determine the certification can be used to ignore the non-authentic actual position. It permits the procedure for authenticating the data.Aldeon is a protocol that is used for group conversations little portion of the data of hash. in peer to peer communication and this is based on novel tree Here we have used binary merkle tree which provides synchronization algorithm [16]. better structures for authenticating data when combined with *Corresponding Author 13 International Journal of Pure and Applied Mathematics Special Issue timestamp that the hash values alone in the creation of merkle Although, various other types of search trees were built tree. These trees once created are forever frozen so over distributed hash trees or other distributed trees, these confidentiality is maintained. Root of the data depends not on cannot be used to execute a distributed merkle trees or fulfill the order but on the data in which it is updated. So we make the prerequisites for data authentication over peer to peer sure that the entire tree should not be recomputed if any environment as these constructed trees are static and not updating is initiated. concentrating on authentication part- which is susceptible to structural alterations due to hash function in cryptography. II. RELATED WORK 6. Security in p2p systems The authentication problem is handled directly using per- 1. Public key certificates object signatures. Various DHTs are constructed to allow In order to send the message to a second user, the first user notable failure of network-node. Existing p2p systems support encrypts the message with public key of the recipient and rudimentary authentication service for data fetched of sign all routes the message using recipient‟s IP address. It does not type, where source sign the materials individually. need to go through any central server or to be relied on CA or Authentication includes the data with self- certification where any DNS. Once the two users know each other‟s public key huge chunks of data are divided into blocks and kept as certificate then they can start to exchange the messages. The IP autonomous objects in system and are put together by using addresses and the public keys in user‟s public key certificate collision resistant in few tree hierarchy where root block is are important in enabling communication besides keeping it signed. private and secure. This claimed to be secure as the there is no 7. Rivest- Shamir- Adleman (RSA) algorithm store and forward mechanism involved in transmission of It is a widely used encryption method that claims message. authenticity and confidentiality over unsecure channel. This 2. Merkle tree algorithm has certain drawbacks associated with it such as mathematical attacks, chosen cipher attacks, timing attacks and The Merkle tree is an easy cryptographic creation for brute force attacks. In order to avoid this, a hybrid version of certifying set membership. The balanced tree and a collision- RSA was given to be implemented in peer to peer messaging. It resistant hash function for cryptography such as SHA-1 are main peer to peer messaging would be strong enough to resist used to generate a small illustration for cryptography of a attacks and would allow only authenticated user to substantial data. Taken set‟s elements are kept at the leaf nodes communicate to the sender. Multiple chats can be initiated but and hash signature of concatenating the leaf node values is put have to wait for authentication procedure. Similarly, in at internal nodes. The root node value which plays a vital role decryption process Chinese remainder theorem is used which is is signed and validated and the collision resistant attribute further extended to Gaussian integer for better efficiency. [5] claims that is authenticated from leaf nodes to root of the tree. Certification procedure that an element is part of the set is done 8. Elliptic curve cryptography by verification path to re-compute the authentic value of the A public key cryptography which is used by bit coin, root node. Updates which are performed are managed with transport layer security (TLS), secure shell (SSL), Austrian e- complexity which is proportional to height of the formed tree. card. Elliptic curve public keys can directly derive bit coin It is not a distributed merkle tree. addresses. And transactions are authenticated by this algorithm. 3. Authenticated data structures The datasets in SSH involves elliptic curve Diffie Hellman server key exchange messages, public host keys and signatures A third party model in which a trusted data source creates [13]. data and replicates it at various un-trusted responders that replies for the user. Signature amortization is similar to merkle tree which was drafted to the supported query type. This was III. PROPOSED SCHEME carried out on advancing authenticated data structures for many Peer to peer environment is created on which the security types of queries. They do not capture the p2p networks because needs to be applied. The messages are exchanged between the of the associated model of outsourced database systems which peers and current time is recorded for every message sent and studied where SQL queries are supplied over databases that received.
Load more

Recommended publications
  • Angela: a Sparse, Distributed, and Highly Concurrent Merkle Tree
    Angela: A Sparse, Distributed, and Highly Concurrent Merkle Tree Janakirama Kalidhindi, Alex Kazorian, Aneesh Khera, Cibi Pari Abstract— Merkle trees allow for efficient and authen- with high query throughput. Any concurrency overhead ticated verification of data contents through hierarchical should not destroy the system’s performance when the cryptographic hashes. Because the contents of parent scale of the merkle tree is very large. nodes in the trees are the hashes of the children nodes, Outside of Key Transparency, this problem is gen- concurrency in merkle trees is a hard problem. The eralizable to other applications that have the need current standard for merkle tree updates is a naive locking of the entire tree as shown in Google’s merkle tree for efficient, authenticated data structures, such as the implementation, Trillian. We present Angela, a concur- Global Data Plane file system. rent and distributed sparse merkle tree implementation. As a result of these needs, we have developed a novel Angela is distributed using Ray onto Amazon EC2 algorithm for updating a batch of updates to a merkle clusters and uses Amazon Aurora to store and retrieve tree concurrently. Run locally on a MacBook Pro with state. Angela is motivated by Google Key Transparency a 2.2GHz Intel Core i7, 16GB of RAM, and an Intel and inspired by it’s underlying merkle tree, Trillian. Iris Pro1536 MB, we achieved a 2x speedup over the Like Trillian, Angela assumes that a large number of naive algorithm mentioned earlier. We expanded this its 2256 leaves are empty and publishes a new root after algorithm into a distributed merkle tree implementation, some amount of time.
    [Show full text]
  • Enabling Authentication of Sliding Window Queries on Streams
    Proof­Infused Streams: Enabling Authentication of Sliding Window Queries On Streams Feifei Li† Ke Yi‡ Marios Hadjieleftheriou‡ George Kollios† †Computer Science Department Boston University ‡AT&T Labs Inc. lifeifei, gkollios @cs.bu.edu yike, marioh @research.att.com { } { } ABSTRACT As computer systems are essential components of many crit- ical commercial services, the need for secure online transac- . tions is now becoming evident. The demand for such appli- cations, as the market grows, exceeds the capacity of individ- 0110..011 ual businesses to provide fast and reliable services, making Provider Servers outsourcing technologies a key player in alleviating issues Clients of scale. Consider a stock broker that needs to provide a real-time stock trading monitoring service to clients. Since Figure 1: The outsourced stream model. the cost of multicasting this information to a large audi- ence might become prohibitive, the broker could outsource providers, who would be in turn responsible for forwarding the stock feed to third-party providers, who are in turn re- the appropriate sub-feed to clients (see Figure 1). Evidently, sponsible for forwarding the appropriate sub-feed to clients. especially in critical applications, the integrity of the third- Evidently, in critical applications the integrity of the third- party should not be taken for granted, as the latter might party should not be taken for granted. In this work we study have malicious intent or might be temporarily compromised a variety of authentication algorithms for selection and ag- by other malicious entities. Deceiving clients can be at- gregation queries over sliding windows. Our algorithms en- tempted for gaining business advantage over the original able the end-users to prove that the results provided by the service provider, for competition purposes against impor- third-party are correct, i.e., equal to the results that would tant clients, or for easing the workload on the third-party have been computed by the original provider.
    [Show full text]
  • Providing Authentication and Integrity in Outsourced Databases Using Merkle Hash Tree’S
    Providing Authentication and Integrity in Outsourced Databases using Merkle Hash Tree's Einar Mykletun Maithili Narasimha University of California Irvine University of California Irvine [email protected] [email protected] Gene Tsudik University of California Irvine [email protected] 1 Introduction In this paper we intend to describe and summarize results relating to the use of authenticated data structures, specifically Merkle Hash Tree's, in the context of the Outsourced Database Model (ODB). In ODB, organizations outsource their data management needs to an external untrusted service provider. The service provider hosts clients' databases and offers seamless mechanisms to create, store, update and access (query) their databases. Due to the service provider being untrusted, it becomes imperative to provide means to ensure authenticity and integrity in the query replies returned by the provider to clients. It is therefore the goal of this paper to outline an applicable data structure that can support authenticated query replies from the service provider to the clients (who issue the queries). Merkle Hash Tree's (introduced in section 3) is such a data structure. 1.1 Outsourced Database Model (ODB) The outsourced database model (ODB) is an example of the well-known Client-Server model. In ODB, the Database Service Provider (also referred to as the Server) has the infrastructure required to host outsourced databases and provides efficient mechanisms for clients to create, store, update and query the database. The owner of the data is identified as the entity who has to access to add, remove, and modify tuples in the database. The owner and the client may or may not be the same entity.
    [Show full text]
  • The SCADS Toolkit Nick Lanham, Jesse Trutna
    The SCADS Toolkit Nick Lanham, Jesse Trutna (it’s catching…) SCADS Overview SCADS is a scalable, non-relational datastore for highly concurrent, interactive workloads. Scale Independence - as new users join No changes to application Cost per user doesn’t increase Request latency doesn’t change Key Innovations 1. Performance safe query language 2. Declarative performance/consistency tradeoffs 3. Automatic scale up and down using machine learning Toolkit Motivation Investigated other open-source distributed key-value stores Cassandra, Hypertable, CouchDB Monolithic, opaque point solutions Make many decisions about how to architect the system a -prori Want set of components to rapidly explore the space of systems’ design Extensible components communicate over established APIs Understand the implications and performance bottlenecks of different designs SCADS Components Component Responsibilities Storage Layer Persist and serve data for a specified key responsibility Copy and sync data between storage nodes Data Placement Layer Assign node key responsibilities Manage replication and partition factors Provide clients with key to node mapping Provides mechanism for machine learning policies Client Library Hides client interaction with distributed storage system Provides higher-level constructs like indexes and query language Storage Layer Key-value store that supports range queries built on BDB API Record get(NameSpace ns, RecordKey key) list<Record> get_set (NameSpace ns, RecordSet rs ) bool put(NameSpace ns, Record rec) i32 count_set(NameSpace ns, RecordSet rs) bool set_responsibility_policy(NameSpace ns,RecordSet policy) RecordSet get_responsibility_policy(NameSpace ns) bool sync_set(NameSpace ns, RecordSet rs, Host h, ConflictPolicy policy) bool copy_set(NameSpace ns, RecordSet rs, Host h) bool remove_set(NameSpace ns, RecordSet rs) Storage Layer Storage Layer Storage Layer: Synchronize Replicas may diverge during network partitions (in order to preserve availability).
    [Show full text]
  • Authentication of Moving Range Queries
    Authentication of Moving Range Queries Duncan Yung Eric Lo Man Lung Yiu ∗ Department of Computing Hong Kong Polytechnic University {cskwyung, ericlo, csmlyiu}@comp.polyu.edu.hk ABSTRACT the user leaves the safe region, Thus, safe region is a powerful op- A moving range query continuously reports the query result (e.g., timization for significantly reducing the communication frequency restaurants) that are within radius r from a moving query point between the user and the service provider. (e.g., moving tourist). To minimize the communication cost with The query results and safe regions returned by LBS, however, the mobile clients, a service provider that evaluates moving range may not always be accurate. For instance, a hacker may infiltrate queries also returns a safe region that bounds the validity of query the LBS’s servers [25] so that results of queries all include a partic- results. However, an untrustworthy service provider may report in- ular location (e.g., the White House). Furthermore, the LBS may be correct safe regions to mobile clients. In this paper, we present effi- self-compromised and thus ranks sponsored facilities higher than cient techniques for authenticating the safe regions of moving range actual query result. The LBS may also return an overly large safe queries. We theoretically proved that our methods for authenticat- region to the clients for the sake of saving computing resources and ing moving range queries can minimize the data sent between the communication bandwidth [22, 16, 30]. On the other hand, the LBS service provider and the mobile clients. Extensive experiments are may opt to return overly small safe regions so that the clients have carried out using both real and synthetic datasets and results show to request new safe regions more frequently, if the LBS charges fee that our methods incur small communication costs and overhead.
    [Show full text]
  • Executing Large Scale Processes in a Blockchain
    The current issue and full text archive of this journal is available on Emerald Insight at: www.emeraldinsight.com/2514-4774.htm JCMS 2,2 Executing large-scale processes in a blockchain Mahalingam Ramkumar Department of Computer Science and Engineering, Mississippi State University, 106 Starkville, Mississippi, USA Received 16 May 2018 Revised 16 May 2018 Abstract Accepted 1 September 2018 Purpose – The purpose of this paper is to examine the blockchain as a trusted computing platform. Understanding the strengths and limitations of this platform is essential to execute large-scale real-world applications in blockchains. Design/methodology/approach – This paper proposes several modifications to conventional blockchain networks to improve the scale and scope of applications. Findings – Simple modifications to cryptographic protocols for constructing blockchain ledgers, and digital signatures for authentication of transactions, are sufficient to realize a scalable blockchain platform. Originality/value – The original contributions of this paper are concrete steps to overcome limitations of current blockchain networks. Keywords Cryptography, Blockchain, Scalability, Transactions, Blockchain networks Paper type Research paper 1. Introduction A blockchain broadcast network (Bozic et al., 2016; Croman et al., 2016; Nakamoto, 2008; Wood, 2014) is a mechanism for creating a distributed, tamper-proof, append-only ledger. Every participant in the broadcast network maintains a copy, or some representation, of the ledger. Ledger entries are made by consensus on the states of a process “executed” on the blockchain. As an example, in the Bitcoin (Nakamoto, 2008) process: (1) Bitcoin transactions transfer Bitcoins from a wallet to one or more other wallets. (2) Bitcoins created by “mining” are added to the miner’s wallet.
    [Show full text]
  • IB Case Study Vocabulary a Local Economy Driven by Blockchain (2020) Websites
    IB Case Study Vocabulary A local economy driven by blockchain (2020) Websites Merkle Tree: https://blockonomi.com/merkle-tree/ Blockchain: https://unwttng.com/what-is-a-blockchain Mining: https://www.buybitcoinworldwide.com/mining/ Attacks on Cryptocurrencies: https://blockgeeks.com/guides/hypothetical-attacks-on-cryptocurrencies/ Bitcoin Transaction Life Cycle: https://ducmanhphan.github.io/2018-12-18-Transaction-pool-in- blockchain/#transaction-pool 51 % attack - a potential attack on a blockchain network, where a single entity or organization can control the majority of the hash rate, potentially causing a network disruption. In such a scenario, the attacker would have enough mining power to intentionally exclude or modify the ordering of transactions. Block - records, which together form a blockchain. ... Blocks hold all the records of valid cryptocurrency transactions. They are hashed and encoded into a hash tree or Merkle tree. In the world of cryptocurrencies, blocks are like ledger pages while the whole record-keeping book is the blockchain. A block is a file that stores unalterable data related to the network. Blockchain - a data structure that holds transactional records and while ensuring security, transparency, and decentralization. You can also think of it as a chain or records stored in the forms of blocks which are controlled by no single authority. Block header – main way of identifying a block in a blockchain is via its block header hash. The block hash is responsible for block identification within a blockchain. In short, each block on the blockchain is identified by its block header hash. Each block is uniquely identified by a hash number that is obtained by double hashing the block header with the SHA256 algorithm.
    [Show full text]
  • Efficient Verification of Shortest Path Search Via Authenticated Hints Man Lung YIU Hong Kong Polytechnic University
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Institutional Knowledge at Singapore Management University Singapore Management University Institutional Knowledge at Singapore Management University Research Collection School Of Information Systems School of Information Systems 3-2010 Efficient Verification of Shortest Path Search Via Authenticated Hints Man Lung YIU Hong Kong Polytechnic University Yimin LIN Singapore Management University, [email protected] Kyriakos MOURATIDIS Singapore Management University, [email protected] DOI: https://doi.org/10.1109/ICDE.2010.5447914 Follow this and additional works at: https://ink.library.smu.edu.sg/sis_research Part of the Databases and Information Systems Commons, and the Numerical Analysis and Scientific omputC ing Commons Citation YIU, Man Lung; LIN, Yimin; and MOURATIDIS, Kyriakos. Efficient Verification of Shortest Path Search Via Authenticated Hints. (2010). ICDE 2010: IEEE 26th International Conference on Data Engineering: Long Beach, California, USA, 1 - 6 March 2010. 237-248. Research Collection School Of Information Systems. Available at: https://ink.library.smu.edu.sg/sis_research/507 This Conference Proceeding Article is brought to you for free and open access by the School of Information Systems at Institutional Knowledge at Singapore Management University. It has been accepted for inclusion in Research Collection School Of Information Systems by an authorized administrator of Institutional Knowledge at Singapore Management University.
    [Show full text]
  • Redactable Hashing for Time Verification
    Technical Disclosure Commons Defensive Publications Series January 2021 Redactable Hashing for Time Verification Jan Schejbal Follow this and additional works at: https://www.tdcommons.org/dpubs_series Recommended Citation Schejbal, Jan, "Redactable Hashing for Time Verification", Technical Disclosure Commons, (January 24, 2021) https://www.tdcommons.org/dpubs_series/3999 This work is licensed under a Creative Commons Attribution 4.0 License. This Article is brought to you for free and open access by Technical Disclosure Commons. It has been accepted for inclusion in Defensive Publications Series by an authorized administrator of Technical Disclosure Commons. Schejbal: Redactable Hashing for Time Verification REDACTABLE HASHING FOR TIME VERIFICATION Cryptographic hashes (outputs of cryptographically secure hash functions) are used to uniquely identify secret information without making such information public. A cryptographic hash function is a deterministic computation that produces the same outputs for the same inputs while ensuring that even a small change of the input (e.g., a change of only one or several bits) results in an unpredictable output that has little resemblance to the original (unmodified) input. Furthermore, it is not possible to efficiently find an input matching a certain hash value or two different inputs having the same hash value; an attacker that attempts to do so would need to test numerous values until one matches, which is computationally infeasible for a sufficiently large space of possible values. The quasi-randomness property of hashes makes them useful for mapping protected information while ensuring that the information is not easily discoverable by a malicious attacker or an unauthorized viewer. Hashes can be used to derive cryptographic keys from other (strong or even weak) cryptographic material.
    [Show full text]
  • "On Merkle Trees", Dr Craig S Wright
    On Merkle Trees Dr Craig S Wright By now, it should be well understood that Bitcoin utilises the concept of a Merkle tree to its advantage; by way of background, we provide an explanation in this post. The following aids as a technical description and definition of similar concepts used more generally in Bitcoin and specifically within SPV. Merkle trees are hierarchical data structures that enable secure verification of collections of data. In a Merkle tree, each node in the tree has been given an index pair (i, j) and is represented as N(i, j). The indices i, j are simply numerical labels that are related to a specific position in the tree. An important feature of the Merkle tree is that the construction of each of its nodes is governed by the following (simplified) equations: 퐻(퐷 ) 푖 = 푗 푁(푖, 푗) = { 푖 , 퐻(푁(푖, 푘) ∥ 푁(푘 + 1, 푗)) 푖 ≠ 푗 where 푘 = (푖 + 푗 − 1)⁄2 and H is a cryptographic hash function. A labelled, binary Merkle tree constructed according to the equations is shown in figure 1, from which we can see that the i = j case corresponds to a leaf node, which is simply the hash of the th corresponding i packet of data Di. The 푖 ≠ 푗 case corresponds to an internal or parent node, which is generated by recursively hashing and concatenating child nodes, until one parent (the Merkle root) is found. Figure 1. A Merkle tree. For example, the node 푁(1,4) is constructed from the four data packets 퐷1, … , 퐷4 as 푁(1,4) = 퐻(푁(1,2) ∥ 푁(3,4)) .
    [Show full text]
  • Practical Authenticated Pattern Matching with Optimal Proof Size
    Practical Authenticated Pattern Matching with Optimal Proof Size Dimitrios Papadopoulos Charalampos Papamanthou Boston University University of Maryland [email protected] [email protected] Roberto Tamassia Nikos Triandopoulos Brown University RSA Laboratories & Boston University [email protected] [email protected] ABSTRACT otherwise. More elaborate models for pattern matching involve We address the problem of authenticating pattern matching queries queries expressed as regular expressions over Σ or returning multi- over textual data that is outsourced to an untrusted cloud server. By ple occurrences of p, and databases allowing search over multiple employing cryptographic accumulators in a novel optimal integrity- texts or other (semi-)structured data (e.g., XML data). This core checking tool built directly over a suffix tree, we design the first data-processing problem has numerous applications in a wide range authenticated data structure for verifiable answers to pattern match- of topics including intrusion detection, spam filtering, web search ing queries featuring fast generation of constant-size proofs. We engines, molecular biology and natural language processing. present two main applications of our new construction to authen- Previous works on authenticated pattern matching include the ticate: (i) pattern matching queries over text documents, and (ii) schemes by Martel et al. [28] for text pattern matching, and by De- exact path queries over XML documents. Answers to queries are vanbu et al. [16] and Bertino et al. [10] for XML search. In essence, verified by proofs of size at most 500 bytes for text pattern match- these works adopt the same general framework: First, by hierarchi- ing, and at most 243 bytes for exact path XML search, indepen- cally applying a cryptographic hash function (e.g., SHA-2) over the dently of the document or answer size.
    [Show full text]
  • Keyless Signature Infrastructure for Digital India's Security
    ISSN (Online) 2456 -1304 International Journal of Science, Engineering and Management (IJSEM) Vol 4, Issue 10, October 2019 Keyless Signature Infrastructure for Digital India’s Security [1] Mridul Sharma, [2]Rupali Sharma [1][2] University Institute of Engineering, Rayat Bahra University, Mohali, Punjab, India Abstract— In the making of new Digital India there are lots of threats which are there in the path of this dream. Acts of data breach of AADHAAR and Bank Accounts due to the lack of security in our digital services are common but the world is now, moving towards digital era so to be with the world in this digital transformation we must work on our security enhancement to provide a secure platform to government organisations. To serve the three aspects of security that is confidentiality, integrity, and availability of data we need an infrastructure that ensures all these. The Blockchain-Based KSI is the new technology which will support the government of India to achieve its goal of ensuring secure digital Services. It will help the government in providing strong authentication through digital signatures, and will also give the citizens a trust that their PII data is secure and confidential so that they can use these digital services for their all daily work. On the inspiration from Estonia where all their government services are digital in a way such that every government work from issuing a birth certificate to passport verification all these tasks are done digitally. This paper is made to help India in the implementation of this powerful Infrastructure for the digital governmental services providing ease to people and bureaucrats.
    [Show full text]