There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups

02/21/2023
βˆ™
by   Mikhail Anokhin, et al.
βˆ™
0
βˆ™

Let Ξ© be a finite set of finitary operation symbols and let 𝔙 be a nontrivial variety of Ξ©-algebras. Assume that for some set Ξ“βŠ†Ξ© of group operation symbols, all Ξ©-algebras in 𝔙 are groups under the operations associated with the symbols in Ξ“. In other words, 𝔙 is assumed to be a nontrivial variety of expanded groups. In particular, 𝔙 can be a nontrivial variety of groups or rings. Our main result is that there are no post-quantum weakly pseudo-free families in 𝔙, even in the worst-case setting and/or the black-box model. In this paper, we restrict ourselves to families (H_d|d∈ D) of computational and black-box Ξ©-algebras (where DβŠ†{0,1}^*) such that for every d∈ D, each element of H_d is represented by a unique bit string of length polynomial in the length of d. We use straight-line programs to represent nontrivial relations between elements of Ξ©-algebras in our main result. Note that under certain conditions, this result depends on the classification of finite simple groups. Also, we define and study some types of weak pseudo-freeness for families of computational and black-box Ξ©-algebras.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 03/20/2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds

We investigate the existence of constant-round post-quantum black-box ze...
research
βˆ™ 11/05/2019

Discrete logarithm and Diffie-Hellman problems in identity black-box groups

We investigate the computational complexity of the discrete logarithm, t...
research
βˆ™ 04/05/2022

Fiat-Shamir for Proofs Lacks a Proof Even in the Presence of Shared Entanglement

We explore the cryptographic power of arbitrary shared physical resource...
research
βˆ™ 10/31/2020

Shadowing for families of endomorphisms of generalized group shifts

Let G be a countable monoid and let A be an Artinian group (resp. an Art...
research
βˆ™ 04/18/2020

Almost intersecting families

Let n > k > 1 be integers, [n] = {1, …, n}. Let β„± be a family of k-subse...
research
βˆ™ 05/23/2020

Post-Quantum Multi-Party Computation in Constant Rounds

We obtain the first constant-round post-quantum multi-party computation ...
research
βˆ™ 03/02/2023

Quantum Channel Certification with Incoherent Strategies

In the problem of quantum channel certification, we have black box acces...

Please sign up or login with your details

Forgot password? Click here to reset