Results 91 to 100 of about 380,993 (266)

Certifying RSA public keys with an efficient NIZK [PDF]

open access: yes, 2018
In many applications, it is important to verify that an RSA public key ( N,e ) specifies a permutation, in order to prevent attacks due to adversarially-generated public keys.
Balditimsi, Foteini   +3 more
core  

Secure two-party quantum evaluation of unitaries against specious adversaries

open access: yes, 2010
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious.
D. Gottesman   +8 more
core   +1 more source

Assessment of Practical Satellite Quantum Key Distribution Architectures for Current and Near‐Future Missions

open access: yesInternational Journal of Satellite Communications and Networking, Volume 43, Issue 3, Page 164-192, May/June 2025.
ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci   +7 more
wiley   +1 more source

No Superluminal Signaling Implies Unconditionally Secure Bit Commitment [PDF]

open access: yes, 2014
Bit commitment (BC) is an important cryptographic primitive for an agent to convince a mutually mistrustful party that she has already made a binding choice of 0 or 1 but only to reveal her choice at a later time. Ideally, a BC protocol should be simple,
Chau, H. F.   +2 more
core  

Post-quantum signature algorithms based on the hidden discrete logarithm problem [PDF]

open access: yesComputer Science Journal of Moldova, 2018
New options of the hidden discrete logarithm problem are proposed as cryptographic primitive of the post-quantum signature algorithms. Two signature schemes using computations in finite non-commutative algebras with associative multiplication operation
A.A. Moldovyan, N.A. Moldovyan
doaj  

Cryptographic Primitives Based on Hard Learning Problems [PDF]

open access: yes, 1994
Modern cryptography has had considerable impact on the development of computational learning theory. Virtually every intractability result in Valiant’s model [13] (which is representation-independent in the sense that it does not rely on an artificial syntactic restriction on the learning algorithm’s hypotheses) has at its heart a cryptographic ...
Merrick L. Furst   +3 more
openaire   +2 more sources

Physically Unclonable Function Utilizing Stochastic Indirect Exchange Interaction

open access: yesSmall Structures, Volume 6, Issue 6, June 2025.
A physically unclonable function (PUF) utilizes manufacturing variations to create secret keys. This study proposes a spin–orbit torque PUF model based on the Ruderman–Kittel–Kasuya–Yosida interaction. It features near‐ideal properties that can operate under zero magnetic field and varying temperatures.
Jeong Kyu Lee   +3 more
wiley   +1 more source

On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 3, Page 109-122, March 2025.
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

Improving Physically Unclonable Functions’ Performance Using Second-Order Compensated Measurement

open access: yesInformation
In this paper, we study the performance of second-order compensated measurement to generate a multi-bit response in physically unclonable functions (PUFs).
Jorge Fernández-Aragón   +5 more
doaj   +1 more source

Efficient Length Doubling From Tweakable Block Ciphers

open access: yesIACR Transactions on Symmetric Cryptology, 2017
We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n − 1].
Yu Long Chen   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy