Results 61 to 70 of about 234 (160)

Multi‐hop anonymous payment channel network based on onion routing

IET Blockchain, Volume 4, Issue 2, Page 197-208, June 2024.
To solve the payment channel network path privacy problem, we analyse the multi‐hop anonymous and privacy‐preserving payment channel network scheme and propose a multi‐hop anonymous payment channel network based on onion routing based on it. The scheme removes the routing assumptions of the original scheme, designs an onion routing‐based payment ...
Caimei Wang, Yudong Ren, Zhize Wu
wiley   +1 more source

Picard sheaves, local Brauer groups, and topological modular forms

Journal of Topology, Volume 17, Issue 2, June 2024.
Abstract We develop tools to analyze and compare the Brauer groups of spectra such as periodic complex and real K$K$‐theory and topological modular forms, as well as the derived moduli stack of elliptic curves. In particular, we prove that the Brauer group of TMF$\mathrm{TMF}$ is isomorphic to the Brauer group of the derived moduli stack of elliptic ...
Benjamin Antieau, Lennart Meier, Vesna Stojanoska   +2 more
wiley   +1 more source

Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160]

IACR Transactions on Symmetric Cryptology
Recently, linear structures and algebraic attacks have been widely used in preimage attacks on round-reduced Keccak. Inherited by pioneers’ work, we make some improvements for 3-round Keccak-256 and 4-round Keccak[r=640, c=160].
Xiaoen Lin, Le He, Hongbo Yu
doaj   +1 more source

Secure and Efficient Multi-Authority Attribute-Based Encryption Scheme From Lattices

IEEE Access, 2019
Attribute-based encryption (ABE) mechanism on lattices can against quantum attack and guarantees fine-grained access control of encrypted data, and it has been widely used in cloud computing and privacy protection.
Yuan Liu, Licheng Wang, Lixiang Li, Xixi Yan   +3 more
doaj   +1 more source

Improved Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing

IACR Transactions on Symmetric Cryptology
The Nostradamus attack was originally proposed as a security vulnerability for a hash function by Kelsey and Kohno at EUROCRYPT 2006. It requires the attacker to commit to a hash value y of an iterated hash function H.
Xiaoyang Dong, Jian Guo, Shun Li, Phuong Pham, Tianyu Zhang   +4 more
doaj   +1 more source

SAT-Based Space Partitioning and Applications to Ascon-Hash256 Cryptanalysis

IACR Transactions on Symmetric Cryptology
We introduce an efficient SAT-based space partitioning technique that enables systematic exploration of large search spaces in cryptanalysis. The approach divides complex search spaces into manageable subsets through combinatorial necklace generation ...
Guozhen Liu, Shun Li, Huina Li, Weidong Qiu, Siwei Sun   +4 more
doaj   +1 more source

Preimage Attacks on 3, 4, and 5-Pass HAVAL [PDF]

, 2008
This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2225, a preimage attack on 4-pass HAVAL at the complexity of 2241, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2241. Moreover, we
Yu Sasaki 0001, Kazumaro Aoki
openaire   +1 more source

Improved Quantum Cryptanalysis of MD5 and SHA-1

IEEE Access
MD5 and SHA-1 are widely studied hash functions in cryptanalysis, owing to their well-structured round functions and historical significance in cryptography.
Kyungbae Jang, Hwajeong Seo, Anupam Chattopadhyay   +2 more
doaj   +1 more source

Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings [PDF]

, 2012
We extend and improve biclique attacks, which were recently introduced for the cryptanalysis of block ciphers and hash functions. While previous attacks required a primitive to have a key or a message schedule, we show how to mount attacks on the primitives with these parameters fixed, i.e. on permutations. We introduce the concept of sliced bicliques,
openaire   +2 more sources

Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019
Troika is a recently proposed sponge-based hash function for IOTA’s ternary architecture and platform, which is developed by CYBERCRYPT. In this paper, we introduce the preimage attack on 2 and 3 rounds of Troika with a divide-and-conquer approach. Instead of directly matching a given hash value, we propose equivalent conditions to determine whether a ...
LIU, Fukang, ISOBE, Takanori
openaire   +2 more sources