Results 21 to 30 of about 408,401 (216)
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
Enhanced Matrix Power Function for Cryptographic Primitive Construction
Symmetry, 2018 A new enhanced matrix power function (MPF) is presented for the construction of cryptographic primitives. According to the definition in previously published papers, an MPF is an action of two matrices powering some base matrix on the left and right. The
E. Sakalauskas
semanticscholar +1 more source
Cryptographic primitives in blockchains
Journal of Network and Computer Applications, 2019 Abstract Blockchain, as one of the crypto-intensive creatures, has become a very hot topic recently. Although many surveys have recently been dedicated to the security and privacy issues of blockchains, there still lacks a systematic examination on the cryptographic primitives in blockchains.
Licheng Wang +4 more
openaire +1 more source
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
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
A cryptographic primitive based on hidden-order groups
Journal of Mathematical Cryptology, 2009 Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known.
Saxena Amitabh, Soh Ben
doaj +1 more source
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We give a protocol for producing certifiable randomness from a single untrusted quantum device that is polynomial-time bounded. The randomness is certified to be statistically close to uniform from the point of view of any computationally unbounded ...
Zvika Brakerski +4 more
semanticscholar +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
Xoodyak, a lightweight cryptographic scheme
IACR Transactions on Symmetric Cryptology, 2020 In this paper, we present Xoodyak, a cryptographic primitive that can be used for hashing, encryption, MAC computation and authenticated encryption. Essentially, it is a duplex object extended with an interface that allows absorbing strings of arbitrary ...
J. Daemen +4 more
semanticscholar +1 more source