3.4.2. Color Spectrum Chain of Online Certificate Status Protocol
Generally, a method of verifying the delegation certificate of the SCVP method using the CRL and a method using the online certificate status protocol (OCSP) are available.
For OCSP, when the user queries the OCSP server about the status of a specific certificate, the OCSP server notifies the user only whether the OCSP server has canceled the certificate so that the user need not download the list of all canceled certificates.
In addition, it can be used efficiently by performing real-time verification of certificate status between client and server. The request message and response message of OCSP and the extended area used at this time are as follows: The OCSP request message consists of protocol version, service request, and target certificate ID as well as optional extensions processed by the OCSP responder. The OCSP response message consists of the version of the response format, the name of the responder, the response to each certificate contained in the request, the optional extension, the signature algorithm OID (object identifier), and the signature value for the compressed response message. The response to each certificate included in the request consists of the ID of the certificate for which the current status is to be known, the certificate status value, the response validity interval, and the optional extensions. Here, the certificate status value is expressed as GOOD, REVOKED, or UNKNOWN. The extensions of OCSP are additionally included in the request and response messages and processed by the OCSP responder as follows:
Nonce: Prevents the replay attack when exchanging request message and response message.
CRL reference: indicates information about the CRL referenced by the OCSP responder.
Acceptable Response Types: the response message types that OCSP clients understand are classified as OID and are included in the request message.
Archive Cutoff: value minus the time of OCSP responder storing the revocation information after certificate revocation from the time of issuing the OCSP response message.
CRL Entry Extensions: the one referred to in Request For Comments (RFC) 2459 is used.
Service Locator: used when a particular server receives a request message, which is subsequently forwarded to a trusted OCSP server with a validated certificate.
This is standardized in IETF RFC 2560, and we used “Archive Cutoff” in the OCSP extension for the long-term verification of expired certificates.
3.4.3. Efficient Long-Term Verification of Electronic Documents Color Spectrum Chain
The long-term verification of a digitally signed electronic document requires the verification of own certificate, certificate path validation and policy verification, and verification of the status of the certificate to validate; therefore, if the certificate does not have the relevant information in the electronic document or has only the certificate status information, judging whether the certificate is a valid certificate cannot guarantee the integrity and authenticity of the corresponding electronic document.
As such, we verify the certificate against the digital signature of the electronic document stored in the SCVP client using the SCVP server standardized in RFC 5055.
Here, the client is assumed to store an electronic document containing a complete certificate as well as related information digitally signed through a public certificate issued by a public certification authority.
The SCVP server and the SCVP client communicate with each other through the SCVP Tool Kit (API, application program interface). The SCVP server and the certificate authority (CA) can communicate with each other through the existing PKI tool kit.
It is the basic process structure of the certificate status checking API of electronic documents between the SCVP client and SCVP server certification authority.
- (1)
SCVP Request: the client who wants to verify the electronic document selects the appropriate certificate verification method (CRL or OCSP) and sends a certificate validation request message to the SCVP server.
- (2)
CRL Request/OCSP Request (OCSP Request): the SCVP server requests the certification authority (HTTP, LDAP, OCSP, etc.) to verify the certificate based on the certificate verification request from the client.
- (3)
CRL Acquisition/OCSP Response (OCSP Response): the SCVP server acquires the response message of the verification request received from the certification authority.
- (4)
SCVP Response (certificate verification process response): the verification result is sent to the client based on the response message of the verification request.
- (5)
Certificate Verification Completed: the client completes the verification of the target certificate based on the result of the SCVP Response.
For the long-term verification of digitally signed electronic documents, the client requests certificate verification to the SCVP server. At this time, the client selects a certificate revocation list (CRL) or an OCSP method to verify the electronic document possessed by the client and transmits a certificate verification request message. The CRL request message is used for verifying whether or not the certificate is discarded to a specific certification authority, including certificate path verification and policy verification.
At this time, the SCVP server and the specific CA can communicate with each other via hypertext transfer protocol (HTTP), lightweight directory access protocol (LDAP), and the like. Upon receiving the certificate verification processing request message from the client, the SCVP server transmits a CRL request message to the certification authority based on the certificate verification request message.
The SCVP server receives from the CA a response message to the certificate verification request. At this time, the response message can be processed on the precondition that the certification authority verifies the certificate based on the CRL.
Then, the SCVP server sends an OCSP request message to the certification authority based on the certificate verification request message. The OCSP request message is for requesting a specific certification authority to check the real-time status of the corresponding certificate.
At this time, the specific certification authority may be the same or a different certification authority to which the CRL request message is transmitted. When the certificate verification request is made, the certification authority performs verification of the corresponding certificate based on the OCSP and transmits the verification result (GOOD, REVOKED, UNKNOWN) to the SCVP server. Certificate verification is performed using only the current certificate.
Therefore, in this case, the verification is stopped for the certificate whose validity period has expired, and only the verification result “REVOKED” is transmitted to the SCVP server; hence the impossibility of long-term verification of the digital signature.
In order to solve this problem and proceed with the long-term verification without stopping the verification even when the validity period of the certificate expires, an extended field is added to the OSCP response message to inform the certificate revocation time information. In other words, the OSCP response message is implemented using the archive cutoff, which is an extension of the OCSP standard.
“Archive Cutoff” is the time minus that when the OCSP respondent retained the revocation information after revoking the certificate from the time the OCSP response message was issued. This is used to verify the authenticity of the signature value generated on the cutoff date, even if the certificate was revoked a long time ago, to verify the signature value.
For example, if the data of “Archive cutoff = 2003.1.1” is recorded in the response message of the verification result, this OCSP means that it has the revocation information of the certificates after 2003. 1.1.
Therefore, when the SCVP server receives the OSCP response message, it verifies the verification result in the response message; if it is “REVOKED,” it searches the extended field and checks the revocation time field of the revoked information. If the certificate is revoked before the digital signature is made, the digital signature is invalidated. If the certificate is revoked after the digital signature is made, the digital signature is valid.
Finally, the SCVP server sends to the client a certificate verification processing response based on the OSCP response message. The client completes the certificate verification based on the certificate verification processing response message received from the SCVP server.
In other words, the client can obtain the validation information with regard to the validity of the digital signature certificate according to the contents of the certificate verification processing response message and check the validity and authenticity of the digital signature document stored by the client according to the obtained verification information.
Therefore, even when the validity period of the certificate expires, it is possible to carry out long-term verification without interrupting the verification and to verify the certificate since the revocation information of the expired certificate is maintained.
3.4.4. Identity-Based Cryptographic Verification Color Spectrum Chain
This is a new public key authentication scheme proposed by Adi Shamir in 1984. The cryptosystem uses the user’s identity information as the public key of the user and replaces the complex key value of the existing public key scheme. The TTP (trust third party) generates the private key using the user’s identity information and transmits it securely to the user. TTP should be absolutely trusted. The process of deriving the private key from the user’s identity information should be performed entirely by the TTP. If there is a dispute between users, the trust authority acts as a mediator of the dispute as the authority that generated each user’s private key. In Adi Shamir ‘s proposal, the digital signing scheme was suggested, but not the password transfer algorithm based on identity information; only a concept was presented.
Also the secret-key is being developed as DES, 3DES, AES and etc have a secret key. Moreover, the secret-key cryptographic algorithm is an algorithm that allows a person who knows the key to view the encrypted document without revealing the key used for encryption to the general public. The secret-key encryption algorithm has the same encryption key and decryption key. With this property the secret-key encryption algorithm is also called a symmetric-key encryption algorithm. Therefore in order to use the secret-key encryption algorithm in the communication both parties to communicate must share the encryption key in advance. In order to generate a key there are methods of generating a key using a random number generator included in a computer or other device and a method of directly generating a key by a user. A key generated by using a random number generator is strong in an attack method in which a key is predicted and substituted like a dictionary attack but the user has difficulty in memorizing a key. On the other hand the user-generated method is easy for the user to remember the key but vulnerable to the key predictive attack method. Among the conflicting concepts there is a public-key infrastructure algorithm. Basically, it is a type of cipher that allows users who do not share the secret key in advance to communicate securely. In the public key cryptosystem. There exists a public-key and a secret key. Anyone can know the public-key but the corresponding secret-key must be known only to the owner of the key. The algorithm for constructing the public-key cryptosystem is called asymmetric cryptosystem in comparison with the symmetric key cryptosystem, Rivest Shamir Adleman (RSA), Data Acquisition System (DAS), Diffie–Hellman and others.
(1) Pairing-Based Identity-Based Cryptosystem
In 2001 Dan Boneh and Matt Franklin presented a practical implementation by proposing an identity-based cryptosystem according to Weil Pairing based on elliptic curves. Identity-based cryptography was implemented by applying a mathematical structure called a bilinear map.
The operator used in the expression above represents the product of the points on the elliptic curve. The multiplication itself is easy, but it is impossible to know
X and a ∙
X and find
a. The key server generates s and P from the random numbers and notifies all users of the P and s ∙ PP values. Next, s ·
ID as the private key of user x is computed and transmitted to the user. The ciphertext procedure using these values is shown in
Figure 5.
Sender Bob sets a random number and computes the following symmetric key:
Here,
s ∙
P is a value notified by the key server, and
r ∙
ID is a value calculated by using all open values. It is encrypted with the generated key k for the next message m. It sends the ciphertext E [m] and
r ∙
P to Receiver Alice, who calculates the decryption key for protection as follows:
The generated decryption key is Alice’s private key distributed to Alice—called s ∙ ID—and r P is the value that Bob sends to Alice. The private key value is known only to Alice; and decryption of ciphertext is possible only by Alice. And finally we do not use K-defined equations
(2) Session Key Generation Protocol
In the IoT network, a session key must be generated between the access server and the core server for mutual authentication. For the session key, we propose a session key generation protocol based on ID-based encryption. This protocol is used in session key generation protocol, device registration and authentication protocol, and proposal system.
3.4.5. Color Spectrum Chain Security Performance Verification Method
A color spectrum chain means that the structure of a block is not defined. This also means that the attributes making up the block are not structured. Since existing blockchains are structured with continuous bits, there are limitations in applying them to digital coins suitable for various services.
The elements constituting the informal chain have hash points considering extended chains in order not to use the fork method. Hash point is a structure for linking other chains considering the fact that the existing chain structure should be expanded. If the existing blockchain exchanges blocks through fork with a P2P–P2P independent chain structure, the unstable network suspension behavior through these forks will not create a full agreement between Peer and Peer. Therefore, we have devised a way of maintaining the connection link using the extension.
In addition to adding fields and adding and modifying tables in existing databases, extension can be done using hash pointers to elements of the formatting block, just like adding a field to refer to the table’s index.
These extensions can create processes for the interworking of various services and become flexible because the nodes in the central network can apply spontaneous extensions.
If the length of the existing block is set to the standardized size, the informal chain allows the length of the block to be varied.
Since the length of the variable block can go to an infinite increase of the block, the concept of time to limit it is applied to induce the limit block increase; thus preventing the overflow of the transaction.
Competing for compensation aids in rational decision making, and rational opinions are classified as either formal or interdependent. The transaction recorded in the block is held for each node. The problem is that the risk must be distributed in such a way that all the nodes that are in each case are synchronously involved, and the risk must be modified in various ways. All that is needed is a book on individual transactions. It is important that the books for individual transactions be rebased. This should rebase the transaction of the node wherein the proof of the block is confirmed.
All the resource holding behaviors of the participating nodes want compensation. It is necessary to publicize what is most suitable for compensation during the resource holding act and share it reasonably.
In order not to undermine such reasonable sharing, it is necessary to determine a reasonable price for compensation that has a positive formation.
Note, however, that such reasonable price decision should make the mode node fall into the prisoner’s dilemma. This is to avoid making the most dangerous decisions for the prisoner’s dilemma and to reduce these risk factors so that decisions are best served. A game is required to induce competitive participation. This color spectrum chain plays a role in extracting information about the process of the transaction. The path of information is not the right to have a particular place, but the subject who created it has rights. If the entity that generated the information is recorded on a particular platform with the value of this information, and it wants to be compensated through the value of the record, the attribute of the value can be said to have been transferred. The challenge lies in proving that the transfer of these values is their own initiative value.
Comparing whether values’ interpretations have responses can also be a Byzantine factor. The interpretation of value differs in magnitude of extensibility when different purposes are applied differently. The problem is that Nash believes this to be contrary to his theory because it means that it has a variant variable.
Even if a key session key used only once for each communication is known, it is defined that only one communication is decrypted and another session key is used in the next communication. The process is defined in the SSL connection process. In the SSL server authentication step the web browser authenticates the other web server. This step is a function to authenticate whether or not the client has been issued from the trusted CA and the SSL client authentification step is the step of authenticating the client that the Web server has requested. In this step the SSL-enabled software or SSL heardwares placed in front of the server examine whether the certificate of the client and the public ID actually received a certificate that the server trusts. It then goes through the encrypt connection step
Figure 6.
(1) Color Spectrum Chain Architecture Design
—Uses a proprietary PCIe optical interface card.
—Eliminates the extra memory buffering behavior for interfaces to the storage media termination.
—Uses multi-channel PCIe optical interface card to improve Input/Output Operations Per Second (IOPS) performance (SPC1).
—Has improved throughput performance (SPC2) (single bus interface from PCIe to the storage media termination).
—Has high performance with “All-Flow PCIe”.
—Uses HBA card that requires memory buffering such as Fiber Channel and Infiniband—Performance degradation.
—Uses multi-channel HBA card to improve IOPS performance (SPC1).
—Has throughput performance (SPC2) improvement constraint (heterogeneous bus Host Bus Adapter (HBA) card).
—Has high performance with “All-Flash Storage”.
The fact that Alice sends $ 100 to Bob is recorded in the blockchain. To prove that this transaction is true, Alice’s purse must be verified through the entire node of the blockchain. Whether Bob’s wallet is correct is checked as well through the entire node of the blockchain. It also records the hash value S9H8FDFJH89FSFDSAFKLJFLDSJALKJDF for the transaction information as No. 2 (assumed) block-chaining transaction and randomly selects a server to participate in to prove to all nodes that the transaction recorded in No. 2 is a normal transaction.
If the total blockchain has three nodes (A, B, and C), the transaction recorded in blockchain 2 of A will participate in the verification of B and C nodes, which compete for verification. This competition generates compensation. The competition chain is the color spectrum chain. The block proven through the competition provides compensation to the node that proves the transaction size according to the proportion. To prove the transaction, all nodes have a public key. This public key is used to verify that the transaction is complete. The nonce of the block is performed according to the degree of difficulty, so the operation leading to 0 must be carried out through the public key.
The color spectrum chain uses multiple nodes, excluding its own node, to prove that it is the blockchain. This node does not have verification authority. Randomly select the nodes to participate in the verification, and then request verification. The hash of the color spectrum chain is rebased to all nodes to have a hash of the verified transaction block.
The blockchain is also established through the proof of the color spectrum chain. This establishment is confirmed through the creation of a whitechain.
The block has hash as well as the previous block’s difficulty of containing fast transactions and for competition and trade compensation. Through such difficulty, the proving of the block is verified through the occurrence of “0”; thus, the reliability can be improved
Figure 9.
To capture transactions (confidentiality, availability, functionality, and interoperability aspects) quickly and to prove that the transaction is trustworthy (integrity, non-repudiation), the block provides random rights to other nodes that participate without using the node containing the transaction. By doing so, a consensus structure is created for the nodes participating according to how many “0 s” have occurred for a certain time
Figure 10.
In addition the blockchain technology has advantages of reducing transaction costs and preventing forgery of data and it can be combined with various industries to increase efficiency and create new economic value. In addition it is possible to support real-time autonomous collaboration between Internet devices without human intervention based on a smart contract through autonomous collaboration between IoT devices. Moreover, blockchain technology to enable comparative analysis between blockchain technologies. We propose an evaluation system that can objectively verify the reliability and performance of platform service (distributed app).
(2) Color Spectrum Chain Performance comparison with Existing Blockchain
In the Color spectrum chain each block is stored as a timestamp and an optional index. It also has a self-identifying hash to each block to ensure integrity throughout the blockchain.
As with the bitcoin, the hash of each block is a hash that encrypts the index of the block, the timestamp, the data, and the hash of the previous block
Figure 11.
Once the block structure is created as in the code, the next step is actually adding the block to the chain. As mentioned earlier, each block needs information on the previous block.
The first block, the genesis block, is a special block unlike ordinary blocks. Usually, it needs to be added manually or by using a unique logic.
The index of this block is 0, returning an arbitrary data value and an arbitrary value for the “previous hash” parameter
Figure 11.
This function creates data of the block to be newly created by using the previous block as a parameter in the color spectrum chain structure, and returns a new block with the corresponding data
Figure 12.
When a new block hashes the information of the previous block, the integrity of the Blockchain increases each time a new block is created. By using this structure, we will be able to defend our blockchain in the replacement (collapse) of the chain structure due to the “modification of the past information” which may originate from an external intruder such as a hacker. Therefore, this color spectrum chain acts as proof of encryption and can not be replaced or removed once the block is added to the blockchain
Figure 13.
This function creates the data of the new block to be created by using the previous block as a parameter in the color spectrum chain structure and returns a new block with the corresponding data
Figure 12.
When a new block hashes the information of the previous block, the integrity of the blockchain increases each time a new block is created. By using this structure, we will be able to defend our blockchain in the replacement (collapse) of the chain structure caused by the “modification of past information,” possibly by an intruder such as a hacker. Therefore, this color spectrum chain acts as proof of encryption; it cannot be replaced or removed once the block is added to the blockchain
Figure 13.
By complete the code above, a blockchain can be built. The color spectrum chain itself is a simple Python list whose first element is the origin block. Naturally, the next block needs to be added.
As shown in the
Figure 15, a hash block can be divided into 1 to 18 blocks to obtain a unique hash value. Hashes are also widely used in the security field. Because there is no direct relationship between the key and the hash value, it is difficult to restore the key with the hash value alone. In addition, the hash function can generate a constant length output for input data having different lengths, and can also perform a “data reduction” function. However, almost all hash functions developed so far have been confirmed to cause hash collisions. Of course, it would also make sense to reduce the hash collision itself, but the important thing is that hash collisions occur evenly across the hash value. In the above diagram, if the unique values of all the hashes are mapped to the same hash value, the inefficiency is increased when accessing the data, the security is weak (the same hash value even though the key is different) There is no reason to manage it. So from 1 to 18 hash values are put in different blocks to show the value that enhances security function.
The results verified using the colored spectrum chain are compared and verified with the existing data. The figure shows the blockchain performance data using the existing blockchain
Figure 16.
The color spectrum chain is used to compare and verify Thermal priority and Chiller priority
Figure 17.
Figure 16 above compares the existing block-chain platform with the IOTA’s “Tangle” platform, which uses block chains of existing IOT data. IOTA discusses innovative approaches. This approach is applied to a virtual currency called iota, which is specially designed for the current IoT industry. In this paper, we compare the general characteristics of Tangles, discuss the problems that arise when removing blockchains and maintaining distributed trading books, and comparing them with color spectrum chains. The specific implementation method of the Iota protocol is compared. In general, Tugle-based virtual currency works as follows. Instead of a global block chain, there is a directed acyclic graph (DAG) called a tang. The transactions requested by the nodes constitute a set of sites in the Tangle graph, which is a transaction book that stores transactions. The edge set of the tangles is obtained by the following method. When a new transaction arrives, it must approve two previous transactions 2. These approvals are expressed as directed edges. If there is no directional line between the transaction and the transaction, but there is a directed path from a minimum of two to a long, we indirectly acknowledge (or refer to) the transaction. There is also a “genesis” transaction that is directly or indirectly approved by all other transactions. The genesis transaction is explained as follows. In the early days of Tangles, there were addresses that had all the tokens, and these tokens were sent to the addresses of other “founders” through genesis transactions. Emphasize that all the tokens here are generated from the Genesis transaction. In the future, tokens will not be created, and there will be no mining such that the jugglers will receive financial compensation from the air. The key idea of Tangle is as follows. To request a transaction, users must work to approve other transactions. Thus, users requesting transactions contribute to the security of the network. The nodes are assumed to verify that the authorized transaction is not conflicting. If a node finds that a transaction conflicts with a toggle, the node will not directly or indirectly approve the conflicting transaction. In this paper, we compare the performance of the IoT sensor based block chain with the color spectrum chain.
And IoT data can be seen that the performance value is staggered when the performance value is compared with the conventional blockchain and the color spectrum chain which can be verified with high degree. These values can never be determined to be significant values. Finally it can be said that the Capital expenditures (CAPEX) and Operating Expenditure (OPEX) values have grown.
In the graph, Qst, n represents the performance data value, Qchl, n is quality data values. In this comparison table, the performance data and the quality data scale were calculated in proportion to the time value. Performance can be improved by considering data processing speed (TPS), data processing process, etc. In some cases, performance degrades due to the data model structure, and inevitably degrades in performance due to large data size. In addition, there are cases where performance is deteriorated due to index creation without sufficiently considering index characteristics. In this paper, performance refers to performance of data retrieval. and infrequent, and there is a lot of single-item processing, whereas data retrieval is repetitive, frequent, and many cases are processed. This characteristic is that the nature of a general transaction has a pattern of inquiry, and in some cases, the performance of input/modification/deletion is important. Moreover, Qchl, n is the quality data, and it can be defined as securing the latestness, accuracy, and interconnection of data and giving it useful value to users. Systematic management and activities are required to continuously maintain or improve such data quality from the user’s point of view. Therefore, “Data Quality Management” is defined as “a set of activities such as quality goal setting, quality diagnosis and improvement to secure data quality, and related tools to support it”. In general, data quality management has been recognized as a task performed in the operation and utilization phase since data construction. However, the cause of major quality issues is found in the absence of quality management activities in the information system construction stage including data operation and utilization stages have. Therefore, the superiority of security is simulated by giving time value to the relationship between performance and quality. We compare the construction cost with the operation cost. Now, we compare the block chain of the internal sensor network with the method of constructing the block chain in the external cloud against the actual construction cost as follows.
- (1)
Direct costs associated with operating a block-chain server: IT, power, volume, storage and management of such resources.
- (2)
Indirect costs of operating a block-chain server: IT operations for network and storage infrastructure and general infrastructure management.
- (3)
Block chain server holding overhead: Needless to say, critical resources in scarcity, procurement and accounting workforce: IT management and processing.
The benefits of OPEX aspects of block-chain computing should be based on a clear understanding of CAPEX within the enterprise. Firms are limited in the amount of capital investment possible by the stock market. Even in the case of a private company, it must be restricted by financial institutions. Because CAPEX is limited, companies usually want to direct their investments to monetization activities. Many companies prefer renting rather than buying real estate because they do not want to keep valuable capital in liquid assets. Rightly or wrongly, there are many companies that see IT as an investment of the latter, so they endeavor to minimize this cost. This is why IT departments report to Chief Financial Officer (CFO)s in many companies. A financial consultant said IT was “a guy who poured in unexplained jargon and demanded a huge amount of cash,” he said. From that point of view, it is easy to understand why the idea of cutting down on capital expenditures and turning it into a more cost-effective operating cost is so appealing to those who hit the abacus. Given all these factors, attempts to block cloud computing by comparing costs based on block-chain clouds versus internal block-chain server operating costs are not feasible. Unless cloud figures increase significantly, cloud economics has a myriad of attractive elements that top management can deserve. Therefore, the trade-off point between CAPEX and OPEX values was selected and designed.