Results 61 to 70 of about 35,941 (264)
Multikey Verifiable Homomorphic Encryption
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
Cryptographic One-way Function Based on Boson Sampling [PDF]
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
A new Definition and Classification of Physical Unclonable Functions
A new definition of "Physical Unclonable Functions" (PUFs), the first one that fully captures its intuitive idea among experts, is presented. A PUF is an information-storage system with a security mechanism that is 1. meant to impede the duplication of
Merli, Dominik, Plaga, Rainer
core +1 more source
On some quasigroup cryptographical primitives
11 ...
Csorgo, Piroska, Shcherbacov, Victor
openaire +2 more sources
How to Govern the Confidence Machine?
ABSTRACT Emerging technologies pose many new challenges for regulation and governance on a global scale. With the advent of distributed communication networks like the Internet and decentralized ledger technologies like blockchain, new platforms emerged, disrupting existing power dynamics and bringing about new claims of sovereignty from the private ...
Primavera de Filippi+2 more
wiley +1 more source
Perturbation-Based Schemes with Ultra-Lightweight Computation to Protect User Privacy in Smart Grid
In smart grid, smart meters are deployed to collect power consumption data periodically, and the data are analyzed to improve the efficiency of power transmission and distribution.
Wei Ren, Liangli Ma, Yi Ren
doaj +1 more source
Coin Tossing is Strictly Weaker Than Bit Commitment
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
On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays
ABSTRACT In this article, we study the BM quasi‐Hermitian varieties, laying in the three‐dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in ...
Angela Aguglia+3 more
wiley +1 more source
Mem‐Transistor‐Based Gaussian Error–Generating Hardware for Post‐Quantum Cryptography Applications
The demonstration of a Gaussian error sampler system that leverages the intrinsic stochastic characteristics of mem‐transistor semiconductor devices. The demonstrated Gaussian error sampler significantly reduces computational and memory overhead compared to existing techniques.
Moon‐Seok Kim+3 more
wiley +1 more source
The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.
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