Generalized Learning Problems and Applications to Non-commutative Cryptography
From MaRDI portal
Publication:3092369
DOI10.1007/978-3-642-24316-5_23zbMath1298.94080OpenAlexW79002783MaRDI QIDQ3092369
William E. Skeith, Nelly Fazio, Vladimir Shpilrain, Gilbert Baumslag, Antonio R. Nicolosi
Publication date: 16 September 2011
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24316-5_23
Computational learning theory (68Q32) Cryptography (94A60) Special aspects of infinite or finite groups (20F99)
Related Items (5)
Non-commutative ring learning with errors from cyclic algebras ⋮ Algorithmic problems in Engel groups and cryptographic applications ⋮ Generalized Learning Problems and Applications to Non-commutative Cryptography ⋮ Signature scheme using the root extraction problem on quaternions ⋮ Hardness of learning problems over Burnside groups of exponent 3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic solutions of equations in the braid group.
- Group-based cryptography
- Probabilistic encryption
- Non-Abelian key agreement protocols
- Combinatorial group theory.
- Identity-Based Cryptosystems and Signature Schemes
- New Algorithms for Learning in Presence of Errors
- Generalized Learning Problems and Applications to Non-commutative Cryptography
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- A Framework for Efficient and Composable Oblivious Transfer
- Elliptic Curve Cryptosystems
- THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
- Matrix Transformation Is Complete for the Average Case
- Foundations of Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- On Groups in Which Every Element has Finite Order
- Foundations of Cryptography
- The word and geodesic problems in free solvable groups
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient noise-tolerant learning from statistical queries
- Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Generalized Learning Problems and Applications to Non-commutative Cryptography