query: Machine Learning with Encryption
positive_passages.docid: 67716
positive_passages.text: Any practical uses of machine learning for cryptography?
negative_passages.docid: 155569
negative_passages.text: Choosing finite field size in Shamir's Secret Sharing Scheme
negative_passages.docid: 12714
negative_passages.text: Filesystem that gives an encrypted view of a directory—the inverse of EncFS
negative_passages.docid: 139843
negative_passages.text: Incremental (delta) backup of a encrypted data
negative_passages.docid: 123941
negative_passages.text: Maximum theoretical data density
negative_passages.docid: 45881
negative_passages.text: Methods to work around the problem of missing data in machine learning
negative_passages.docid: 62196
negative_passages.text: Statistical saturation attack on block ciphers
negative_passages.docid: 8674
negative_passages.text: Hash-based asymmetrical encryption (not digital signature) schemes?
negative_passages.docid: 84814
negative_passages.text: Two-way encryption: I need to store passwords that can be retrieved
negative_passages.docid: 100640
negative_passages.text: K out of N encryption
negative_passages.docid: 135486
negative_passages.text: Can Fully Homomorphic Encryption do comparisons?
negative_passages.docid: 143066
negative_passages.text: How to secure Elliptic Curve ElGamal encryption against known plaintext attacks?
negative_passages.docid: 146299
negative_passages.text: Can reduced-round ChaCha be used as non-cryptographic fast PRNG to produce output indistinguishable from random data?
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function
negative_passages.docid: 5038
negative_passages.text: Email encryption for noobs
negative_passages.docid: 123751
negative_passages.text: Restrictions on the use of universal generalization
negative_passages.docid: 114628
negative_passages.text: Can a homomorphic encryption scheme be made CCA2 Secure?