BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Khoa Nguyen

Khoa Nguyen appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
math.NTmath.DSmath.AGCryptography and SecurityComputer Visioneess.ASeess.SPhep-phhep-thInformation TheoryMachine Learningmath.CVmath.ITSound

Catalog footprint

What is connected

13works
14topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

13 published item(s)

preprint2026arXiv

Towards multi-modal forgery representation learning for AI-generated video detection and localization

Recent advances in generative AI have democratized video creation at scale. AI-generated videos, including partially manipulated clips across visual and audio channels, pose escalating risks of semantic distortion and misuse, which motivates the need for reliable detection tools. Most existing AI-generated video detectors remain limited by single- or partial-modality of data modeling and the lack of fine-grained temporal forgery localization. To address these challenges, our primary novelty introduces a core architecture that jointly integrates an LMM semantic branch with a spatio-temporal (ST) visual branch and a multi-scale partial-spoof (PS) audio branch. This multi-modal approach enables simultaneous detection and fine-grained temporal localization of partially manipulated AI-generated video forgeries. Extensive experiments show that this approach outperforms existing state-of-the-art methods.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

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$.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Algebraic independence of local conjugacies and related questions in polynomial dynamics

Let $K$ be an algebraically closed field of characteristic 0 and $f\in K[t]$ a polynomial of degree $d\geq 2$. There exists a local conjugacy $ψ_f(t)\in tK[[1/t]]$ such that $ψ_f(t^d)=f(ψ_f(t))$. It has been known that $ψ_f$ is transcendental over $K(t)$ if $f$ is not conjugate to $t^d$ or a constant multiple of the Chebyshev polynomial. In this paper, we study the algebraic independence of $ψ_{f_1}$,\ldots,$ψ_{f_n}$ using a recent result of Medvedev-Scanlon. Related questions in transcendental number theory and canonical heights in arithmetic dynamics are also discussed.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Evidence for the Dynamical Brauer-Manin Criterion

Let f:X->X be a morphism of a variety over a number field K. We consider local conditions and a "Bruaer-Manin" condition, defined by Hsia and Silverman, for the orbit of a point P in X(K) to be disjoint from a subvariety V of X, i.e., the intersection of the orbit of P with V is empty. We provide evidence that the dynamical Brauer-Manin condition is sufficient to explain the lack of points in the intersection of the orbit of P with V; this evidence stems from a probabilistic argument as well as unconditional results in the case of etale maps.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Some Arithmetic Dynamics of Diagonally Split Polynomial Maps

Let $n\geq 2$, and let $f$ be a polynomial of degree at least 2 with coefficients in a number field or a characteristic 0 function field $K$. We present two arithmetic applications of a recent theorem of Medvedev-Scanlon to the dynamics of the map $(f,...,f):\ (\bP^1_{K})^n\longrightarrow (\bP^1_K)^n$, namely the dynamical analogues of the Hasse principle and the Bombieri-Masser-Zannier height bound theorem. In particular, we prove that the Hasse principle holds when we intersect an orbit and a preperiodic subvariety, and that points in the intersection of a curve with the union of all periodic hypersurfaces have bounded heights unless that curve is vertical or contained in a periodic hypersurface.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

ABC implies primitive prime divisors in arithmetic dynamic

Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many positive integers n, there is a prime p of K such that p | f^n(z) and p does not divide f^m(z) for all positive integers m < n. We prove the same result unconditionally for function fields of characteristic 0 when f is not isotrivial.

0 citations0 reviewsNo code linkedOpen access