Related papers: Random subgroups and analysis of the length-based …
Attack graphs are commonly used to analyse the security of medium-sized to large networks. Based on a scan of the network and likelihood information of vulnerabilities, attack graphs can be transformed into Bayesian Attack Graphs (BAGs).…
In this paper, we study some characterizations of $q$-spaces, strict $q$-spaces and strong $q$-spaces under $\omega$-balanced topological groups as follows: (1) A topological group $G$ is $\omega$-balanced and a $q$-space if and only if for…
Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the…
We propose a definition of {\it security} and a definition of {\it robustness} of networks against the cascading failure models of deliberate attacks and random errors respectively, and investigate the principles of the security and…
We describe a class (called regular) of invariant generalized complex structures on a real semisimple Lie group G. The problem reduces to the description of admissible pairs (\gk, \omega), where \gk is an appropriate regular subalgebra of…
We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…
Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state…
Exploring the symmetries underlying a previously proposed encryption scheme which relies on single-qubit rotations, we derive an improved upper bound on the maximum information that an eavesdropper might extract from all the available…
We focus our attention to the set $\gl{\coring{C}}$ of grouplike elements of a coring $\coring{C}$ over a ring $A$. We do some observations on the actions of the groups $U(A)$ and $\aut{\coring{C}}$ of units of $A$ and of automorphisms of…
SIDH is a post-quantum key exchange algorithm based on the presumed difficulty of finding isogenies between supersingular elliptic curves. However, SIDH and related cryptosystems also reveal additional information: the restriction of a…
A topological gyrogroup is a gyrogroup endowed with a compatible topology such that the multiplication is jointly continuous and the inverse is continuous. In this paper, we study the quotient gyrogroups in topological gyrogroups with…
We investigate the security against collective attacks of a continuous variable quantum key distribution scheme in the asymptotic key limit for a realistic setting. The quantum channel connecting the two honest parties is assumed to be…
Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation.…
In the secure groupcast problem, a transmitter wants to securely groupcast a message with the maximum rate to the first $N$ of $K$ receivers by broadcasting with the minimum bandwidth, where the $K$ receivers are each equipped with a key…
We develop cryptographically secure techniques to guarantee unconditional privacy for respondents to polls. Our constructions are efficient and practical, and are shown not to allow cheating respondents to affect the ``tally'' by more than…
Deep learning on graph structures has shown exciting results in various applications. However, few attentions have been paid to the robustness of such models, in contrast to numerous research work for image or text adversarial attack and…
Adversarial attacks on deep-learning models pose a serious threat to their reliability and security. Existing defense mechanisms are narrow addressing a specific type of attack or being vulnerable to sophisticated attacks. We propose a new…
Lo and Ko in [1] have developed some attacks on the cryptosystem called AlphaEta [2], claiming that these attacks undermine the security of AlphaEta for both direct encryption and key generation. In this paper, we show that their arguments…
The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such…
For $n \geq 2$ let $\Delta$ be a Dynkin diagram of rank $n$ and let $I = {1, >..., n}$ be the set of labels of $\Delta$. A group $G$ admits a weak Phan system of type $\Delta$ over $\mathbb{C}$ if $G$ is generated by subgroups $U_i$, $i \in…