Results 41 to 50 of about 4,920 (187)
TumbleBit: an untrusted Bitcoin-compatible anonymous payment hub [PDF]
, 2017 This paper presents TumbleBit, a new unidirectional unlinkable payment hub that is fully compatible with today s Bitcoin protocol. TumbleBit allows parties to make fast, anonymous, off-blockchain payments through an untrusted intermediary called the ...
AlShenibr, Leen +4 more
core +2 more sources
New Preimage Attacks against Reduced SHA-1 [PDF]
, 2012 This paper shows preimage attacks against reduced SHA-1 up to 57 steps. The best previous attack has been presented at CRYPTO 2009 and was for 48 steps finding a two-block preimage with incorrect padding at the cost of $$2^{159.3}$$ evaluations of the compression function.
Simon Knellwolf, Dmitry Khovratovich
openaire +1 more source
Differential-Aided Preimage Attacks On Round-Reduced Keccak
The Computer Journal, 2022 Abstract At FSE 2008, Leurent introduced the preimage attack on MD4 by exploiting differential trails. In this paper, we apply the differential-aided preimage attack to Keccak with the message modification techniques. Instead of directly finding the preimage, we exploit differential characteristics to modify the messages, so that the ...
Congming Wei +4 more
openaire +1 more source
Preimage and pseudo collision attacks on round-reduced DHA-256 hash function
Tongxin xuebao, 2013 A preimage attack on DHA-256 hash function reduced to 37-round and a pseudo collision attack on the func-tion reduced to 39-round were proposed respectively.Based on the meet-in-the-middle attack,the Biclique technique was used to improve the preimage ...
Jian ZOU +3 more
doaj +2 more sources
Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes [PDF]
, 2019 We present here a new family of trapdoor one-way Preimage Sampleable Functions (PSF) based on codes, the Wave-PSF family. The trapdoor function is one-way under two computational assumptions: the hardness of generic decoding for high weights and the ...
A May +28 more
core +4 more sources
, 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
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
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
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
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