Results 21 to 30 of about 2,863 (194)
Renewable Multi-secret Sharing of Self-selecting Sub-secret [PDF]
Jisuanji gongcheng, 2016 The existing public verifiable multi-secret sharing schemes without trusted centers can not make sub-secrets self-selected and periodical renewable simultaneously.In order to solve the problem,a public verifiable and renewable multi-secret sharing scheme
GU Ting,DU Weizhang
doaj +1 more source
Sensors, 2023 The Internet of things (IoT) accommodates lightweight sensor/actuator devices with limited resources; hence, more efficient methods for known challenges are sought after. Message queue telemetry transport (MQTT) is a publish/subscribe-based protocol that
Özlem Şeker +2 more
doaj +1 more source
Novel self-renewal hash chain scheme based on (t,n) threshold and division tree
Tongxin xuebao, 2013 The introduction of renewal hash chain overcame resource-constrained defect in traditional hash chains,but the existing renewable schemes had still held unsatisfactory performance especially on security and complexity.The definitions of repetition ...
Hai-ping HUANG +4 more
doaj +2 more sources
Atomic Crosschain Transactions for Ethereum Private Sidechains
Blockchain: Research and Applications, 2022 The Atomic Crosschain Transaction for Ethereum Private Sidechains protocol allows composable programming across permissioned Ethereum blockchains. It allows for inter-contract and inter-blockchain function calls that are both synchronous and atomic: if ...
Peter Robinson +2 more
doaj +1 more source
Energy-Efficient Hash Chain Traversal
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011 A hash chain H for a one-way hash function h(·) is a sequence of hash values , where vn is a secret value, vi is generated by vi=h(vi+1) for i=n-1,n-2,...,0 an0d v0 is a public value. A hash chain traversal algorithm T computes and outputs the hash chain H, returning vi in time period (called round) i for 1≤i≤n.
Yum, DH, Seo, JW, Lee, PJ
openaire +2 more sources
Fast parallel construction of variable-length Markov chains
BMC Bioinformatics, 2021 Background Alignment-free methods are a popular approach for comparing biological sequences, including complete genomes. The methods range from probability distributions of sequence composition to first and higher-order Markov chains, where a k-th order ...
Joel Gustafsson +3 more
doaj +1 more source
Differential Analysis of a Cryptographic Hashing Algorithm HBC-256
Applied Sciences, 2022 The article observes the new hashing algorithm HBC-256. The HBC-256 algorithm is based on the block cipher of the compression function CF (Compression Function) and produces a 256-bits hash value.
Kunbolat Algazy +4 more
doaj +1 more source
Efficient Constructions for One-way Hash Chains [PDF]
, 2003 Abstract: "One-way chains are an important cryptographic primitive in many security applications. Lamport first proposed to use one-way chains for one-time password authentication [19]. Subsequently, researchers proposed one-way chains as a basic building block for digital cash, for extending the lifetime of digital certificates, for constructing one ...
Yih-Chun Hu +2 more
openaire +1 more source
Advanced Functional Materials, EarlyView.P4bm framework in NaNbO3‐Ba(Ti, Hf)O3 ferrodistortive relaxor entails short‐range and highly‐polar ferrodistortive orders. The abundant highly‐polar orders facilitate to increase entropy change, and robust octahedral oxygen tilt enables to impede thermal perturbations.
Feng Li +11 more
wiley +1 more source
Selective Location Blinding Using Hash Chains [PDF]
, 2011 Location-based applications require a user's movements and positions to provide customized services. However, location is a sensitive piece of information that should not be revealed unless strictly necessary. In this paper we propose a procedure that allows a user to control the precision in which his location information is exposed to a service ...
Gabriele Lenzini +2 more
openaire +2 more sources