Results 71 to 80 of about 384,292 (296)
Multikey Verifiable Homomorphic Encryption
IEEE Access, 2022 A homomorphic encryption (HE) scheme is an advanced encryption technology which allows any user receiving ciphertexts to perform computations over them in a public manner. An important application of an HE scheme is a private delegating computation where
Yi Lu, Keisuke Hara, Keisuke Tanaka
doaj +1 more source
QR TPM in Programmable Low-Power Devices [PDF]
arXiv, 2023 Trusted Platform Modules (TPMs), which serve as the root of trust in secure systems, are secure crypto-processors that carry out cryptographic primitives. Should large-scale quantum computing become a reality, the cryptographic primitives adopted in the TPM 2.0 standard will no longer be secure.
arxiv
Coin Tossing is Strictly Weaker Than Bit Commitment
, 1999 We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditionally
A. Kent +9 more
core +1 more source
A Security-aware Approach to JXTA-Overlay Primitives [PDF]
, 2009 The JXTA-Overlay project is an effort to use JXTA technology to provide a generic set of functionalities that can be used by developers to deploy P2P applications.
Arnedo Moreno, Joan +3 more
core +3 more sources
Cryptographic One-way Function Based on Boson Sampling [PDF]
Quantum Inf Process (2019) 18: 259, 2019 The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions stand out as fundamental building blocks of more complex cryptographic protocols, and they play a central role in ...
arxiv +1 more source
Post-quantum cryptographic hardware primitives [PDF]
, 2020 The development and implementation of post-quantum cryptosystems have become a pressing issue in the design of secure computing systems, as general quantum computers have become more feasible in the last two years.
Agrawal, Rashmi +3 more
core
Compiling symbolic attacks to protocol implementation tests
, 2012 Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but the feasability of these scenarios need to be confirmed at the ...
Ghabri, Hatem +2 more
core +4 more sources
On some quasigroup cryptographical primitives
, 2011 11 ...
Csorgo, Piroska, Shcherbacov, Victor
openaire +2 more sources
Memristive crypto primitive for building highly secure physical unclonable functions
Scientific Reports, 2015 Physical unclonable functions (PUFs) exploit the intrinsic complexity and irreproducibility of physical systems to generate secret information. The advantage is that PUFs have the potential to provide fundamentally higher security than traditional ...
Yansong Gao +4 more
semanticscholar +1 more source
The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.
Ìнформаційні технології в освіті, 2009 An iterative algorithm used with variable block size of public key encryption, multiple 32-m bits. Encrypt text runs in steps. As cryptographic primitives are used: stochastic scrolling block, bi-directional sliding coding, nonlinear and stochastic ...
A. Beletsky, A. Beletsky
doaj