Search
Search Results
-
Two properties of prefix codes and uniquely decodable codes
The paper deals with the code length distributions for which the proportion of the codewords of a given length to all words of this length is a...
-
-
Secure Data Storage in Cloud Computing Using Code Based McEliece and NTRU Cryptosystems
Information must be kept private and secure because it is shared when people communicate online, making data protection essential. Data sharing is a...
-
Scalable local reconstruction code design for hot data reads in cloud storage systems
Since demand for data is significantly heterogeneous in cloud storage systems (CSSs), there is traffic congestion in nodes storing hot data. In...
-
Pauli Manipulation Detection Codes and Applications to Quantum Communication over Adversarial Channels
We introduce and explicitly construct a quantum error-detection code we coin a “Pauli Manipulation Detection” code (or PMD), which detects every...
-
QRnet: fast learning-based QR code image embedding
Quick Response (QR) codes usage in e-commerce is on the rise due to their versatility and ability to connect offline and online content, taking over...
-
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
We formally introduce, define, and construct memory-hard puzzles. Intuitively, for a difficulty parameter t, a cryptographic puzzle is memory-hard if...
-
Cryptanalysis and Repair of a Gabidulin Code Based Cryptosystem from ACISP 2018
This paper presents a key recovery attack on a rank metric based cryptosystem proposed by Lau and Tan at ACISP 2018, which uses Gabidulin codes as...
-
Digital Signature Scheme to Match Generalized Reed-Solomon Code over GF(q)
Code-based public key cryptography is one of the most widely studied cryptographic algorithms against quantum computing attacks. The main issue today...
-
Cryptanalysis of a code-based full-time signature
We present an attack against a code-based signature scheme based on the Lyubashevsky protocol that was recently proposed by Song, Huang, Mu, Wu and...
-
Testing Network Code
This chapter shows how to use tests to develop code that interacts with the network. You'll learn how to use a Stub Test Double to simulate different...
-
Entropy Coding
As the last stage before the code stream generated by the compression system, entropy coding aims to remove the information redundancy or coding...
-
An Analysis of the RankSign Signature Scheme with Rank Multipliers
We investigate the application of rank multipliers as introduced by Loidreau to repair the 2017 NIST proposal RankSign. In RankSign, a signature is...
-
Random Shortening of Linear Codes and Applications
Random linear codes (RLCs) are well known to have nice combinatorial properties and near-optimal parameters in many different settings. However,...
-
Enhanced Color QR Codes with Resilient Error Correction for Dirt-Prone Surfaces
This study focuses on overcoming the limitations of traditional QR codes, specifically their vulnerability to damage and insufficient error...
-
A PCP Theorem for Interactive Proofs and Applications
The celebrated PCP Theorem states that any language in \(\mathrm {NP}\)...
-
A Quantum Circuit to Speed-Up the Cryptanalysis of Code-Based Cryptosystems
The significant interest in cryptographic primitives providing sound security margins when facing attacks with quantum computers is witnessed by the...
-
Succinct Arguments for RAM Programs via Projection Codes
Motivated by the goal of proving statements that involve small subsets of a big database, we introduce and study the notion of projection codes. A...
-
Locally Decodable and Updatable Non-malleable Codes and Their Applications
Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the security...