-
1
-
2
-
3
-
4
The Design of a Relational Engine
Published 2006“…These desiderata are addressed with three new techniques: a symmetry detection algorithm that works in the presence of partial solutions, a sparse-matrix representation of relations, and a compact representation of boolean formulas inspired by boolean expression diagrams and reduced boolean circuits. The presented techniques have been implemented and evaluated, with promising results.…”
Get full text
-
5
-
6
-
7
Towards an interpreter for efficient encrypted computation
Published 2014“…Fully homomorphic encryption (FHE) techniques are capable of performing encrypted computation on Boolean circuits, i.e., the user specifies encrypted inputs to the program, and the server computes on the encrypted inputs. …”
Get full text
Get full text
Get full text
Get full text
Article -
8
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
Published 2020“…Beyond that, we compare the efficiency of our scheme against a Q-FHE-OI scheme obtained by emulating mod-Q gates with boolean circuits as proposed by Kim and Tibouchi (CANS 2016). …”
Get full text
Journal Article -
9
-
10
Tree-like queries in OWL 2 QL: succinctness and complexity results
Published 2015“…For FO-rewritings, we equate the existence of polysize rewritings with well-known problems in Boolean circuit complexity. As our second contribution, we analyze the computational complexity of query answering and establish tractability results (either NLor LOGCFL-completeness) for a range of query-ontology pairs. …”
Get full text
Article -
11
Separating quantum communication and approximate rank
Published 2018“…We show the upper bound on the approximate rank of F_G by relating it to the Boolean circuit size of the starting function F.…”
Get full text
Get full text
Journal Article -
12
On Best-Possible Obfuscation
Published 2021“…An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-output functionality as the original program, but is “unintelligible”. …”
Get full text
Article -
13
On Best-Possible Obfuscation
Published 2014“…An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-output functionality as the original program, but is “unintelligible”. …”
Get full text
Get full text
Article -
14
New and improved zero-knowledge argument systems for code-based cryptography
Published 2022“…To construct such a signature scheme, we devise a new technique for handling NAND gates in a Boolean circuit with a relatively small cost of witness representations.…”
Get full text
Thesis-Doctor of Philosophy -
15
Perfect monomial prediction for modular addition
Published 2024“…Current division property models for modular addition either (a) express the operation as a Boolean circuit and apply standard propagation rules for basic operations (COPY, XOR, AND), or (b) treat it as a sequence of smaller functions with carry bits, modeling each function individually. …”
Get full text
Journal Article -
16
Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes
Published 2021“…For A : (0, 1) → (0, 1), let search-MCSPA[s(n)] be the problem: Given a truth table T of size N = 2n, output a Boolean circuit for T of size at most s(n) with AND, OR, NOT, and A-oracle gates (or report that no such circuit exists). …”
Get full text
Article -
17
Privacy-preserving protocols from lattice cryptography
Published 2019“…Our algorithm is comparable in per- formance to Boolean circuit-based methods (Cheon, Kim, and Kim ’15, ’16) and improves the ciphertext expansion factor by at an order of magnitude. …”
Get full text
Get full text
Thesis