branching programs
Pseudorandomness for Width-2 Branching Programs
... for branching programs deals with read-once programs, due to their connection to space-bounded ...general branching programs that are not necessarily ...General programs are ...
11
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
... We describe a basic construction of lockable obfuscation, where “basic” means we work with a fixed message µ = 1, and VBB security holds when y is sampled uniformly random. The point however is that we can handle a ...
67
Near Optimal Rate Homomorphic Encryption for Branching Programs
... The new (slightly stronger) definition only requires the creation of a single key pair (sk, pk) usable for any m. Instead, it is Alice who picks the value m while encrypting the messages. The concrete value m gives an ...
30
On the read once property of branching programs and CNFs of bounded treewidth
... In this paper we prove a space lower bound of nΩk for non-deterministic syntactic read-once branching programs NROBPs on functions expressible as CNFs with treewidth at most k of their p[r] ...
19
A Non-linear Time Lower Bound for Boolean Branching Programs
... R-way branching programs was introduced by Borodin and Cook [8], who proved a time-space trade-off for sorting n ...R-way branching programs in the special case where the number of output bits ...
28
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
... k-times branching programs and hence exponential lower bounds ...read-once branching programs but require exponential size if ‘semantic’ is replaced by ...
18
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
... Abstract: We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. The best ...
21
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs
... oblivious branching programs (where the bits are fed to the branching program in an arbitrary, fixed order); however, none match both the seed length and generality of Nisan’s ...unordered ...
50
Obfuscating Low-Rank Matrix Branching Programs
... In this work, we seek to extend the capabilities of the “core obfuscator” from the work of Garg, Gentry, Halevi, Raykova, Sahai, and Waters (FOCS 2013), and all subsequent works constructing general-purpose obfuscators. ...
31
Riding on Asymmetry: Efficient ABE for Branching Programs
... for arithmetic predicates with short secret keys: |P | + poly(λ, d), also assuming hardness of LWE with sub- exponential approximation factors. However, in [GVW13], the authors also showed an additional construction for ...
19
Proofs of proximity for context free languages and read once branching programs
... Furthermore, if the testers for the partial derivation languages have a one-sided error, then the MAP verifier accepts with probability 1 and otherwise we can apply a generic transformat[r] ...
43
No small nondeterministic read once branching programs for CNFs of bounded treewidth
... We define a Non-deterministic Read Once Branching Program ( NROBP ) as a con- nected acyclic read-once switching-and-rectifier network [4]. That is, a NROBP Y im- plementing (realizing) a function F is a directed ...
13
Algorithmic self-assembly of DNA
... fg 2.2.3 Correspondence of Models Restricted Model Branching Programs In this section we show that the class of functions which the restricted model can invert in a given time are exactl[r] ...
109
Post-Zeroizing Obfuscation: The case of Evasive Circuits
... We also show that the “bootstrapping” theorem of [GGH + 13b] extends to the setting of evasive functions. This theorem transforms a core obfuscator for a “small” class of functions (e.g. poly-size branching ...
45
A Deterministic PTAS for the Commutative Rank of Matrix Spaces
... Abstract: We consider the problem of computing the commutative rank of a given matrix space B ⊆ F n×n , that is, given a basis of B, find a matrix of maximum rank in B. This problem is fundamental, as it generalizes ...
21
On Kilian's Randomization of Multilinear Map Encodings
... matrix branching program can only produce zeroes at the last level, moreover when evaluated in a very specific ...GGHRSW branching-program obfuscator when instantiated using CLT13, when the branching ...
30
Combining Private Set-Intersection with Secure Two-Party Computation
... a branching program. Secure evaluation of branching programs has previously been considered in [IP07, MN12]: unfortunately these protocols cannot be instantiated using OT-extension and therefore will ...
30
Implementing Token-Based Obfuscation under (Ring) LWE
... general branching programs are provided by Halevi et ...read-once branching programs ...complex branching programs about two orders of magnitude faster, and is not vulnerable to ...
39
Non-Interactive Secure Multiparty Computation
... Vadhan, and Ke Yang On the (im)possibility of obfuscating programs. Bounded-width polynomial-size branching programs recognize exactly those lan- guages in NC 1. Foundations of garbled c[r] ...
43
Quantum Attacks against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model
... equivalent branching programs such that the illegal encoding obtained above is an encoding of zero for one of the two branching programs ...of branching programs in Section ...
40