Results 1  10
of
297,411
The Analytic PolynomialTime Hierarchy
 Mathematical Logic Quaterly
, 1997
"... Motivated by results on interactive proof systems we investigate an 98hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomialtime hierarchy, is called the analytic polynomialtime hierarchy. It is shown that every ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. Keywords: Complexity theory, quantifiers, operators, oracles, polynomialtime hierarchies. MSclassification: 03D15, 03D20, 68Q10, 68Q15. 1
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1643 (75 self)
 Add to MetaCart
We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
Short Signatures without Random Oracles
, 2004
"... We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#eHellman assumption. This assumption has similar properties to the Strong RS ..."
Abstract

Cited by 387 (13 self)
 Add to MetaCart
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#eHellman assumption. This assumption has similar properties to the Strong
Inducing Features of Random Fields
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract

Cited by 664 (14 self)
 Add to MetaCart
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
law), then it is possible to reconstruct f to within very high accuracy from a small number of random measurements. typical result is as follows: we rearrange the entries of f (or its coefficients in a fixed basis) in decreasing order of magnitude f  (1) ≥ f  (2) ≥... ≥ f  (N), and define the weakℓp ball
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Bounding Queries in the Analytic PolynomialTime Hierarchy
 Theoretical Computer Science
, 1997
"... In a previous paper the present authors [4] investigated an 98hierarchy over P using word quantifiers as well as two types of set quantifiers, the so called analytic polynomialtime hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP re ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
In a previous paper the present authors [4] investigated an 98hierarchy over P using word quantifiers as well as two types of set quantifiers, the so called analytic polynomialtime hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP
Bounding Queries in the Analytic PolynomialTime Hierarchy
 Theoretical Computer Science
, 1997
"... In a previous paper the present authors [4] investigated an 98hierarchy over P using word quantifiers as well as two types of set quantifiers, the so called analytic polynomialtime hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP re ..."
Abstract
 Add to MetaCart
In a previous paper the present authors [4] investigated an 98hierarchy over P using word quantifiers as well as two types of set quantifiers, the so called analytic polynomialtime hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP
Results 1  10
of
297,411