English
Related papers

Related papers: Security amplification by composition: The case of…

200 papers

While federated learning protects data privacy, it also makes the model update process vulnerable to long-term stealthy perturbations. Existing studies on backdoor attacks in federated learning mainly focus on trigger design or poisoning…

Machine Learning · Computer Science 2026-03-05 Wang Jian , Shen Hong , Ke Wei , Liu Xue Hua

This thesis aims to use intelligent systems to extend and improve performance and security of cryptographic techniques. Genetic algorithms framework for cryptanalysis problem is addressed. A novel extension to the differential cryptanalysis…

Neural and Evolutionary Computing · Computer Science 2014-01-16 Ayman M. Bahaa-Eldin

A hybrid encryption scheme is a public-key encryption system that consists of a public-key part called the key encapsulation mechanism (KEM), and a (symmetric) secret-key part called data encapsulation mechanism (DEM): the public-key part…

Cryptography and Security · Computer Science 2021-04-05 Setareh Sharifian , Reihaneh Safavi-Naini

The Unshared Secret Key Cryptography (USK), recently proposed by the authors, guarantees Shannon's ideal secrecy and perfect secrecy for MIMO wiretap channels, without requiring secret key exchange. However, the requirement of infinite…

Cryptography and Security · Computer Science 2014-11-11 Shuiyin Liu , Yi Hong , Emanuele Viterbo

In contrast to classical public-key cryptosystems, where the security of encoded messages relies on on computational assumptions, Quantum Key Distribution (QKD) enables two distant parties to establish a shared secret key that, when…

Mixed-integer optimization problems arise in a wide range of control applications. Benders decomposition is a widely used algorithm for solving such problems by decomposing them into a mixed-integer master problem and a continuous…

Optimization and Control · Mathematics 2026-04-07 Bernard T. Agyeman , Zhe Li , Ilias Mitrai , Prodromos Daoutidis

Shannon sought security against the attacker with unlimited computational powers: *if an information source conveys some information, then Shannon's attacker will surely extract that information*. Diffie and Hellman refined Shannon's…

Cryptography and Security · Computer Science 2015-03-19 Dusko Pavlovic

A semantic framework for analyzing safe composition of distributed programs is presented. Its applicability is illustrated by a study of program composition when communication is reliable but not necessarily FIFO\@. In this model, special…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-09-29 Kai Engelhardt , Yoram Moses

We develop a generalized framework for invariant-based cryptography by extending the use of structural identities as core cryptographic mechanisms. Starting from a previously introduced scheme where a secret is encoded via a four-point…

Cryptography and Security · Computer Science 2025-05-14 Stanislav Semenov

Deep ensemble learning has been shown to improve accuracy by training multiple neural networks and averaging their outputs. Ensemble learning has also been suggested to defend against membership inference attacks that undermine privacy. In…

Machine Learning · Computer Science 2023-05-26 Shahbaz Rezaei , Zubair Shafiq , Xin Liu

This paper is the part-II of the previous paper and introduces the world of Yuen's concept. In the theory of cryptology, the Shannon impossibility theorem states that the upper bound of the security of a plaintext against a ciphertext-only…

Quantum Physics · Physics 2025-04-25 Osamu Hirota

The thesis is mainly about the construction and implementation of cyclic mutually unbiased bases, dealing with different entanglement structures by discussing the related group structures. A recursive construction for Fermat number…

Quantum Physics · Physics 2019-07-08 Ulrich Seyfarth

This work is intended as an introduction to cryptographic security and a motivation for the widely used Quantum Key Distribution (QKD) security definition. We review the notion of security necessary for a protocol to be usable in a larger…

Quantum Physics · Physics 2014-09-12 Christopher Portmann , Renato Renner

We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in…

Cryptography and Security · Computer Science 2024-10-22 Anne Broadbent , Martti Karvonen

We are interested in investigating the security of source encryption with a symmetric key under side-channel attacks. In this paper, we propose a general framework of source encryption with a symmetric key under the side-channel attacks,…

Information Theory · Computer Science 2022-05-05 Yasutada Oohama , Bagus Santoso

A password composition policy restricts the space of allowable passwords to eliminate weak passwords that are vulnerable to statistical guessing attacks. Usability studies have demonstrated that existing password composition policies can…

Cryptography and Security · Computer Science 2013-02-26 Jeremiah Blocki , Saranga Komanduri , Ariel Procaccia , Or Sheffet

In safety-critical machine learning applications, it is crucial to defend models against adversarial attacks -- small modifications of the input that change the predictions. Besides rigorously studied $\ell_p$-bounded additive…

Machine Learning · Computer Science 2022-08-16 Mikhail Pautov , Nurislam Tursynbek , Marina Munkhoeva , Nikita Muravev , Aleksandr Petiushko , Ivan Oseledets

A reliable deepfake detector or spoofing countermeasure (CM) should be robust in the face of unpredictable spoofing attacks. To encourage the learning of more generaliseable artefacts, rather than those specific only to known attacks, CMs…

Cryptography and Security · Computer Science 2024-01-09 Wanying Ge , Xin Wang , Junichi Yamagishi , Massimiliano Todisco , Nicholas Evans

The goal of an Intrusion Detection is inadequate to detect errors and unusual activity on a network or on the hosts belonging to a local network by monitoring network activity. Algorithms for building detection models are broadly classified…

Networking and Internet Architecture · Computer Science 2010-10-28 M. Sadiq Ali Khan

Complementarity relations between various characterizations of a probability distribution are at the core of information theory. In particular, lower and upper bounds for the entropic function are of great importance. In applied topics, we…

Quantum Physics · Physics 2022-09-07 Alexey E. Rastegin