Search
Search Results
-
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Polynomial commitments schemes are a powerful tool that enables one party to commit to a polynomial p of degree d , and prove that the committed...
-
The Price of Active Security in Cryptographic Protocols
We construct the first actively-secure Multi-Party Computation (MPC) protocols with an arbitrary number of parties in the dishonest majority setting,...
-
-
Adaptive context-aware access control for IoT environments leveraging fog computing
The increasing use of the Internet of Things (IoT) has driven the demand for enhanced and robust access control methods to protect resources from...
-
Using the ACE framework to enforce access and usage control with notifications of revoked access rights
The standard ACE framework provides authentication and authorization mechanisms similar to those of the standard OAuth 2.0 framework, but it is...
-
Algebraic lattices coming from \({\mathbb {Z}}\)-modules generalizing ramified prime ideals in odd prime degree cyclic number fields
Lattice theory has shown to be useful in information theory, and rotated lattices with high modulation diversity have been extensively studied as an...
-
Automating shareable cyber threat intelligence production for closed source software vulnerabilities: a deep learning based detection system
Software can be vulnerable to various types of interference. The production of cyber threat intelligence for closed source software requires...
-
Trust management in the internet of vehicles: a systematic literature review of blockchain integration
The Internet of Vehicles (IoV) promises to revolutionize transportation in smart cities, but its interconnectedness raises critical security and...
-
Vectorial negabent concepts: similarities, differences, and generalizations
In Pasalic et al. (IEEE Trans Inf Theory 69:2702–2712, 2023), and in Anbar and Meidl (Cryptogr Commun 10:235–249, 2018), two different vectorial...
-
Expediting the design and development of secure cloud-based mobile apps
The adoption and popularity of mobile devices by end-users is partially driven by the increasing development and availability of mobile applications...
-
Some self-dual codes and isodual codes constructed by matrix product codes
In 2020, Cao et al. proved that any repeated-root constacyclic code is monomially equivalent to a matrix product code of simple-root constacyclic...
-
Stable coherent systems
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this...
-
Some constacyclic BCH codes with good parameters
BCH codes as a subclass of constacyclic BCH codes have been widely studied, while the results on the parameters of BCH codes over finite fields are...
-
Multi-party codebook distribution strategy based on secret sharing
The paper addresses the issue of secure distribution of codebooks in the field of information security, particularly in the domain of covert...
-
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
Chameleon-hash functions, introduced by Krawczyk and Rabin (NDSS’00), are trapdoor collision-resistant hash functions parametrized by a public key....
-
Several families of q-ary cyclic codes with length \(q^m-1\)
It is very hard to construct an infinite family of cyclic codes of rate close to one half whose minimum distances have a good bound. Tang-Ding codes...