J Thaler - Foundations and Trends® in Privacy and Security, 2022 - nowpublishers.com
Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted prover to provide a guarantee that it performed a requested computation correctly …
N Saxena - … : 35th International Colloquium, ICALP 2008, Reykjavik …, 2008 - Springer
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C (x 1,..., xn)(ie C is a sum of powers of linear functions) is zero. We …
The past decade has seen numerous major mathematical breakthroughs for topics such as the finite field Kakeya conjecture, the cap set conjecture, Erdős's distinct distances problem …
J Dyer, M Dyer, J Xu - International Journal of Information Security, 2019 - Springer
We present novel homomorphic encryption schemes for integer arithmetic, intended primarily for use in secure single-party computation in the cloud. These schemes are …
N Bshouty - Proceedings of the 5th conference on Innovations in …, 2014 - dl.acm.org
We develop a new notion called tester of a class M of functions f: A→ C that maps the elements α∈ A in the domain A of the function to a finite number (the size of the tester) of …
JA Grochow - arXiv preprint arXiv:2306.02184, 2023 - arxiv.org
The Ideal Proof System (IPS) of Grochow & Pitassi (FOCS 2014, J. ACM, 2018) is an algebraic proof system that uses algebraic circuits to refute the solvability of unsatisfiable …
This book seeks to generalize techniques and experiences in designing and analyzing cryptographic schemes for blockchain. It devotes three chapters to review the background …
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely …