Results 21 to 30 of about 375,459 (282)
IEEE Access, 2022 Cloud Computing has proved to be a boon for many individuals and organizations who cannot afford infrastructure and maintenance cost of resources. But the untrusted nature of Cloud Server (CS) brings many challenges related to security and trust.
Smita Chaudhari, Gandharba Swain
doaj +1 more source
A new method for solving the elliptic curve discrete logarithm problem [PDF]
Groups, Complexity, Cryptology, 2021 The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem.
Ansari Abdullah +2 more
doaj +1 more source
Homomorphic signcryption with public plaintext‐result checkability
IET Information Security, 2021 Signcryption originally proposed by Zheng (CRYPTO′97) is a useful cryptographic primitive that provides strong confidentiality and integrity guarantees.
Shimin Li +3 more
doaj +1 more source
Locating Side Channel Leakage in Time through Matched Filters
Cryptography, 2022 Side channel attacks provide an effective way to extract secret information from the execution of cryptographic algorithms run on a variety of computing devices.
Alessandro Barenghi +2 more
doaj +1 more source
New number-theoretic cryptographic primitives [PDF]
Journal of Mathematical Cryptology, 2020 AbstractThis paper introduces new prq-based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not belong to the two common design blueprints, which are the inversion of a trapdoor permutation and the Fiat–Shamir transform.
Marc Joye +3 more
openaire +3 more sources
Feebly secure cryptographic primitives [PDF]
Journal of Mathematical Sciences, 2012 In 1992, A. Hiltgen provided first construction of provably (slightly) secure cryptographic primitives, namely, feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as the circuit complexity over circuits with arbitrary binary gates) is amplified only by a constant factor (in Hiltgen’s ...
Edward A. Hirsch +2 more
openaire +1 more source
APTE: An Algorithm for Proving Trace Equivalence [PDF]
, 2014 This paper presents APTE, a new tool for automatically proving the security of cryptographic protocols. It focuses on proving trace equivalence between processes, which is crucial for specifying privacy type properties such as anonymity and unlinkability.
B. Blanchet +5 more
core +1 more source
Cryptographic primitives based on compact knapsack problem [PDF]
Journal of Information Security and ApplicationsIn the present paper, we extend previous results of an id scheme based on compact knapsack problem defined by one equation. We present a sound three-move id scheme based on compact knapsack problem defined by an integer matrix. We study this problem by providing attacks based on lattices.
Georgios Rizos +1 more
openalex +3 more sources
A device-independent protocol for XOR oblivious transfer [PDF]
Quantum, 2022 Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically implied by the ...
Srijita Kundu +2 more
doaj +1 more source
Towards Isogeny-Based Password-Authenticated Key Establishment
Journal of Mathematical Cryptology, 2020 Password authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the absence of public key infrastructure.
Taraskin Oleg +3 more
doaj +1 more source