Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
From MaRDI portal
Recommendations
Cites work
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- A Framework for Efficient and Composable Oblivious Transfer
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Combinatorial group theory.
- Efficient noise-tolerant learning from statistical queries
- Elliptic Curve Cryptosystems
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Foundations of Cryptography
- Foundations of Cryptography
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Group-based cryptography
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3910294 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1424183 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-Based Encryption from the Weil Pairing
- Matrix Transformation Is Complete for the Average Case
- New Algorithms for Learning in Presence of Errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- Non-Abelian key agreement protocols
- On Groups in Which Every Element has Finite Order
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On public-key cryptosystems based on combinatorial group theory
- Probabilistic encryption
- Probabilistic solutions of equations in the braid group.
- Public-key cryptosystems from the worst-case shortest vector problem
- Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups
- THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
- The word and geodesic problems in free solvable groups.
- Toward basing fully homomorphic encryption on worst-case hardness
Cited in
(10)- Non-commutative ring learning with errors from cyclic algebras
- Signature scheme using the root extraction problem on quaternions
- Hardness of learning problems over Burnside groups of exponent 3
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- scientific article; zbMATH DE number 5982274 (Why is no real title available?)
- Algorithmic problems in Engel groups and cryptographic applications
- On homomorphic encryption using abelian groups: classical security analysis
- Some subgroups of the Burnside group B₀(2,5)
- On one representation of elements of finite 2-groups in the form of Boolean vectors
- Computation of the center of the Burnside group B₀(2,5)
This page was built for publication: Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092369)