Search
Search Results
-
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for \(\varvec{\Sigma }\)-Protocols
The Schnorr identification and signature schemes have been among the most influential cryptographic protocols of the past 3 decades. Unfortunately,...
-
A systematic review on research utilising artificial intelligence for open source intelligence (OSINT) applications
This paper presents a systematic review to identify research combining artificial intelligence (AI) algorithms with Open source intelligence (OSINT)...
-
Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed–Muller-type codes
For projective Reed–Muller-type codes we give a global duality criterion in terms of the v-number and the Hilbert function of a vanishing ideal. As...
-
-
Online Geometric Covering and Piercing
We consider the online version of the piercing set problem, where geometric objects arrive one by one, and the online algorithm must maintain a valid...
-
Slim Tree-Cut Width
Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue of treewidth for edge cuts. Unfortunately, in spite of its...
-
ZLR: a fast online authenticated encryption scheme achieving full security
Online authenticated encryption has been considered of practical relevance in light-weight environments due to low latency and constant memory usage....
-
Approximating Long Cycle Above Dirac’s Guarantee
Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit...
-
Simple Constructions from (Almost) Regular One-Way Functions
Two of the most useful cryptographic primitives that can be constructed from one-way functions are pseudorandom generators (PRGs) and universal...
-
New Algorithms for Steiner Tree Reoptimization
Reoptimization is a setting in which we are given a good approximate solution of an optimization problem instance and a local modification that...
-
A compliance-based ranking of certificate authorities using probabilistic approaches
The security of the global Certification Authority (CA) system has recently been compromised as a result of attacks on the Public Key Infrastructure...
-
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
The constraint satisfaction problem (CSP) on a finite relational structure B is to decide, given a set of constraints on variables where the...
-
Approximation Algorithms for Covering Vertices by Long Paths
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seems to escape from the...
-
IoT cybersecurity in 5G and beyond: a systematic literature review
The 5th generation (5G) and beyond use Internet of Things (IoT) to offer the feature of remote monitoring for different applications such as...
-
Constructions of t-strongly multimedia IPP codes with length \(t+1\)
Strongly multimedia identifiable parent property code ( t -SMIPPC) was introduced for protecting multimedia contents from illegally redistributing...
-
Some new constructions of optimal linear codes and alphabet-optimal \((r,\delta )\)-locally repairable codes
In distributed storage systems, an r -Locally Repairable Code ( r -LRC) ensures that a failed symbol can be recovered by accessing at most r other...
-
Structure of CSS and CSS-T quantum codes
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound...