Hardness of learning problems over Burnside groups of exponent 3
DOI10.1007/s10623-013-9892-6zbMath1393.94914OpenAlexW1970144139MaRDI QIDQ2339133
Nelly Fazio, Ludovic Perret, William E. Skeith, Antonio R. Nicolosi, Kevin M. Iga
Publication date: 30 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9892-6
Burnside groupspost-quantum cryptographylearning with errorsrandom self-reducibilitynon-commutative cryptography
Computational learning theory (68Q32) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Random oracles separate PSPACE from the polynomial-time hierarchy
- On hiding information from an oracle
- New Algorithms for Learning in Presence of Errors
- Generalized Learning Problems and Applications to Non-commutative Cryptography
- On Ideal Lattices and Learning with Errors over Rings
- The Knowledge Complexity of Interactive Proof Systems
- Designing programs that check their work
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient noise-tolerant learning from statistical queries
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hardness of learning problems over Burnside groups of exponent 3