Practical secure delegated linear algebra with trapdoored matrices
From MaRDI portal
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Correlated pseudorandom functions from variable-density LPN
- Efficient Encryption From Random Quasi-Cyclic Codes
- Efficient noise-tolerant learning from statistical queries
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fully homomorphic encryption using ideal lattices
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 3635490 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- Maliciously secure matrix multiplication with applications to private deep learning
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- Probabilistic encryption
- Pseudorandom correlation functions from variable-density LPN, revisited
- Relations Among Complexity Measures
- Secure arithmetic computation with constant computational overhead
- Secure Arithmetic Computation with No Honest Majority
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- The hardness of LPN over any integer ring and field for PCG applications
This page was built for publication: Practical secure delegated linear algebra with trapdoored matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233171)
