(Leveled) Fully Homomorphic Encryption without Bootstrapping
2014· article· en· ACM Transactions on Computation Theory· Computer Science
afffund
1,374
citations
Every work in the frame. Each row carries the routes that admitted it, because a frame that forgets how it found something cannot be audited.
Direct labels are sparse and unvalidated. Missing labels are unknown.