16 research outputs found
A Note on the Common Haar State Model
Common random string model is a popular model in classical cryptography with many constructions proposed in this model. We study a quantum analogue of this model called the common Haar state model, which was also studied in an independent work by Chen, Coladangelo and Sattath (arXiv 2024). In this model, every party in the cryptographic system receives many copies of one or more i.i.d Haar states.
Our main result is the construction of a statistically secure PRSG with: (a) the output length of the PRSG is strictly larger than the key size, (b) the security holds even if the adversary receives copies of the pseudorandom state. We show the optimality of our construction by showing a matching lower bound. Our construction is simple and its analysis uses elementary techniques
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
We study the complexity of isomorphism problems for tensors, groups, and polynomials. These problems have been studied in multivariate cryptography, machine learning, quantum information, and computational group theory. We show that these problems are all polynomial-time equivalent, creating bridges between problems traditionally studied in myriad research areas. This prompts us to define the complexity class TI, namely problems that reduce to the Tensor Isomorphism (TI) problem in polynomial time. Our main technical result is a polynomial-time reduction from d-tensor isomorphism to 3-tensor isomorphism. In the context of quantum information, this result gives multipartite-to-tripartite entanglement transformation procedure, that preserves equivalence under stochastic local operations and classical communication (SLOCC)
On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor isomorphism-completeness
We study the complexity of isomorphism problems for tensors, groups, and polynomials. These problems have been studied in multivariate cryptography, machine learning, quantum information, and computational group theory. We show that these problems are all polynomial-time equivalent, creating bridges between problems traditionally studied in myriad research areas. This prompts us to define the complexity class TI, namely problems that reduce to the Tensor Isomorphism (TI) problem in polynomial time. Our main technical result is a polynomial-time reduction from d-tensor isomorphism to 3-tensor isomorphism. In the context of quantum information, this result gives multipartite-to-tripartite entanglement transformation procedure, that preserves equivalence under stochastic local operations and classical communication (SLOCC)
Quantum Complexity for Discrete Logarithms and Related Problems
This paper studies the quantum computational complexity of the discrete
logarithm (DL) and related group-theoretic problems in the context of generic
algorithms -- that is, algorithms that do not exploit any properties of the
group encoding.
We establish a generic model of quantum computation for group-theoretic
problems, which we call the quantum generic group model. Shor's algorithm for
the DL problem and related algorithms can be described in this model. We show
the quantum complexity lower bounds and almost matching algorithms of the DL
and related problems in this model. More precisely, we prove the following
results for a cyclic group of prime order.
- Any generic quantum DL algorithm must make depth of
group operations. This shows that Shor's algorithm is asymptotically optimal
among the generic quantum algorithms, even considering parallel algorithms.
- We observe that variations of Shor's algorithm can take advantage of
classical computations to reduce the number of quantum group operations. We
introduce a model for generic hybrid quantum-classical algorithms and show that
these algorithms are almost optimal in this model. Any generic hybrid algorithm
for the DL problem with a total number of group operations must make
quantum group operations of depth .
- When the quantum memory can only store group elements and use quantum
random access memory of group elements, any generic hybrid algorithm must
make either group operations in total or quantum group operations.
As a side contribution, we show a multiple DL problem admits a better
algorithm than solving each instance one by one, refuting a strong form of the
quantum annoying property suggested in the context of password-authenticated
key exchange protocol
FiveEyes: Cryptographic Biometric Authentication from the Iris
Despite decades of effort, a stubborn chasm exists between the theory and practice of device-level biometric authentication. Deployed authentication algorithms rely on data that overtly leaks private information about the biometric; thus systems rely on externalized security measures such as trusted execution environments. The authentication algorithms have no cryptographic guarantees.
This is particularly frustrating given the long line of research that has developed theoretical tools—known as fuzzy extractors—that enable secure, privacy preserving biometric authentication with public enrollment data (Dodis et al., SIAM Journal of Computing 2008). Unfortunately, the best known constructions either:
1. Assume that bits of biometrics are i.i.d. (or that all correlation is captured in pairs of features (Hine et al., TIFS 2023)), which is not true for the biometrics themselves or for features extracted using modern learning techniques, or
2. Only provide substantial true accept rates with an estimated security of bits for the iris (Simhadri et al., ISC 2019) and bits for the face (Zhang, Cui, and Yu, ePrint 2021/1559).
This work introduces FiveEyes, an iris key derivation system powered by technical advances in both 1) feature extraction from the iris and 2) the fuzzy extractor used to secure authentication keys. FiveEyes’ feature extractor’s loss focuses on quality for key derivation. The fuzzy extractor builds on sample-then-lock (Canetti et al., Journal of Cryptology 2021). FiveEyes’ fuzzy extractor uses statistics of the produced features to sample non-uniformly, which significantly improves the security vs. true accept rate (TAR) tradeoff. Irises used to evaluate TAR and security are class disjoint from those used for training and collecting statistics.
We state assumptions sufficient for security. We present various parameter regimes to highlight different TARs:
1. bits of security (equivalent to bits with a password) at % TAR, and
2. bits of security (equivalent to bits with a password) at % TAR.
Applying known TAR (Davida et al., IEEE S&P 1998) amplification techniques additively boosts TAR by % for the above settings
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions
Sponge paradigm, used in the design of SHA-3, is an alternative hashing technique to the popular Merkle-Damgård paradigm. We revisit the problem of finding -block-long collisions in sponge hash functions in the auxiliary-input random permutation model, in which an attacker gets a piece of -bit advice about the random permutation and makes (forward or inverse) oracle queries to the random permutation.
Recently, significant progress has been made in the Merkle-Damgård setting and optimal bounds are known for a large range of parameters, including all constant values of . However, the sponge setting is widely open: there exist significant gaps between known attacks and security bounds even for .
Freitag, Ghoshal and Komargodski (CRYPTO 2022) showed a novel attack for that takes advantage of the inverse queries and achieves advantage , , where is bit-rate and is the capacity of the random permutation. However, they only showed an security bound, leaving open an intriguing quadratic gap. For , they beat the general security bound
by Coretti, Dodis,
Guo (CRYPTO 2018) for arbitrary values of . However, their highly non-trivial argument is quite laborious, and no better (than the general) bounds are known for .
In this work, we study the possibility of proving better security bounds in the sponge setting. To this end,
- For , we prove an improved bound. Our bound strictly improves the bound by Freitag et al.,
and is optimal for .
- For , we give a considerably simpler and more modular proof, recovering the bound obtained by Freitag et al.
- We obtain our bounds by adapting the recent multi-instance technique of Akshima, Guo and Liu (CRYPTO 2022) which bypasses the limitations of prior techniques in the Merkle-Damgård setting. To complement our results, we provably show that the recent multi-instance technique cannot further improve our bounds for , and the general bound by Correti et al., for .
Overall, our results yield state-of-the-art security bounds for finding short collisions and fully characterize the power of the multi-instance technique in the sponge setting
On the Algebraic Proof Complexity of Tensor Isomorphism
The Tensor Isomorphism problem (TI) has recently emerged as having connections to multiple areas of research within complexity and beyond, but the current best upper bound is essentially the brute force algorithm. Being an algebraic problem, TI (or rather, proving that two tensors are non-isomorphic) lends itself very naturally to algebraic and semi-algebraic proof systems, such as the Polynomial Calculus (PC) and Sum of Squares (SoS). For its combinatorial cousin Graph Isomorphism, essentially optimal lower bounds are known for approaches based on PC and SoS (Berkholz & Grohe, SODA \u2717). Our main results are an ?(n) lower bound on PC degree or SoS degree for Tensor Isomorphism, and a nontrivial upper bound for testing isomorphism of tensors of bounded rank.
We also show that PC cannot perform basic linear algebra in sub-linear degree, such as comparing the rank of two matrices (which is essentially the same as 2-TI), or deriving BA = I from AB = I. As linear algebra is a key tool for understanding tensors, we introduce a strictly stronger proof system, PC+Inv, which allows as derivation rules all substitution instances of the implication AB = I ? BA = I. We conjecture that even PC+Inv cannot solve TI in polynomial time either, but leave open getting lower bounds on PC+Inv for any system of equations, let alone those for TI. We also highlight many other open questions about proof complexity approaches to TI
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications
Many isomorphism problems for tensors, groups, algebras, and polynomials were
recently shown to be equivalent to one another under polynomial-time
reductions, prompting the introduction of the complexity class TI (Grochow &
Qiao, ITCS '21; SIAM J. Comp., '23). Using the tensorial viewpoint, Grochow &
Qiao (CCC '21) then gave moderately exponential-time search- and
counting-to-decision reductions for a class of -groups. A significant issue
was that the reductions usually incurred a quadratic increase in the length of
the tensors involved. When the tensors represent -groups, this corresponds
to an increase in the order of the group of the form ,
negating any asymptotic gains in the Cayley table model.
In this paper, we present a new kind of tensor gadget that allows us to
replace those quadratic-length reductions with linear-length ones, yielding the
following consequences:
1. Combined with the recent breakthrough -time
isomorphism-test for -groups of class 2 and exponent (Sun, STOC '23),
our reductions extend this runtime to -groups of class and exponent
where .
2. Our reductions show that Sun's algorithm solves several TI-complete
problems over , such as isomorphism problems for cubic forms, algebras,
and tensors, in time .
3. Polynomial-time search- and counting-to-decision reduction for testing
isomorphism of -groups of class and exponent in the Cayley table
model. This answers questions of Arvind and T\'oran (Bull. EATCS, 2005) for
this group class, thought to be one of the hardest cases of Group Isomorphism.
4. If Graph Isomorphism is in P, then testing equivalence of cubic forms and
testing isomorphism of algebra over a finite field can both be solved in
time , improving from the brute-force upper bound