Multi-Server Verifiable Computation of Low-Degree Polynomials
Industry experts analyze emerging threats surrounding Multi-Server Verifiable Computation of Low-Degree Polynomials.
Summary
No summary yet — watch the video above, or open it on YouTube.
Related talks
IEEE Symposium on Security and Privacy·18 min
Industry experts analyze emerging threats surrounding Publicly Accountable Robust Multi-Party Computation.
publiclyaccountablerobust+3
IEEE Symposium on Security and Privacy·19 min
Presenters detail vulnerability discovery and exploitation in xJsnark: A Framework for Efficient Verifiable Computation.
frameworkxjsnarkefficient+2
IEEE Symposium on Security and Privacy·16 min
Presenters detail vulnerability discovery and exploitation in Geppetto: Versatile Verifiable Computation.
geppettoversatileverifiable+1