Results 31 to 40 of about 4,920 (187)
Classical Verification of Quantum Computations [PDF]
, 2018 We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a ...
Mahadev, Urmila
core +2 more sources
ChainKeeper: A cross‐chain scheme for governing the chain by chain
IET Blockchain, Volume 3, Issue 4, Page 249-264, December 2023., 2023 With the rapid application of consortium chains in various industries, supervising these systems has become a challenge for governments. It is a promising way to govern the chains by a chain, but the existing cross‐chain technologies cannot support perfect supervision.
Yuwei Xu +3 more
wiley +1 more source
A Multi-User, Single-Authentication Protocol for Smart Grid Architectures [PDF]
, 2020 open access articleIn a smart grid system, the utility server collects data from various smart grid devices. These data play an important role in the energy distribution and balancing between the energy providers and energy consumers. However, these data
Al-Bayatti, Ali Hilal +2 more
core +2 more sources
Random Oracles in a Quantum World [PDF]
, 2011 The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems.
C.H. Bennett +25 more
core +3 more sources
The Legendre Symbol and the Modulo-2 Operator in Symmetric Schemes over Fnp
IACR Transactions on Symmetric Cryptology, 2022 Motivated by modern cryptographic use cases such as multi-party computation (MPC), homomorphic encryption (HE), and zero-knowledge (ZK) protocols, several symmetric schemes that are efficient in these scenarios have recently been proposed in the ...
Lorenzo Grassi +3 more
doaj +1 more source
On the Design of Secure and Fast Double Block Length Hash Functions [PDF]
, 2008 In this work the security of the rate-1 double block length hash functions, which based on a block cipher with a block length of n-bit and a key length of 2n-bit, is reconsidered.
Chen, Kefei, Gong, Z., Lai, X.J.
core +7 more sources
IEEE Access, 2022 In modern cryptography, hash functions are considered as one of the key components for secure communication. They play a vital role in a wide range of applications such as ensuring the authentication and integrity of the data, in forensic investigation ...
Darshana Upadhyay +3 more
doaj +1 more source
Preimage Attacks on Reduced-Round Stribog [PDF]
, 2014 In August 2012, the Stribog hash function was selected as the new Russian cryptographic hash standard (GOST R 34.11-2012). Stribog employs twelve rounds of an AES-based compression function operating in Miyaguchi-Preneel mode. In this paper, we investigate the preimage resistance of the Stribog hash function.
Riham AlTawy, Amr M. Youssef
openaire +1 more source
Improved preimage and pseudo-collision attacks on SM3 hash function
Tongxin xuebao, 2018 A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known ...
Jian ZOU, Le DONG
doaj +2 more sources
IACR Transactions on Symmetric Cryptology, 2016 In this paper, we describe attacks on the recently proposed Haraka hash functions. First, for the two hash functions Haraka-256/256 and Haraka-512/256 in the family, we show how two colliding messages can be constructed in about 216 function ...
Jérémy Jean
doaj +1 more source