Related papers: Evolving k-Threshold Visual Cryptography Schemes
We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares…
In this work, we propose a novel rate control algorithm for Versatile Video Coding (VVC) standard based on its distinct rate-distortion characteristics. By modelling the transform coefficients with the composite Cauchy distribution, higher…
Inspired by Naor et al.'s visual secret sharing (VSS) scheme, a novel n out of n quantum visual secret sharing (QVSS) scheme is proposed, which consists of two phases: sharing process and recovering process. In the first process, the color…
Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum…
In the k-center problem, given a metric space V and a positive integer k, one wants to select k elements (centers) of V and an assignment from V to centers, minimizing the maximum distance between an element of V and its assigned center.…
In this paper we define a kind of decomposition for a quantum access structure. We propose a conception of minimal maximal quantum access structure and obtain a sufficient and necessary condition for minimal maximal quantum access…
In this paper, we study the problem of fair clustering on the $k-$center objective. In fair clustering, the input is $N$ points, each belonging to at least one of $l$ protected groups, e.g. male, female, Asian, Hispanic. The objective is to…
When considering post-training quantization, prior work has typically focused on developing a mixed precision scheme or learning the best way to partition a network for quantization. In our work, CPT-V, we look at a general way to improve…
We introduce new quantum key distribution protocols using quantum continuous variables, that are secure against individual attacks for any transmission of the optical line between Alice and Bob. In particular, it is not required that this…
In this paper, we investigate a novel $(2,2)$-threshold scheme and then generalize this to a $(n,n)$-threshold scheme for quantum secret sharing (QSS) which makes use of the fundamentals of Analytic Geometry. The dealer aptly selects GHZ…
A $((k,n))$ quantum threshold secret sharing (QTS) scheme is a quantum cryptographic protocol for sharing a quantum secret among $n$ parties such that the secret can be recovered by any $k$ or more parties while $k-1$ or fewer parties have…
Visual Cryptography comes under cryptography domain. It deals with encrypting and decrypting of visual information like pictures, texts, videos $ etc.$ Multi Secret Image Sharing (MSIS) scheme is a part of visual cryptography that provides…
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over…
Traditional vulnerability scanning methods are time-consuming and indecisive, and they negatively affect network performance by generating high network traffic. In this paper, we present a novel vulnerability scanner that is time-efficient,…
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direc- tion, this paper presents a novel approach to share a secret among a hierarchy of users while…
Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold. We denote this problem as Goal Clustering (GC). This…
Quantum key distribution (QKD) represents a cornerstone of secure communication in the quantum era. While discrete-variable QKD (DV-QKD) protocols were historically the first to demonstrate secure key exchange, continuous-variable QKD…
It is known that for any general access structure, a secret sharing scheme (SSS) can be constructed from an (m,m)-threshold scheme by using the so-called cumulative map or from a (t,m)-threshold SSS by a modified cumulative map. However,…
Recovering the spatial layout of the cameras and the geometry of the scene from extreme-view images is a longstanding challenge in computer vision. Prevailing 3D reconstruction algorithms often adopt the image matching paradigm and presume…
A privacy-preserving support vector machine (SVM) computing scheme is proposed in this paper. Cloud computing has been spreading in many fields. However, the cloud computing has some serious issues for end users, such as the unauthorized…