Suchergebnisse - "Computational complexity and cryptography"

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

“… Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how …”
Volltext

Finite Model Theory of the Triguarded Fragment and Related Logics von 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 …”
Volltext

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

“… It is increasingly important to enable privacy-preserving inference for cloud services based on Transformers. Post-quantum cryptographic techniques, e.g., …”
Volltext

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

“… Windowed arithmetic is a technique for reducing the cost of quantum arithmetic circuits with space-time trade-offs using memory queries to precomputed tables …”
Volltext

Towards a more efficient approach for the satisfiability of two-variable logic von 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 …”
Volltext

CoqPilot, a plugin for LLM-based generation of proofs von 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 …”
Volltext

ZK-Hammer: Leaking Secrets from Zero-Knowledge Proofs via Rowhammer von 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 …”
Volltext

The SIMON and SPECK lightweight block ciphers von Beaulieu, Ray, Treatman-Clark, Stefan, Shors, Douglas, Weeks, Bryan, Smith, Jason, Wingers, Louis

“… The Simon and Speck families of block ciphers were designed specifically to offer security on constrained devices, where simplicity of design is crucial …”
Volltext

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP von 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). We unify, …”
Volltext

Accelerating All-SAT Computation with Short Blocking Clauses von 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 …”
Volltext

Electronic Voting: 10th International Joint Conference, E-Vote-ID 2025, Nancy, France, October 1–3, 2025, Proceedings

“… This open access book constitutes the proceedings of the 10th International Joint Conference on Electronic Voting, E-Vote-ID 2024, held in Nancy, France, …”
Volltext

Invited: Accelerating Fully Homomorphic Encryption with Processing in Memory von 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 …”
Volltext

Categorical models of Linear Logic with fixed points of formulas von 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 …”
Volltext

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

“… We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an "intensional" or …”
Volltext

Combinatorial Proofs and Decomposition Theorems for First-order Logic von 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 …”
Volltext

Strong Call-by-Value is Reasonable, Implosively von 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 …”
Volltext

Chaff: engineering an efficient SAT solver von Moskewicz, Matthew W., Madigan, Conor F., Zhao, Ying, Zhang, Lintao, Malik, Sharad

“… Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide …”
Volltext

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

“… Saber is one of the four finalists in the ongoing NIST post-quantum cryptography standardization project. A significant portion of Saber's computation time is …”
Volltext

First-Order Reasoning and Efficient Semi-Algebraic Proofs von 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]: …”
Volltext

Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames von 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 …”
Volltext