Results 11 to 20 of about 913 (157)
Provable Secure Parallel Gadgets
IACR Transactions on Cryptographic Hardware and Embedded Systems, 2023 Side-channel attacks are a fundamental threat to the security of cryptographic implementations. One of the most prominent countermeasures against side-channel attacks is masking, where each intermediate value of the computation is secret shared, thereby concealing the computation’s sensitive information.
Francesco Berti +2 more
openaire +2 more sources
Provably Secure Encryption Schemes With Zero Setup and Linear Speed by Using Rubik’s Cubes
IEEE Access, 2020 Recently, new paradigms for designing modern cryptographic schemes were proposed based on Rubik's rotations. However, most of them lack rigorous provable security reductions.
Ping Pan +3 more
doaj +1 more source
A Provable Secure Session Key Distribution Protocol Based on NSSK for In-Vehicle CAN Network
Mathematics, 2022 Many CAN-based session key sharing approaches are based on the group key scheme, which can easily lead advanced adversaries to infiltrate all ECUs (electronic control units) in the network if the sharing key is leaked.
Long Yin, Jian Xu, Zihao Wang, Chen Wang
doaj +1 more source
Provable Secure Generalized Signcryption [PDF]
Journal of Computers, 2010 Generalized signcryption which proposed by Han is a new cryptographic primitive which can work as an en- cryption scheme, a signature scheme or a signcryption scheme[5]. However,the security proof in their paper is uncorrect. our contribution are as following:First we give security notions for this new primitive.Secnond,we give an attack to [4] which ...
Xu An Wang 0014 +2 more
openaire +2 more sources
Provably Quantum-Secure Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2021 Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting.
Akinori Hosoyamada, Tetsu Iwata
doaj +1 more source
CoRR, 2013 We propose a definition of {\it security} and a definition of {\it robustness} of networks against the cascading failure models of deliberate attacks and random errors respectively, and investigate the principles of the security and robustness of networks. We propose a {\it security model} such that networks constructed by the model are provably secure
Angsheng Li, Yicheng Pan 0001, Wei Zhang
openaire +2 more sources
Provable security against generic attacks on stream ciphers
Journal of Mathematical Cryptology, 2023 Recent lightweight hardware-based stream cipher designs keep an external non-volatile internal state that is not part of the cipher’s hardware module. The purpose of these so-called small-state ciphers is to keep the size of the hardware and the power ...
Moch Alexander
doaj +1 more source
Provably Secure Masking of AES [PDF]
, 2004 A general method to secure cryptographic algorithms against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking, using random values unknown to an adversary one masks the input to a cryptographic algorithm.
Johannes Blömer +2 more
openaire +2 more sources
Provably Secure Reflection Ciphers
, 2022 sponsorship: This work was supported in part by the Research Council KU Leuven: GOA TENSE (C16/15/058). Tim Beyne and Yu Long Chen are supported by a Ph.D. Fellowship from the Research Foundation -Flanders (FWO). The authors thank the reviewers for their valuable comments and suggestions.
Beyne, Tim, Chen, Yu Long
openaire +2 more sources
On Provable White-Box Security in the Strong Incompressibility Model
Transactions on Cryptographic Hardware and Embedded Systems, 2023 Incompressibility is a popular security notion for white-box cryptography and captures that a large encryption program cannot be compressed without losing functionality. Fouque, Karpman, Kirchner and Minaud (FKKM) defined strong incompressibility, where
Estuardo Alpirez Bock +2 more
doaj +1 more source