Results 61 to 70 of about 4,088 (185)
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
Preimage and collision attacks on reduced Ascon using algebraic strategies
CybersecurityAscon, a family of algorithms that supports hashing and authenticated encryption, is the winner of the NIST Lightweight Cryptography Project. In this paper, we propose an improved preimage attack against 2-round Ascon-XOF-64 with a complexity of $$2^{33}$
Qinggan Fu +3 more
doaj +1 more source
Practical Preimage Attack on 5-Round Keccak[r=640, c=160]
IACR Transactions on Symmetric CryptologyInternal differential cryptanalysis has recently yielded a series of new results in the preimage cryptanalysis of round-reduced Keccak. While these existing attacks share a similar high-level framework, they differ in their technical details. This paper
Xiaoen Lin +6 more
doaj +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 +2 more
wiley +1 more source
A Secure Cryptocurrency Scheme Based on Post-Quantum Blockchain
IEEE Access, 2018 Nowadays, blockchain has become one of the most cutting-edge technologies, which has been widely concerned and researched. However, the quantum computing attack seriously threatens the security of blockchain, and related research is still less. Targeting
Yu-Long Gao +5 more
doaj +1 more source
International Consensus Statement on Allergy and Rhinology: Sinonasal Tumors
International Forum of Allergy &Rhinology, Volume 14, Issue 2, Page 149-608, February 2024.Abstract Background Sinonasal neoplasms, whether benign and malignant, pose a significant challenge to clinicians and represent a model area for multidisciplinary collaboration in order to optimize patient care. The International Consensus Statement on Allergy and Rhinology: Sinonasal Tumors (ICSNT) aims to summarize the best available evidence and ...
Edward C. Kuan +158 more
wiley +1 more source
Partial pre-image attack on Proof-of-Work based blockchains
Blockchain: Research and ApplicationsBlockchain is a type of distributed ledger technology that consists of a growing list of records, called blocks, that are securely linked together using cryptography.
Hamza Baniata, Attila Kertesz
doaj +1 more source
Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications
IACR Transactions on Symmetric Cryptology, 2017 Recently, many efficient cryptographic hash function design strategies have been explored, not least because of the SHA-3 competition. These designs are, almost exclusively, geared towards high performance on long inputs.
Stefan Kölbl +3 more
doaj +1 more source
Phase diagram and topological expansion in the complex quartic random matrix model
Communications on Pure and Applied Mathematics, Volume 77, Issue 2, Page 1405-1485, February 2024.Abstract We use the Riemann–Hilbert approach, together with string and Toda equations, to study the topological expansion in the quartic random matrix model. The coefficients of the topological expansion are generating functions for the numbers Nj(g)$\mathcal {N}_j(g)$ of 4‐valent connected graphs with j vertices on a compact Riemann surface of genus g.
Pavel Bleher +2 more
wiley +1 more source
Lower Bounds on Signatures from Symmetric Primitives [PDF]
, 2019 We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorithms ...
Barak, Boaz, Mahmoody, Mohammad
core +1 more source