Search arXiv⌕ Search

arXiv subjects

Khoa Nguyen

Publications and source records attributed to Khoa Nguyen.

At least 55 records · Page 3Linked to original sources

Split Without a Leak: Reducing Privacy Leakage in Split Learning

The popularity of Deep Learning (DL) makes the privacy of sensitive data more imperative than ever. As a result, various privacy-preserving techniques have been implemented to preserve user data privacy in DL. Among various privacy-preserving techniques, collaborative learning techniques, such as Split Learning (SL) have been utilized to accelerate the learning and prediction process. Initially, SL was considered a promising approach to data privacy. However, subsequent research has demonstrated that SL is susceptible to many types of attacks and, therefore, it cannot serve as a privacy-preserving technique. Meanwhile, countermeasures using a combination of SL and encryption have also been introduced to achieve privacy-preserving deep learning. In this work, we propose a hybrid approach using SL and Homomorphic Encryption (HE). The idea behind it is that the client encrypts the activation map (the output of the split layer between the client and the server) before sending it to the server. Hence, during both forward and backward propagation, the server cannot reconstruct the client's input data from the intermediate activation map. This improvement is important as it reduces privacy leakage compared to other SL-based works, where the server can gain valuable information about the client's input. In addition, on the MIT-BIH dataset, our proposed hybrid approach using SL and HE yields faster training time (about 6 times) and significantly reduced communication overhead (almost 160 times) compared to other HE-based approaches, thereby offering improved privacy protection for sensitive data in DL.

cs.CR↗

Split Ways: Privacy-Preserving Training of Encrypted Data Using Split Learning

Split Learning (SL) is a new collaborative learning technique that allows participants, e.g. a client and a server, to train machine learning models without the client sharing raw data. In this setting, the client initially applies its part of the machine learning model on the raw data to generate activation maps and then sends them to the server to continue the training process. Previous works in the field demonstrated that reconstructing activation maps could result in privacy leakage of client data. In addition to that, existing mitigation techniques that overcome the privacy leakage of SL prove to be significantly worse in terms of accuracy. In this paper, we improve upon previous works by constructing a protocol based on U-shaped SL that can operate on homomorphically encrypted data. More precisely, in our approach, the client applies Homomorphic Encryption (HE) on the activation maps before sending them to the server, thus protecting user privacy. This is an important improvement that reduces privacy leakage in comparison to other SL-based works. Finally, our results show that, with the optimum set of parameters, training with HE data in the U-shaped SL setting only reduces accuracy by 2.65% compared to training on plaintext. In addition, raw training data privacy is preserved.

cs.CR↗

Iterative Joint Parameters Estimation and Decoding in a Distributed Receiver for Satellite Applications and Relevant Cramer-Rao Bounds

This paper presents an algorithm for iterative joint channel parameter (carrier phase, Doppler shift and Doppler rate) estimation and decoding of transmission over channels affected by Doppler shift and Doppler rate using a distributed receiver. This algorithm is derived by applying the sum-product algorithm (SPA) to a factor graph representing the joint a posteriori distribution of the information symbols and channel parameters given the channel output. In this paper, we present two methods for dealing with intractable messages of the sum-product algorithm. In the first approach, we use particle filtering with sequential importance sampling (SIS) for the estimation of the unknown parameters. We also propose a method for fine-tuning of particles for improved convergence. In the second approach, we approximate our model with a random walk phase model, followed by a phase tracking algorithm and polynomial regression algorithm to estimate the unknown parameters. We derive the Weighted Bayesian Cramer-Rao Bounds (WBCRBs) for joint carrier phase, Doppler shift and Doppler rate estimation, which take into account the prior distribution of the estimation parameters and are accurate lower bounds for all considered Signal to Noise Ratio (SNR) values. Numerical results (of bit error rate (BER) and the mean-square error (MSE) of parameter estimation) suggest that phase tracking with the random walk model slightly outperforms particle filtering. However, particle filtering has a lower computational cost than the random walk model based method.

cs.IT↗

Neutrino mass matrices from localization in M-theory on $G_2$ orbifold

