Results 21 to 30 of about 4,088 (185)
Separating Two-Round Secure Computation From Oblivious Transfer [PDF]
, 2020 We consider the question of minimizing the round complexity of protocols for secure multiparty computation (MPC) with security against an arbitrary number of semi-honest parties. Very recently, Garg and Srinivasan (Eurocrypt 2018) and Benhamouda and Lin (
Applebaum, Benny +4 more
core +2 more sources
Preimage Attacks on Some Hashing Modes Instantiating Reduced-Round LBlock
IEEE Access, 2018 In this paper, we present preimage attacks on several hashing modes instantiating reduced-round LBlock. It is observed that the omission of the network twist in the last round and the diffusion of the permutation in round function are the key points for ...
Shiwei Chen, Chenhui Jin
doaj +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
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
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
Denial-of-Service Resistance in Key Establishment [PDF]
, 2007 Denial of Service (DoS) attacks are an increasing problem for network connected systems. Key establishment protocols are applications that are particularly vulnerable to DoS attack as they are typically required to perform computationally expensive ...
Boyd, Colin +4 more
core +2 more sources
Exploiting Weak Diffusion of Gimli: Improved Distinguishers and Preimage Attacks
IACR Transactions on Symmetric Cryptology, 2021 The Gimli permutation proposed in CHES 2017 was designed for cross-platform performance. One main strategy to achieve such a goal is to utilize a sparse linear layer (Small-Swap and Big-Swap), which occurs every two rounds.
Fukang Liu, Takanori Isobe, Willi Meier
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
KALwEN: a new practical and interoperable key management scheme for body sensor networks [PDF]
, 2010 Key management is the pillar of a security architecture. Body sensor networks (BSNs) pose several challenges–some inherited from wireless sensor networks (WSNs), some unique to themselves–that require a new key management scheme to be tailor-made.
Gong, Zheng +4 more
core +3 more sources
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