Results 31 to 40 of about 367,345 (251)
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
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
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
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
On the Design of Cryptographic Primitives [PDF]
Acta Applicandae Mathematicae, 2006 The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol design. In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic ...
Caballero-Gil, Pino +1 more
openaire +3 more sources
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
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 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
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
Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
IACR Transactions on Symmetric Cryptology, 2018 Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this
Joan Daemen +2 more
doaj +1 more source