M-theory compactified on a $G_2$ manifold with resolved $E_8$ singularity is a promising candidate for a unified theory. The experimentally observed masses of quarks and charged leptons put a restriction on the moduli of the $G_2$ manifold. These moduli in turn uniquely determine the Dirac interactions of the neutrinos. In the paper, we explicitly compute the Dirac terms for neutrino mass matrix using the moduli from a localized model with resolved $E_8$ singularities on a $G_2$ manifold. This is a novel approach as the Dirac terms are not assumed but derived from the structure of quarks' and charged leptons' masses. Using known mass splittings and mixing angles of neutrinos, we show the acceptable region for Majorana terms. We also analyse the theoretical region for Majorana terms induced from the expectation values of right handed neutrinos through the Kolda-Martin mechanism. The intersection of the two regions indicates a restriction on neutrino masses. In particular, the lightest neutrino must have small but non-zero mass. Moreover, this also puts constraints on possible Majorana contributions from Kähler potential and superpotential, which can be traced down to a restriction on the geometry.We conclude that the masses of the two heavier light neutrinos are about $0.05 \text{ eV}$ and $0.009 \text{ eV}$ ($0.05 \text{ eV} $ and $0.05 \text{ eV} $)) for normal (inverted) hierarchy. In both hierarchies, we predict the light neutrinos are mostly Dirac type. Hence neutrino-less double-beta decay will be small. This is a testable result in a near future. Some bounds on heavy neutrinos are also derived.

hep-th↗

Exponentiation and Fourier transform of tensor modules of $\mathfrak{sl} (n+1)$

With the aid of the exponentiation functor and Fourier transform we introduce a class of modules $T(g,V,S)$ of $\mathfrak{sl} (n+1)$ of mixed tensor type. By varying the polynomial $g$, the $\mathfrak{gl}(n)$-module $V$, and the set $S$, we obtain important classes of weight modules over the Cartan subalgebra $\mathfrak h$ of $\mathfrak{sl} (n+1)$, and modules that are free over $\mathfrak h$. Furthermore, these modules are obtained through explicit presentation of the elements of $\mathfrak{sl} (n+1)$ in terms of differential operators and lead to new tensor coherent families of $\mathfrak{sl} (n+1)$. An isomorphism theorem and simplicity criterion for $T(g,V,S)$ is provided.

math.RT↗

Temporal Sub-sampling of Audio Feature Sequences for Automated Audio Captioning

Audio captioning is the task of automatically creating a textual description for the contents of a general audio signal. Typical audio captioning methods rely on deep neural networks (DNNs), where the target of the DNN is to map the input audio sequence to an output sequence of words, i.e. the caption. Though, the length of the textual description is considerably less than the length of the audio signal, for example 10 words versus some thousands of audio feature vectors. This clearly indicates that an output word corresponds to multiple input feature vectors. In this work we present an approach that focuses on explicitly taking advantage of this difference of lengths between sequences, by applying a temporal sub-sampling to the audio input sequence. We employ a sequence-to-sequence method, which uses a fixed-length vector as an output from the encoder, and we apply temporal sub-sampling between the RNNs of the encoder. We evaluate the benefit of our approach by employing the freely available dataset Clotho and we evaluate the impact of different factors of temporal sub-sampling. Our results show an improvement to all considered metrics.

eess.AS↗

Traceable Policy-Based Signatures and Instantiation from Lattices

Policy-based signatures (PBS) were proposed by Bellare and Fuchsbauer (PKC 2014) to allow an {\em authorized} member of an organization to sign a message on behalf of the organization. The user's authorization is determined by a policy managed by the organization's trusted authority, while the signature preserves the privacy of the organization's policy. Signing keys in PBS do not include user identity information and thus can be passed to others, violating the intention of employing PBS to restrict users' signing capability. In this paper, we introduce the notion of {\em traceability} for PBS by including user identity in the signing key such that the trusted authority will be able to open a suspicious signature and recover the signer's identity should the needs arise. We provide rigorous definitions and stringent security notions of traceable PBS (TPBS), capturing the properties of PBS suggested by Bellare-Fuchsbauer and resembling the "full traceability" requirement for group signatures put forward by Bellare-Micciancio-Warinschi (Eurocrypt 2003). As a proof of concept, we provide a modular construction of TPBS, based on a signature scheme, an encryption scheme and a zero-knowledge proof system. Furthermore, to demonstrate the feasibility of achieving TPBS from concrete, quantum-resistant assumptions, we give an instantiation based on lattices.

cs.CR↗

Provably Secure Group Signature Schemes from Code-Based Assumptions

