Results 51 to 60 of about 26,946 (315)
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 +1 more source
Postprocessing for quantum random number generators: entropy evaluation and randomness extraction
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical ...
B. Chor +18 more
core +1 more source
Dynamic Traitor Tracing Schemes, Revisited [PDF]
We revisit recent results from the area of collusion-resistant traitor tracing, and show how they can be combined and improved to obtain more efficient dynamic traitor tracing schemes.
Laarhoven, Thijs
core +3 more sources
Increased hepatic angiotensinogen (AGT) abundance leads to cardiac diastolic dysfunction via the AngII‐independent pathway. Liver‐derived AGT is internalized by LRP2 in cardiac endothelial cells, subsequently contributing to myocardial diastolic dysfunction by suppressing microvascular angiogenesis via inhibiting the GATA2/Pim3 pathway.
Zetao Heng +7 more
wiley +1 more source
Stronger Security Variants of GCM-SIV
At CCS 2015, Gueron and Lindell proposed GCM-SIV, a provably secure authenticated encryption scheme that remains secure even if the nonce is repeated.
Tetsu Iwata, Kazuhiko Minematsu
doaj +1 more source
MRCC: A Practical Covert Channel Over Monero With Provable Security
Covert channels are designed to protect the communication relationship of the sender and receiver. Traditional covert channels have become insecure due to the continuous improvement of traffic analysis techniques. In this context, there is an urgent need
Zhaozhong Guo +3 more
doaj +1 more source
NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem [PDF]
The problem of Syndrome Decoding was proven to be NP-complete in 1978 and, since then, quite a few cryptographic applications have had their security rely on the (provable) difficulty of solving some instances of it. However, in most cases, the instances
Finiasz, Matthieu
core
Optical Neuromorphic Technology Catalyzes the Next‐Generation Mobile Communication Technology
Advancements in optical computing could revolutionize next‐generation wireless communication. The review highlights the role of photonic integrated circuits in implementing neural network operations and discusses their benefits, such as high computational density.
Xiaoxiong Song +6 more
wiley +1 more source
Provable image encryption scheme via trapdoor permutation
Nowadays, due to the advancement in networks, it has become easy to share multimedia information such as images, voice, and videos in real‐time. In the process of multimedia storage and transmission, it is crucial to ensure the security and privacy of ...
Dongmei Li, Haikuan Liu
doaj +1 more source
This is a comment on the publication by Yuan et al. [Appl. Phys. Lett.
Fung C.-H. F. +5 more
core +1 more source

