3 problems

0 votes0 replies0 views
Conjecture on trace maximization for consecutive roots of unity
The analog MatDot scheme uses evaluation points on the unit circle, and for each colluding set $\mathcal{X}$ the matrices $\Gamma_a$ and $\Sigma_{a'}$ determine the quantity…
Conjectureopendistributed-computing information-theory secure-computationarXiv posted 2 days ago
0 votes0 replies0 views
Secret coding criterion for Gaussian source signals
Let $(V,E)$ ) be a network with Gaussian source signals, destination node $d$ , and wiretapped edges $\tilde{E}subseteq E$ . Define the secrecy closure of $\tilde{E}$ by … Here,…
Conjectureopeninformation-theory network-coding secure-computationarXiv posted 2 days ago
0 votes0 replies1 view
One-time programs from garbled circuits, leaky memories and leak-resistant encryption
One-time programs are software-protection primitives, and the proposed construction provides one-time memories with a restricted form of leakage. One-time-program construction conj…
Conjectureopenone-time-programs quantum-cryptography secure-computationarXiv posted 2 days ago

Conjecture on trace maximization for consecutive roots of unity