We solve an open question in code-based cryptography by introducing two provably secure group signature schemes from code-based assumptions. Our basic scheme satisfies the CPA-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem, the Learning Parity with Noise problem, and a variant of the Syndrome Decoding problem. The construction produces smaller key and signature sizes than the previous group signature schemes from lattices, as long as the cardinality of the underlying group does not exceed $2^{24}$, which is roughly comparable to the current population of the Netherlands. We develop the basic scheme further to achieve the strongest anonymity notion, i.e., CCA-anonymity, with a small overhead in terms of efficiency. The feasibility of two proposed schemes is supported by implementation results. Our two schemes are the first in their respective classes of provably secure groups signature schemes. Additionally, the techniques introduced in this work might be of independent interest. These are a new verifiable encryption protocol for the randomized McEliece encryption and a novel approach to design formal security reductions from the Syndrome Decoding problem.

cs.CR↗

Forward-Secure Group Signatures from Lattices

Group signature is a fundamental cryptographic primitive, aiming to protect anonymity and ensure accountability of users. It allows group members to anonymously sign messages on behalf of the whole group, while incorporating a tracing mechanism to identify the signer of any suspected signature. Most of the existing group signature schemes, however, do not guarantee security once secret keys are exposed. To reduce potential damages caused by key exposure attacks, Song (ACMCCS 2001) put forward the concept of forward-secure group signature (FSGS), which prevents attackers from forging group signatures pertaining to past time periods even if a secret group signing key is revealed at the current time period. For the time being, however, all known secure FSGS schemes are based on number-theoretic assumptions, and are vulnerable against quantum computers. In this work, we construct the first lattice-based FSGS scheme. Our scheme is proven secure under the Short Integer Solution and Learning With Errors assumptions. At the heart of our construction is a scalable lattice-based key evolving mechanism, allowing users to periodically update their secret keys and to efficiently prove in zero-knowledge that key evolution process is done correctly. To realize this essential building block, we first employ the Bonsai tree structure by Cash et al. (EUROCRYPT 2010) to handle the key evolution process, and then develop Langlois et al.'s construction (PKC 2014) to design its supporting zero-knowledge protocol.

cs.CR↗

Accountable Tracing Signatures from Lattices

Group signatures allow users of a group to sign messages anonymously in the name of the group, while incorporating a tracing mechanism to revoke anonymity and identify the signer of any message. Since its introduction by Chaum and van Heyst (EUROCRYPT 1991), numerous proposals have been put forward, yielding various improvements on security, efficiency and functionality. However, a drawback of traditional group signatures is that the opening authority is given too much power, i.e., he can indiscriminately revoke anonymity and there is no mechanism to keep him accountable. To overcome this problem, Kohlweiss and Miers (PoPET 2015) introduced the notion of accountable tracing signatures (ATS) - an enhanced group signature variant in which the opening authority is kept accountable for his actions. Kohlweiss and Miers demonstrated a generic construction of ATS and put forward a concrete instantiation based on number-theoretic assumptions. To the best of our knowledge, no other ATS scheme has been known, and the problem of instantiating ATS under post-quantum assumptions, e.g., lattices, remains open to date. In this work, we provide the first lattice-based accountable tracing signature scheme. The scheme satisfies the security requirements suggested by Kohlweiss and Miers, assuming the hardness of the Ring Short Integer Solution (RSIS) and the Ring Learning With Errors (RLWE) problems. At the heart of our construction are a lattice-based key-oblivious encryption scheme and a zero-knowledge argument system allowing to prove that a given ciphertext is a valid RLWE encryption under some hidden yet certified key. These technical building blocks may be of independent interest, e.g., they can be useful for the design of other lattice-based privacy-preserving protocols.

cs.CR↗

Zero-Knowledge Password Policy Check from Lattices

Passwords are ubiquitous and most commonly used to authenticate users when logging into online services. Using high entropy passwords is critical to prevent unauthorized access and password policies emerged to enforce this requirement on passwords. However, with current methods of password storage, poor practices and server breaches have leaked many passwords to the public. To protect one's sensitive information in case of such events, passwords should be hidden from servers. Verifier-based password authenticated key exchange, proposed by Bellovin and Merrit (IEEE S\&P, 1992), allows authenticated secure channels to be established with a hash of a password (verifier). Unfortunately, this restricts password policies as passwords cannot be checked from their verifier. To address this issue, Kiefer and Manulis (ESORICS 2014) proposed zero-knowledge password policy check (ZKPPC). A ZKPPC protocol allows users to prove in zero knowledge that a hash of the user's password satisfies the password policy required by the server. Unfortunately, their proposal is not quantum resistant with the use of discrete logarithm-based cryptographic tools and there are currently no other viable alternatives. In this work, we construct the first post-quantum ZKPPC using lattice-based tools. To this end, we introduce a new randomised password hashing scheme for ASCII-based passwords and design an accompanying zero-knowledge protocol for policy compliance. Interestingly, our proposal does not follow the framework established by Kiefer and Manulis and offers an alternate construction without homomorphic commitments. Although our protocol is not ready to be used in practice, we think it is an important first step towards a quantum-resistant privacy-preserving password-based authentication and key exchange system.

