Pradeep Kumar Mishra
Artificial Intelligence · with Duong · 2016
A researcher in the Science corpus: 1 paper; trusts 5 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 6 citations into it
Whom Pradeep Kumar Mishra trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Pradeep Kumar Mishra's perspective
Ordered by how strongly the researchers Pradeep Kumar Mishra trusts endorse each paper. Same corpus, a different order for every researcher.
- Fully homomorphic encryption using ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Can homomorphic encryption be practical?
- Evaluating 2-DNF Formulas on Ciphertexts
- Classical hardness of learning with errors (Symposium on the Theory of Computing)
- Protection
- Collision-Free Hashing from Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
Their papers
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption (2016) — 41 citations