IEEE Symposium on Security and Privacy·17 min
Industry experts analyze emerging threats surrounding Multi-Server Verifiable Computation of Low-Degree Polynomials.
4 talks tagged with this topic.
Loading filters…
1–4 of 4 talks · loading…
IEEE Symposium on Security and Privacy·17 min
Industry experts analyze emerging threats surrounding Multi-Server Verifiable Computation of Low-Degree Polynomials.
IEEE Symposium on Security and Privacy·11 min
Security researchers examine technical aspects of Pegasus: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption.
IEEE Symposium on Security and Privacy·17 min
Engineers explore architecture and security mechanisms for Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof.
IEEE Symposium on Security and Privacy·16 min
Industry experts analyze emerging threats surrounding 415 SoK Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields Jan G.