2026-07-21T21:08:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23735 2025-11-12T12:59:55Z ddc:004 open_access

Privacy-Preserving SAT Solving (Invited Talk) Piskac, Ruzica SAT solving Privacy-preserving reasoning Zero-knowledge proofs Propositional unsatisfiability This is an extended abstract of the invited talk presented at the joint conferences "28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)" and "31st International Conference on Principles and Practice of Constraint Programming (CP 2025)". The talk is based on a series of three papers published previously, and it provides a unified overview of their key ideas and results. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ruzica Piskac 2025 Is Part Of LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAT.2025.1 urn:nbn:de:0030-drops-237356 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.1 eng https://creativecommons.org/licenses/by/4.0/legalcode