Results 11 to 20 of about 1,066 (256)
Short Proxy Signature Scheme with Provable Security [PDF]
In order to avoid network congestion,and reduce the data flow,based on bilinear mapping,this paper proposes short proxy signature scheme with only one group element,including the signature definition,the construction of new scheme and the security ...
HUANG Rufen,HUANG Zhenjie,CHEN Qunshan,NONG Qiang
doaj +1 more source
Provably Secure Encryption Schemes With Zero Setup and Linear Speed by Using Rubik’s Cubes
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
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
Provably Quantum-Secure Tweakable Block Ciphers
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
Provable security against generic attacks on stream ciphers
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
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
Provably Secure Reflection Ciphers
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 +3 more sources
Provably Secure Masking of AES [PDF]
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
On Provable White-Box Security in the Strong Incompressibility Model
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
On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing
In this paper, we provide the first analysis of the Iterated Tweakable Even-Mansour cipher with linear tweak and key (or tweakey) mixing, henceforth referred as TEML, for an arbitrary tweak(ey) size kn for all k ≥ 1, and arbitrary number of rounds r ≥ 2.
Benoît Cogliati +3 more
doaj +1 more source

