Funder
Google
Directorate for Computer and Information Science and Engineering
HORIZON EUROPE European Research Council
Defense Sciences Office, DARPA
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference96 articles.
1. Applebaum B., Haramaty-Krasne N., Ishai Y., Kushilevitz E., Vaikuntananthan V.: Low-complexity cryptographic hash functions. In: ITCS, pp. 7:1–7:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017).
2. Ames S., Hazay C., Ishai Y., Venkitasubramaniam M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087–2104 (2017).
3. Arora S., Lund C., Motwani R., Sudan M., Szegedy M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998).
4. Applebaum B., Moses Y.: Locally computable UOWHF with linear shrinkage. J. Cryptol. 30(3), 672–698 (2017).
5. Arora S., Safra S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998).