Results 41 to 50 of about 4,088 (185)
, 2011 Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet.
A. Restivo +16 more
core +2 more sources
Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint
Concurrency and Computation: Practice and Experience, Volume 38, Issue 1, January 2026.ABSTRACT We investigate the performance of algorithms that explore large state graphs of finite state machines without input by following paths. To improve on anchor‐based and candidate‐based explorations and to avoid the performance overhead of full anchor lists and the tuning sensitivity of timeout‐based methods, we propose and analyze exploration ...
Jörg Keller, Sebastian Litzinger
wiley +1 more source
Hash function requirements for Schnorr signatures
Journal of Mathematical Cryptology, 2009 We provide two necessary conditions on hash functions for the Schnorr signature scheme to be secure, assuming compact group representations such as those which occur in elliptic curve groups. We also show, via an argument in the generic group model, that
Neven Gregory +2 more
doaj +1 more source
A Cryptographic Escrow for Treaty Declarations and Step-by-Step Verification
, 2018 The verification of arms-control and disarmament agreements requires states to provide declarations, including information on sensitive military sites and assets.
Felten, Edward W. +2 more
core +1 more source
On stabilizers in finite permutation groups
Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.Abstract Let G$G$ be a permutation group on the finite set Ω$\Omega$. We prove various results about partitions of Ω$\Omega$ whose stabilizers have good properties. In particular, in every solvable permutation group there is a set‐stabilizer whose orbits have length at most 6, which is best possible and answers two questions of Babai.
Luca Sabatini
wiley +1 more source
Preimage and pseudo-collision attacks on 29-step SM3 hash function with padding
Tongxin xuebao, 2014 The security of SM3 hash function was revaluated by using the meet-in-the-middle attack. The preimage and pseudo-collision attack on 29-step SM3 hash function (from the 1-st step) with padding was presented.
Gao-li WANG, Yan-zhao SHEN
doaj +2 more sources
Journal of Computer Networks and Communications, Volume 2026, Issue 1, 2026.The rapid expansion of the Industrial Internet of Things (IIoT) presents pressing challenges for secure, efficient, and privacy‐preserving communication among users, sensors, and cloud infrastructures. Existing lightweight authentication schemes, primarily based on classical cryptographic assumptions, are increasingly vulnerable to the emerging threat ...
Tinashe Magara +2 more
wiley +1 more source
Concurrent Knowledge-Extraction in the Public-Key Model [PDF]
, 2009 Knowledge extraction is a fundamental notion, modelling machine possession of values (witnesses) in a computational complexity sense. The notion provides an essential tool for cryptographic protocol design and analysis, enabling one to argue about the ...
Yao, Andrew C., Yung, Moti, Zhao, Yunlei
core +2 more sources
Blockweave: An Arweave‐Based Decentralized Storage Solution to Tackle the Blockchain Trilemma
Engineering Reports, Volume 7, Issue 7, July 2025.Leveraging Arweave's blockweave and Proof‐of‐Access consensus, this framework reduces on‐chain metadata to 48 bytes, enabling throughput up to 7200 TPS, 99%$$ 99\% $$ storage savings, and robust security (Q(0.4)=0.82)$$ \left(\mathrm{Q}(0.4)=0.82\right) $$ while achieving Tier‐S decentralization on $300 mining nodes.
Saha Reno, Koushik Roy, Tamanna Tabassum
wiley +1 more source
Constructing Efficient Identity‐Based Signatures on Lattices
IET Information Security, Volume 2025, Issue 1, 2025.In this work, we explore the recent developments related to lattice‐based signature and preimage sampling, and specify a compact identity‐based signature (IBS) on an ideal lattice for practical use. Specifically, we first propose an ellipsoid version of the G + G signature scheme (Asiacrypt 2023) that achieves slightly better signature size and higher ...
Huiwen Jia +4 more
wiley +1 more source