Results 21 to 30 of about 14,519 (193)
Indexing structures for the PLS blockchain
This paper studies known indexing structures from a new point of view: minimisation of data exchange between an IoT device acting as a blockchain client and the blockchain server running a protocol suite that includes two Guy Fawkes protocols, PLS and ...
Alex Shafarenko
doaj +1 more source
Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core +1 more source
Efficient computation of hashes [PDF]
The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel ...
+16 more
core +3 more sources
A Review on Blockchain Operations in Construction Management
This study investigates the important role that the blockchain plays to manage the information about who did what and when and hence provides a strong base for any legal potential conflicts.
Hasan Volkan Oral, Bassant Sayed
doaj +1 more source
JaxNet: Scalable Blockchain Network [PDF]
Today's world is organized based on merit and value. A single global currency that's decentralized is needed for a global economy. Bitcoin is a partial solution to this need, however it suffers from scalability problems which prevent it from being mass ...
Emelyanenko, Taras +3 more
core +1 more source
SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function
Many commonly used public key cryptosystems will become insecure once a scalable quantum computer is built. New cryptographic schemes that can guarantee protection against attacks with quantum computers, so-called post-quantum algorithms, have emerged in
Anufriev, M. N. +5 more
core +1 more source
Non-malleable codes for space-bounded tampering [PDF]
Non-malleable codes—introduced by Dziembowski, Pietrzak and Wichs at ICS 2010—are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t.
A Faonio +30 more
core +2 more sources
Verifiable multi-keyword search scheme based on improved Merkle-Tree authentication method
Aiming at the problem that the result verification method in the searchable encryption scheme was complicated,the search cost was high and the efficiency was low,it was difficult to meet the requirements of efficient verification and security of multi ...
Youliang TIAN, Qin LUO
doaj +2 more sources
Authenticating Spatial Queries on Blockchain Systems
In many blockchain networks, light nodes (e.g. mobile clients) with few computational resources must rely on more powerful full nodes to retrieve transactions from the chain.
Matteo Loporchio +3 more
doaj +1 more source
In blockchain, ensuring integrity of data when updating distributed ledgers is a challenging and very fundamental process. Most of blockchain networks use Merkle tree to verify the authenticity of data received from other peers on the network.
M. A. Maalla, S. V. Bezzateev
doaj +1 more source

