Results 21 to 30 of about 380,993 (266)
ETRI Journal, 2023 Hardware security primitives, also known as physical unclonable functions(PUFs), perform innovative roles to extract the randomness unique to specific hardware.
Mi-Kyung Oh +3 more
doaj +1 more source
Experimental cheat-sensitive quantum weak coin flipping
Nature Communications, 2023 Quantum-enhanced versions of weak coin flipping (a cryptographic primitive where two mistrustful parties agree on a random bit while favouring opposite outcomes) have been proposed in the past but never realised.
Simon Neves +5 more
doaj +1 more source
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
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
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
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
Cryptanalysis of a Pairing-free Certificateless Signcryption scheme
ICT Express, 2021 Signcryption is a very useful cryptographic primitive that aims to achieve authentication and confidentiality in an efficient manner. We cryptanalyze the signcryption scheme of Wei and Ma (2019) which is claimed to be secure.
Philemon Kasyoka +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
Key Assignment Scheme with Authenticated Encryption
IACR Transactions on Symmetric Cryptology, 2018 The Key Assignment Scheme (KAS) is a well-studied cryptographic primitive used for hierarchical access control (HAC) in a multilevel organisation where the classes of people with higher privileges can access files of those with lower ones.
Suyash Kandele, Souradyuti Paul
doaj +1 more source