cs.CR↗

Lattice-Based Group Signatures: Achieving Full Dynamicity (and Deniability) with Ease

In this work, we provide the first lattice-based group signature that offers full dynamicity (i.e., users have the flexibility in joining and leaving the group), and thus, resolve a prominent open problem posed by previous works. Moreover, we achieve this non-trivial feat in a relatively simple manner. Starting with Libert et al.'s fully static construction (Eurocrypt 2016) - which is arguably the most efficient lattice-based group signature to date, we introduce simple-but-insightful tweaks that allow to upgrade it directly into the fully dynamic setting. More startlingly, our scheme even produces slightly shorter signatures than the former, thanks to an adaptation of a technique proposed by Ling et al. (PKC 2013), allowing to prove inequalities in zero-knowledge. Our design approach consists of upgrading Libert et al.'s static construction (EUROCRYPT 2016) - which is arguably the most efficient lattice-based group signature to date - into the fully dynamic setting. Somewhat surprisingly, our scheme produces slightly shorter signatures than the former, thanks to a new technique for proving inequality in zero-knowledge without relying on any inequality check. The scheme satisfies the strong security requirements of Bootle et al.'s model (ACNS 2016), under the Short Integer Solution (SIS) and the Learning With Errors (LWE) assumptions. Furthermore, we demonstrate how to equip the obtained group signature scheme with the deniability functionality in a simple way. This attractive functionality, put forward by Ishida et al. (CANS 2016), enables the tracing authority to provide an evidence that a given user is not the owner of a signature in question. In the process, we design a zero-knowledge protocol for proving that a given LWE ciphertext does not decrypt to a particular message.

cs.CR↗

Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation

Efficient user revocation is a necessary but challenging problem in many multi-user cryptosystems. Among known approaches, server-aided revocation yields a promising solution, because it allows to outsource the major workloads of system users to a computationally powerful third party, called the server, whose only requirement is to carry out the computations correctly. Such a revocation mechanism was considered in the settings of identity-based encryption and attribute-based encryption by Qin et al. (ESORICS 2015) and Cui et al. (ESORICS 2016), respectively. In this work, we consider the server-aided revocation mechanism in the more elaborate setting of predicate encryption (PE). The latter, introduced by Katz, Sahai, and Waters (EUROCRYPT 2008), provides fine-grained and role-based access to encrypted data and can be viewed as a generalization of identity-based and attribute-based encryption. Our contribution is two-fold. First, we formalize the model of server-aided revocable predicate encryption (SR-PE), with rigorous definitions and security notions. Our model can be seen as a non-trivial adaptation of Cui et al.'s work into the PE context. Second, we put forward a lattice-based instantiation of SR-PE. The scheme employs the PE scheme of Agrawal, Freeman and Vaikuntanathan (ASIACRYPT 2011) and the complete subtree method of Naor, Naor, and Lotspiech (CRYPTO 2001) as the two main ingredients, which work smoothly together thanks to a few additional techniques. Our scheme is proven secure in the standard model (in a selective manner), based on the hardness of the Learning With Errors (LWE) problem.

cs.CR↗

Multiphoton-Excited Fluorescence of Silicon-Vacancy Color Centers in Diamond

Silicon-vacancy color centers in nanodiamonds are promising as fluorescent labels for biological applications, with a narrow, non-bleaching emission line at 738\,nm. Two-photon excitation of this fluorescence offers the possibility of low-background detection at significant tissue depth with high three-dimensional spatial resolution. We have measured the two-photon fluorescence cross section of a negatively-charged silicon vacancy (SiV$^-$) in ion-implanted bulk diamond to be $0.74(19) \times 10^{-50}{\rm cm^4\;s/photon}$ at an excitation wavelength of 1040\,nm. In comparison to the diamond nitrogen vacancy (NV) center, the expected detection threshold of a two-photon excited SiV center is more than an order of magnitude lower, largely due to its much narrower linewidth. We also present measurements of two- and three-photon excitation spectra, finding an increase in the two-photon cross section with decreasing wavelength, and discuss the physical interpretation of the spectra in the context of existing models of the SiV energy-level structure.

