Aug 2026· IACR Communications in Cryptology· Vol 3· 0 citations· 25 references
TL;DR
By utilizing any secure symmetric-key encryption scheme as a black-box primitive, this paper demonstrates a method for constructing a symmetric-key encryption scheme that remains secure even in the presence of partial key leakage.
Abstract
In a TLS session, the user is granted access solely to the encryption and decryption oracles,
ℰ
(
K
,
·
)
and
𝒟
(
K
,
·
)
, of a symmetric-key encryption scheme, which are treated as black boxes. Here,
ℰ
denotes the encryption algorithm,
𝒟
the decryption algorithm, and
K
the secret key. In this paper, by utilizing any secure symmetric-key encryption scheme as a black-box primitive, we demonstrate a method for constructing a symmetric-key encryption scheme that remains secure even in the presence of partial key leakage. This approach can, for example, enhance the security of TLS sessions.
Our construction employs the All-Or-Nothing Transform (AONT) in the pre-processing phase. Therefore we provide a tighter security analysis of existing AONT constructions, and establish a lower bound on their security. Finally we propose a new AONT construction that achieves security beyond this lower bound.
This paper analyzes the four-state QPKE scheme of Liu et al. and shows that its ciphertext structure leaks information about computational-basis plaintexts, and proposes sQPKE, a simple quantum public-key encryption scheme that uses only elementary operations.
This study proposes a novel signcryption scheme based on the algebraic structure of the group ring and proves its provable security, and shows that the security of the scheme relies on the intractability of two hard problems, i.e., bilinear Diffie–Hellman inversion in group ring and bilinear strong Diffie–Hellman assum...
This paper proposes a secure approach to enhance private key synchronization mechanisms in passkeys systems using Elliptic Curve Diffie-Hellman protocol and Zero-Knowledge Proofs in a peer-to-peer environment.
Assane Ilboudo, Didier Bassolé, Désiré Guel· EPJ Web of Conferences· 0 citations
Katz et al. (CANS'17) introduced Subset Predicate Encryption (SPE). This scheme is a generalization of broadcast encryption as it emulates the \emph{subset containment} predicate in the encrypted domain. They proposed two selectively IND-CPA secure SPE constructions in the small universe setting. They also showed some...
A new hybrid encryption framework that uses AES to provide fast symmetric block ciphers, RSA to allow for secure asymmetric public-key cryptography, and the bitwise XOR operator to add additional key-space through key masking and/or complexity to previously encrypted data is presented.
Nagaraju Pamarthi, N. N· Genetics and Molecular Resea...· 0 citations
Flying Ad Hoc Networks (FANETs) composed of highly mobile Unmanned Aerial Vehicles (UAVs) are increasingly employed in mission-critical applications. However, the open wireless medium, high mobility, and resource constraints of UAVs expose FANETs to severe security and privacy threats, particularly at the Medium Access...
Sufian Al Majmaie, Ghazal Ghajari, A. Aldujaili et al.· Applied System Innovation· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
