Foundations — Entidade

eprint.iacr.org·há 3 dias

Parallel Repetition for Entangled Games with Gap Exponent Three

We prove that every finite two-player game $G$ with entangled value $\omega^*(G)=1-\epsilon$ satisfies \[ \omega^*(G^{\otimes n}) \le\exp(-\Omega(\frac{\epsilon^3}{\epsilon+ \ell }n)) \] for eve

eprint.iacr.org·há 5 dias

Equivalence Between Average-Case Hardness of Learning and Cryptography for Mixed Quantum States

The relationship between cryptography and learning theory has long been a central theme in the foundations of theoretical computer science: cryptographic primitives can imply hardness of learning, whi

eprint.iacr.org·há 5 dias

Hell’s Bells: A Neural Network Pipeline for Ternary Fast Matrix Multiplication Algorithms

We present a neural network-based pipeline for efficiently generating fast matrix multiplication (FMM) algorithms of small but arbitrary dimensions $(n,m,k)$. Our neural network is general and tunable

eprint.iacr.org·há 5 dias

A Unifying Umbrella for Circular-Secure Cryptographic Primitives

The main message of this paper is that several seemingly different circular-style primitives are existentially equivalent. In particular, somewhat surprisingly, we show that hinting PRGs (Koppula and

eprint.iacr.org·há 6 dias

New Results on the Density of Irreducible NFSRs

Nonlinear feedback shift registers (NFSRs) are fundamental building blocks for modern stream-cipher constructions. An $n$-stage NFSR $f$ is classified as irreducible when the output sequence set of $f

eprint.iacr.org·há 6 dias

Verified Pythagorean Composition for Adaptive Cryptographic Games: Noise Flooding in Homomorphic Encryption

Noise flooding is a standard defense against decryption attacks on approximate homomorphic encryption, but its security proof is unusually sensitive to composition. Replacing each of $q$ adaptive de

eprint.iacr.org·há 6 dias

Quantum Advantage for Two-Party Differential Privacy

We introduce information-theoretically private quantum protocols for two-party Hamming distance when both parties must output the same estimate. Classically, for input length $n$, information-theoreti

eprint.iacr.org·há 9 dias

Recursive Common Information for Group-Characterizable Random Variables

Common information (CI) is useful in entropy-based lower bounds for secret sharing. We study CI for group-characterizable (GC) random variables. Building on the sufficient condition of Kaboli--Khazaei