Succinctly Verifiable Computation over Additively-Homomorphically Encrypted Data: Making Privacy-Preserving Blueprints Practical

Scott Griffy, Markulf Kohlweiss, Anna Lysyanskaya, Meghna Sengupta. Succinctly Verifiable Computation over Additively-Homomorphically Encrypted Data: Making Privacy-Preserving Blueprints Practical. In Shi Bai 0001, Edoardo Persichetti, editors, Public-Key Cryptography - PKC 2026 - 29th IACR International Conference on Practice and Theory of Public-Key Cryptography, West Palm Beach, FL, USA, May 25-28, 2026, Proceedings, Part IV. Volume 16554 of Lecture Notes in Computer Science, pages 235-269, Springer, 2026. [doi]

Abstract

Abstract is missing.