English
Related papers

Related papers: An Effective Orchestral Approach to Satisfiability…

200 papers

Makaro is a logic puzzle with an objective to fill numbers into a rectangular grid to satisfy certain conditions. In 2018, Bultel et al. developed a physical zero-knowledge proof (ZKP) protocol for Makaro using a deck of cards, which allows…

Cryptography and Security · Computer Science 2023-01-03 Suthee Ruangwises , Toshiya Itoh

In this work we consider the interplay between multiprover interactive proofs, quantum entanglement, and zero knowledge proofs - notions that are central pillars of complexity theory, quantum information and cryptography. In particular, we…

Quantum Physics · Physics 2019-05-28 Alex B. Grilo , William Slofstra , Henry Yuen

Satisfiability Modulo Theories (SMT) specifications often rely on quantifiers to remain concise and declarative. However, checking the satisfiability of such specifications directly can be inefficient. A common optimization is to ground the…

Logic in Computer Science · Computer Science 2026-02-24 Pierre Carbonnelle

Non-interactive zero-knowledge (NIZK) proofs of knowledge have proven to be highly relevant for securely realizing a wide array of applications that rely on both privacy and correctness. They enable a prover to convince any party of the…

Cryptography and Security · Computer Science 2024-07-30 Mohammed Alghazwi , Tariq Bontekoe , Leon Visscher , Fatih Turkmen

Digital transactions currently exceed trillions of dollars annually, yet traditional paper-based agreements remain a bottleneck for automation, enforceability, and dispute resolution. Natural language contracts introduce ambiguity, require…

Cryptography and Security · Computer Science 2025-10-24 To-Wen Liu , Matthew Green

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

Commutative Algebra · Mathematics 2024-08-07 Martin Kreuzer , Florian Walsh

This paper presents a verification framework based on a new class of predicate Constraint Satisfaction Problems called pCSP where constraints are represented as clauses modulo first-order theories over function variables and predicate…

Programming Languages · Computer Science 2020-07-08 Hiroshi Unno , Yuki Satake , Tachio Terauchi , Eric Koskinen

The recent surge in artificial intelligence (AI), characterized by the prominence of large language models (LLMs), has ushered in fundamental transformations across the globe. However, alongside these advancements, concerns surrounding the…

Machine Learning · Computer Science 2024-04-26 Haochen Sun , Jason Li , Hongyang Zhang

Debugging and auditing zero-knowledge-compatible smart contracts remains a significant challenge due to the lack of source mapping in compilers such as zkSolc. In this work, we present a preliminary source mapping framework that establishes…

Software Engineering · Computer Science 2025-05-05 Pei Xu , Yulei Sui , Mark Staples

Blockchain offers traceability and transparency to supply chain event data and hence can help overcome many challenges in supply chain management such as: data integrity, provenance and traceability. However, data privacy concerns such as…

Cryptography and Security · Computer Science 2021-04-30 Sidra Malik , Volkan Dedeoglu , Salil Kanhere , Raja Jurdak

Zero-knowledge (ZK) proof systems have emerged as a promising solution for building security-sensitive applications. However, bugs in ZK applications are extremely difficult to detect and can allow a malicious party to silently exploit the…

Cryptography and Security · Computer Science 2023-04-19 Junrui Liu , Ian Kretz , Hanzhi Liu , Bryan Tan , Jonathan Wang , Yi Sun , Luke Pearson , Anders Miltner , Işıl Dillig , Yu Feng

Gradient boosted decision trees, particularly XGBoost, are among the most effective methods for tabular data. As deployment in sensitive settings increases, cryptographic guarantees of model integrity become essential. We present ZKBoost,…

Cryptography and Security · Computer Science 2026-05-14 Nikolas Melissaris , Antigoni Polychroniadou , Akira Takahashi , Chenkai Weng , Jiayi Xu

When users query proprietary LLM APIs, they receive outputs with no cryptographic assurance that the claimed model was actually used. Service providers could substitute cheaper models, apply aggressive quantization, or return cached…

Machine Learning · Computer Science 2026-03-20 Zhaohui Geoffrey Wang

With the rapid development of Zero-Knowledge Proofs (ZKPs), particularly Succinct Non-Interactive Arguments of Knowledge (SNARKs), benchmarking various ZK tools has become a valuable task. ZK-friendly hash functions, as key algorithms in…

Cryptography and Security · Computer Science 2024-09-04 Hanze Guo , Yebo Feng , Cong Wu , Zengpeng Li , Jiahua Xu

The integration of machine learning (ML) systems into critical industries such as healthcare, finance, and cybersecurity has transformed decision-making processes, but it also brings new challenges around trust, security, and…

Cryptography and Security · Computer Science 2025-10-27 Jonathan Gold , Tristan Freiberg , Haruna Isah , Shirin Shahabi

Healthcare AI needs large, diverse datasets, yet strict privacy and governance constraints prevent raw data sharing across institutions. Federated learning (FL) mitigates this by training where data reside and exchanging only model updates,…

Cryptography and Security · Computer Science 2025-12-25 Savvy Sharma , George Petrovic , Sarthak Kaushik

MPC-in-the-Head (MitH) is a general framework that allows constructing efficient Zero Knowledge protocols for general NP-relations from secure multiparty computation (MPC) protocols. In this paper we give the first machine-checked…

Cryptography and Security · Computer Science 2021-05-21 José Carlos Bacelar Almeida , Manuel Barbosa , Karim Eldefrawy , Stéphane Graham-Lengrand , Hugo Pacheco , Vitor Pereira

Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains. Effectively solving DAO and Gyges attacks, this paper describes an…

Cryptography and Security · Computer Science 2020-02-17 David Cerezo Sánchez

We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable (quantum) oblivious transfer (OT) protocol, mostly lifting the round-complexity properties and security guarantees…

Quantum Physics · Physics 2025-12-11 Léo Colisson , Garazi Muguruza , Florian Speelman

Streaming interactive proofs (SIPs) enable a space-bounded algorithm with one-pass access to a massive stream of data to verify a computation that requires large space, by communicating with a powerful but untrusted prover. This work…

Computational Complexity · Computer Science 2024-05-28 Graham Cormode , Marcel Dall'Agnol , Tom Gur , Chris Hickey
‹ Prev 1 4 5 6 7 8 10 Next ›