Tree codes and a conjecture on exponential sums
From MaRDI portal
Publication:2988874
DOI10.1145/2554797.2554813zbMath1364.94681arXiv1308.6007OpenAlexW2109131159MaRDI QIDQ2988874
Leonard J. Schulman, Moore, Cristopher
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6007
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23) Combinatorial codes (94B25)
Related Items (5)
Interactive communication with unknown noise rate ⋮ Linear tree codes and the problem of explicit constructions ⋮ List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise ⋮ Palette-alternating tree codes ⋮ Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Tree codes and a conjecture on exponential sums