Results 1  10
of
899
Efficient Fully Secure Predicate Encryption for Conjunctions, Disjunctions and kCNF/DNF formulae
, 2012
"... Predicate encryption is an important cryptographic primitive that has found wide applications as it allows for finegrained key management. In a predicate encryption scheme for a class P of predicates, the owner of the master secret key can derive a secret key SkP for any predicate P ∈ P. Similarly, ..."
Abstract
 Add to MetaCart
, when encrypting plaintext M, the sender can specify an attribute vector x for the ciphertext Ct. Then, key SkP can decrypt all ciphertexts Ct with attribute vector x such that P (x) = 1. In this paper, we give fully secure implementations Conjunctions, Disjunctions and kCNF/DNF predicates
Backpropagation for Neural DNF and CNFNetworks
"... The architecture of a neural network with its links and weights can be viewed as a knowledge representation. To overcome the blackbox problem of not knowing what knowledge is hidden in a neural architecture, we present a strictly logically operating network. Each neuron represents either a disjunc ..."
Abstract
 Add to MetaCart
disjunction or conjunction of its inputs and the net thus performs the function of a logic formula. This formula can be extracted from the net after completed training. The wellknown backpropagation algorithm is adapted to train such logical neural nets. An online pruning algorithm is also implemented
Evaluating 2dnf formulas on ciphertexts
 In proceedings of TCC ’05, LNCS series
, 2005
"... Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create th ..."
Abstract

Cited by 231 (7 self)
 Add to MetaCart
Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract

Cited by 427 (0 self)
 Add to MetaCart
kDL properly includes other wellknown techniques for representing Boolean functions such as kCNF (formulae in conjunctive normal form with at most k literals per clause), kDNF (formulae in disjunctive normal form with at most k literals per term), and decision trees of depth k, our result
On Learning Visual Concepts and DNF Formulae
, 1993
"... We consider the problem of learning DNF formulae in the mistakebound and the PAC models. We develop a new approach, which is called polynomial explainability, that is shown to be useful for learning some new subclasses of DNF (and CNF) formulae that were not known to be learnable before. Unlike pre ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
We consider the problem of learning DNF formulae in the mistakebound and the PAC models. We develop a new approach, which is called polynomial explainability, that is shown to be useful for learning some new subclasses of DNF (and CNF) formulae that were not known to be learnable before. Unlike
Proofs that Yield Nothing but Their Validity or All Languages in NP Have ZeroKnowledge Proof Systems
 JOURNAL OF THE ACM
, 1991
"... In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without convey ..."
Abstract

Cited by 427 (43 self)
 Add to MetaCart
knowledge proofs. Loosely speaking, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula, in particular, without yielding neither a
Efficient ReadRestricted Monotone CNF/DNF Dualization by Learning with Membership Queries
, 1998
"... We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times ("readk" monotone CNF). Let ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times ("readk" monotone CNF). Let
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
"... Abstract. Predicate encryption is a new paradigm generalizing, among other things, identitybased encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used to decryp ..."
Abstract

Cited by 173 (23 self)
 Add to MetaCart
, in turn, enables constructions in which predicates correspond to the evaluation of disjunctions, polynomials, CNF/DNF formulae, or threshold predicates (among others). Besides serving as a significant step forward in the theory of predicate encryption, our results lead to a number of applications
On Converting CNF to DNF
, 2003
"... The bestknown representations of boolean functions f are those as disjunctions of terms (DNFs) and as conjunctions of clauses (CNFs). It is convenient to define the DNF size of f as the minimal number of terms in a DNF representing f and the CNF size as the minimal number of clauses in a CNF re ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The bestknown representations of boolean functions f are those as disjunctions of terms (DNFs) and as conjunctions of clauses (CNFs). It is convenient to define the DNF size of f as the minimal number of terms in a DNF representing f and the CNF size as the minimal number of clauses in a CNF
CNF and DNF Considered Harmful for Computing Prime Implicants / Implicates
 Journal of Automated Reasoning
"... Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal form of an algorithm given by Jackson and Pais. A correctness proof of the PI algorith ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal form of an algorithm given by Jackson and Pais. A correctness proof of the PI
Results 1  10
of
899