physics.optics↗

The orbit intersection problem for linear spaces and semiabelian varieties

Let f_1 and f_2 be affine maps of the N-th dimensional affine space over the complex numbers, i.e., f_i(x):=A_i x + y_i (where each A_i is an N-by-N matrix and y_i is a given vector), and let x_1 and x_2 be vectors such that x_i is not preperiodic under the action of f_i for i=1,2. If none of the eigenvalues of the matrices A_i is a root of unity, then we prove that the set of pairs (n_1,n_2) of non-negative integers such that f_1^{n_1}(x_1)=f_2^{n_2}(x_2) is a finite union of sets of the form (m_1k + \ell_1, m_2k + \ell_2) where m_1, m_2, \ell_1, \ell_2 are given non-negative integers, and k is varying among all non-negative integers. Using this result, we prove that for any two self-maps Φ_i(x) := Φ_{i,0}(x)+y_i on a semiabelian variety X defined over the complex numbers (where Φ_{i,0} is an endomorphism of X and y_i is a given point of X), if none of the eigenvalues of the induced linear action DΦ_{i,0} on the tangent space at the identity 0 of X is a root of unity (for i=1,2), then for any two non-preperiodic points x_1,x_2, the set of pairs (n_1,n_2) of non-negative integers such that Φ_1^{n_1}(x_1) = Φ_2^{n_2}(x_2) is a finite union of sets of the form (m_1k + \ell_1, m_2k + \ell_2) where m_1,m_2,\ell_1,\ell_2 are given non-negative integers, and k is varying among all non-negative integers. We give examples to show that the above condition on eigenvalues is necessary and introduce certain geometric properties that imply such a condition. Our method involves an analysis of certain systems of polynomial-exponential equations and the p-adic exponential map for semiabelian varieties.

math.NT↗

The Dynamical Andre-Oort Conjecture: Unicritical Polynomials

We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial analysis of certain algebraic correspondences on the complement of the Mandelbrot set $M_2$ (or generalized Mandelbrot set $M_d$ for degree $d>2$), we classify all complex plane curves $C$ with Zariski-dense subsets of points $(a,b)\in C$, such that both $z^d+a$ and $z^d+b$ are simultaneously post-critically finite for a fixed degree $d\geq 2$. Our result is analogous to the famous result of Andre regarding plane curves which contain infinitely many points with both coordinates CM parameters in the moduli space of elliptic curves, and is the first complete case of the dynamical Andre-Oort phenomenon studied by Baker and DeMarco.

math.AG↗

Portraits of preperiodic points for rational maps

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $φ\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $φ$ is totally ramified, and let $α\in K$. We show that for all but finitely many pairs $(m,n)\in \mathbb{Z}_{\ge 0}\times \mathbb{N}$ there exists a place $\mathfrak{p}$ of $K$ such that the point $α$ has preperiod $m$ and minimum period $n$ under the action of $φ$. This answers a conjecture made by Ingram-Silverman and Faber-Granville. We prove a similar result, under suitable modification, also when $φ$ has points where it is totally ramified. We give several applications of our result, such as showing that for any tuple $(c_1,\dots , c_{d-1})\in k^{n-1}$ and for almost all pairs $(m_i,n_i)\in \mathbb{Z}_{\ge 0}\times \mathbb{N}$ for $i=1,\dots, d-1$, there exists a polynomial $f\in k[z]$ of degree $d$ in normal form such that for each $i=1,\dots, d-1$, the point $c_i$ has preperiod $m_i$ and minimum period $n_i$ under the action of $f$.

math.NT↗

A case of the Dynamical Andre-Oort Conjecture

We prove a special case of the Dynamical Andre-Oort Conjecture formulated by Baker and DeMarco. For any integer d>1, we show that for a rational plane curve C parametrized by (t, h(t)) for some non-constant polynomial h with complex coefficients, if there exist infinitely many points (a,b) on the curve C such that both z^d+a and z^d+b are postcritically finite maps, then h(z)=uz for a (d-1)-st root of unity u. As a by-product of our proof, we show that the Mandelbrot set is not the filled Julia set of any polynomial with complex coefficients.

math.NT↗