MB
M.A. Bulină
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
Data outsourcing has become one of the primary means for preserving information as it passes the responsibility of storage management to the service provider. However, storing sensitive data remotely poses privacy threats for the data owners. Searchable encryption (SE) is a technique that allows performing search queries over encrypted data. The majority of SE solutions model the server as an honest-but-curious entity. If this is not the case, the results of the queries might not be reliable. The issue can be mitigated by implementing SE within blockchain technology. This paper proposes a searchable encryption scheme that uses smart contracts in Hyperledger Fabric. For storing a set of documents securely, the data owner chooses an identifying keyword for each document. The identifying keywords and documents ids are stored in a matrix that facilitates keyword search; consequently, the matrix is appended to the ledger. For retrieving a document, the data owner builds an encrypted query (trapdoor) using the identifying keyword; the trapdoor is passed to the smart contract. Thus, the data owner delegates the smart contract to perform the query on their behalf. The data owner receives the document id, which can then be used to retrieve the respective content. The proposed protocol achieves faster data pre-processing, i.e., matrix computation, when the number of documents is smaller. The file size does not affect the time efficiency of the scheme. Nonetheless, the execution time for pre-processing increases with regard to the number of documents. As a result, the system is Input/Output (I/O) Bound.
...
Data outsourcing has become one of the primary means for preserving information as it passes the responsibility of storage management to the service provider. However, storing sensitive data remotely poses privacy threats for the data owners. Searchable encryption (SE) is a technique that allows performing search queries over encrypted data. The majority of SE solutions model the server as an honest-but-curious entity. If this is not the case, the results of the queries might not be reliable. The issue can be mitigated by implementing SE within blockchain technology. This paper proposes a searchable encryption scheme that uses smart contracts in Hyperledger Fabric. For storing a set of documents securely, the data owner chooses an identifying keyword for each document. The identifying keywords and documents ids are stored in a matrix that facilitates keyword search; consequently, the matrix is appended to the ledger. For retrieving a document, the data owner builds an encrypted query (trapdoor) using the identifying keyword; the trapdoor is passed to the smart contract. Thus, the data owner delegates the smart contract to perform the query on their behalf. The data owner receives the document id, which can then be used to retrieve the respective content. The proposed protocol achieves faster data pre-processing, i.e., matrix computation, when the number of documents is smaller. The file size does not affect the time efficiency of the scheme. Nonetheless, the execution time for pre-processing increases with regard to the number of documents. As a result, the system is Input/Output (I/O) Bound.
Blockchain technology is the underlying mechanism that many cryptocurrencies operate on. It relies on cryptographic techniques that enforce integrity on transaction records. The records (blocks) stored are limited in size and frequency. One well-known issue regarding blockchain technology is the lack of scalability. In order to mitigate this problem, payment channels were introduced. These are considered an "off-chain" solution as communication with the blockchain is not required for executing transactions. Nonetheless, payment channels are debit-based, thus each channel that contributes to forwarding the payment is required to have a sufficient amount of coins to route the money. If this is not the case, the transaction may not succeed. For solving this matter, the node may decide to split the payment and forward it through multiple intermediaries until the destination is reached. This paper studies how fee models can be integrated into splitting protocols. An overview of the current state of the technology is provided, followed by a proposed solution for integrating fees into splitting protocols. It has been observed that splitting the payments and charging lower fees leads to a higher number of successful transactions, an outcome that was expected. The proposed fee model relies on the payment value and a statistic about the distribution of coins owned by the involved parties. The highest success ratio was achieved when combining the proposed design with the SplitIfNecessary splitting protocol. Nonetheless, when using the same fee model, there does not seem to be any pattern between the splitting protocol and the transaction value.
...
...
Blockchain technology is the underlying mechanism that many cryptocurrencies operate on. It relies on cryptographic techniques that enforce integrity on transaction records. The records (blocks) stored are limited in size and frequency. One well-known issue regarding blockchain technology is the lack of scalability. In order to mitigate this problem, payment channels were introduced. These are considered an "off-chain" solution as communication with the blockchain is not required for executing transactions. Nonetheless, payment channels are debit-based, thus each channel that contributes to forwarding the payment is required to have a sufficient amount of coins to route the money. If this is not the case, the transaction may not succeed. For solving this matter, the node may decide to split the payment and forward it through multiple intermediaries until the destination is reached. This paper studies how fee models can be integrated into splitting protocols. An overview of the current state of the technology is provided, followed by a proposed solution for integrating fees into splitting protocols. It has been observed that splitting the payments and charging lower fees leads to a higher number of successful transactions, an outcome that was expected. The proposed fee model relies on the payment value and a statistic about the distribution of coins owned by the involved parties. The highest success ratio was achieved when combining the proposed design with the SplitIfNecessary splitting protocol. Nonetheless, when using the same fee model, there does not seem to be any pattern between the splitting protocol and the transaction value.