Výsledky vyhledávání - computational complexity and cryptography

Complexity Lower Bounds from Algorithm Design Autor Williams, R. Ryan

“…?In this short article, I will briefly introduce some of the ideas behind a research program in computational complexity that I and others have studied, for the last decade…”
Získat plný text

Finite Model Theory of the Triguarded Fragment and Related Logics Autor Kieronski, Emanuel, Rudolph, Sebastian

“…The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments…”
Získat plný text

Towards a more efficient approach for the satisfiability of two-variable logic Autor Lin, Ting-Wei, Lu, Chia-Hsuan, Tan, Tony

“…We revisit the satisfiability problem for two-variable logic, denoted by SAT(FO 2 ), which is known to be NEXP-complete. The upper bound is usually derived…”
Získat plný text

Primer: Fast Private Transformer Inference on Encrypted Data Autor Zheng, Mengxin, Lou, Qian, Jiang, Lei

“…), are popular methods to support private Transformer inference. However, existing works still suffer from prohibitively computational and communicational overhead…”
Získat plný text

Optimizing windowed arithmetic for quantum attacks against RSA-2048 Autor Luongo, Alessandro, Narasimhachar, Varun, Sireesh, Adithya

“… in the current state-of-the-art compilations of quantum attacks against modern cryptography. We introduce several optimizations to windowed arithmetic…”
Získat plný text

ZK-Hammer: Leaking Secrets from Zero-Knowledge Proofs via Rowhammer Autor Liang, Junkai, Zhang, Xin, Hu, Daqi, Shen, Qingni, Fang, Yuejian, Wu, Zhonghai

“…Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARK) schemes have been a promising technique in verified computation. Zk-SNARK schemes…”
Získat plný text

CoqPilot, a plugin for LLM-based generation of proofs Autor Kozyrev, Andrei, Solovev, Gleb, Khramov, Nikita, Podkopaev, Anton

“…We present CoqPilot, a VS Code extension designed to help automate writing of Coq proofs. The plugin collects the parts of proofs marked with the admit tactic…”
Získat plný text

Invited: Accelerating Fully Homomorphic Encryption with Processing in Memory Autor Gupta, Saransh, Rosing, Tajana Simunic

“…Fully homomorphic encryption (FHE) provides a promising solution for future computing needs by allowing privacy-preserving computation. However, its practical…”
Získat plný text

Accelerating All-SAT Computation with Short Blocking Clauses Autor Zhang, Yueling, Pu, Geguang, Sun, Jun

“…The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model…”
Získat plný text

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP Autor Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“…This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP…”
Získat plný text

Categorical models of Linear Logic with fixed points of formulas Autor Ehrhard, Thomas, Jafarrahmani, Farzad

“…We develop a categorical semantics of µLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional…”
Získat plný text

Combinatorial Proofs and Decomposition Theorems for First-order Logic Autor Hughes, Dominic J. D., Strasburger, Lutz, Wu, Jui-Hsuan

“…We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in…”
Získat plný text

On the logical structure of choice and bar induction principles Autor Brede, Nuria, Herbelin, Hugo

“…We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an "intensional" or…”
Získat plný text

First-Order Reasoning and Efficient Semi-Algebraic Proofs Autor Part, Fedor, Thapen, Neil, Tzameret, Iddo

“…Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3]:…”
Získat plný text

Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames Autor Verbrugge, Rineke

“…It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of…”
Získat plný text

Higher Lenses Autor Capriotti, Paolo, Danielsson, Nils Anders, Vezzosi, Andrea

“…We show that total, very well-behaved lenses are not very well-behaved when treated proof-relevantly in the setting of homotopy type theory/univalent…”
Získat plný text

zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing Autor Zhang, Yancheng, Zheng, Mengxin, Chen, Xun, Hu, Jingtong, Shi, Weidong, Ju, Lei, Solihin, Yan, Lou, Qian

“…In the context of cloud computing, services are held on cloud servers, where the clients send their data to the server and obtain the results returned by…”
Získat plný text

Optimized Polynomial Multiplier Architectures for Post-Quantum KEM Saber Autor Basso, Andrea, Roy, Sujoy Sinha

“…Saber is one of the four finalists in the ongoing NIST post-quantum cryptography standardization project…”
Získat plný text

ALLMod: Exploring Area-Efficiency of LUT-based Large Number Modular Reduction via Hybrid Workloads Autor Liu, Fangxin, Li, Haomin, Wang, Zongwu, Zhang, Bo, Zhang, Mingzhe, Yan, Shoumeng, Jiang, Li, Guan, Haibing

“… The lookup-table-based (LUT-based) approach, a "space-for-time" technique, reduces computational load by segmenting the input number into smaller bit groups, pre-computing modular reduction results for each segment, and storing these results in LUTs…”
Získat plný text

Strong Call-by-Value is Reasonable, Implosively Autor Accattoli, Beniamino, Condoluci, Andrea, Coen, Claudio Sacerdoti

“…Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model (that is, polynomially related to the one of Turing machines) is…”
Získat plný text