Results 1  10
of
33
Algorithms for Deterministic Incremental Dependency Parsing
 Computational Linguistics
, 2008
"... Parsing algorithms that process the input from left to right and construct a single derivation have often been considered inadequate for natural language parsing because of the massive ambiguity typically found in natural language grammars. Nevertheless, it has been shown that such algorithms, combi ..."
Abstract

Cited by 116 (20 self)
 Add to MetaCart
, combined with treebankinduced classifiers, can be used to build highly accurate disambiguating parsers, in particular for dependencybased syntactic representations. In this article, we first present a general framework for describing and analyzing algorithms for deterministic incremental dependency
Randomness vs. Time: Derandomization under a uniform assumption
"... We prove that if BPP � = EXP, then every problem in BPP can be solved deterministically in subexponential time on almost every input ( on every samplable ensemble for infinitely many input sizes). This is the first derandomization result for BP P based on uniform, noncryptographic hardness assumptio ..."
Abstract

Cited by 72 (11 self)
 Add to MetaCart
is identical to that used in the analogous nonuniform results of [21, 3]. However, previous proofs of correctness assume the “hard function ” is not in P/poly. They give a nonconstructive argument that a circuit distinguishing the pseudorandom strings from truly random strings implies that a similarly
A Probabilistic Data Encryption scheme (PDES)
"... In this paper the author presents a probabilistic encryption scheme that is polynomially secure and has the efficiency of deterministic schemes. From the theoretical construction of Brands and Gill (1996), it is clear that the proof of Pseudo randomness of the quadratic residue generator is complete ..."
Abstract
 Add to MetaCart
In this paper the author presents a probabilistic encryption scheme that is polynomially secure and has the efficiency of deterministic schemes. From the theoretical construction of Brands and Gill (1996), it is clear that the proof of Pseudo randomness of the quadratic residue generator
Some Implications of Complexity Theory on PseudoRandom Bit Generation
, 1985
"... A recent area of interest in theoretical computer science has been in the construction of socalled pseudorandom bit generators. These generators "stretch" a short sequence of truly random bits into a longer sequence of "pseudorandom" bits. These bits are sufficiently indisting ..."
Abstract
 Add to MetaCart
that if any such function exists, then it can be used to construct a pseudorandom bit generator. Furthermore, the existence of this generator implies that __. N>0 DTIME(2"'). No proofs of the results have previously appeared in print. In this thesis, we present proofs of these results
Recycling Random Bits in Parallel
"... We show that r pseudorandom bits can be obtained by concatenating t blocks of r=t pseudorandom bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]  recycling random bits by doing a random walk on an expander. The proof is based on the fact that t ..."
Abstract
 Add to MetaCart
We show that r pseudorandom bits can be obtained by concatenating t blocks of r=t pseudorandom bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]  recycling random bits by doing a random walk on an expander. The proof is based on the fact
tParticle Random Walks and Recycling Random Bits in Parallel
, 1993
"... We show that r pseudorandom bits can be obtained by concatenating t blocks of r=t pseudorandom bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]  recycling random bits by doing a random walk on an expander. The proof is based on the fact that ..."
Abstract
 Add to MetaCart
We show that r pseudorandom bits can be obtained by concatenating t blocks of r=t pseudorandom bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]  recycling random bits by doing a random walk on an expander. The proof is based on the fact
Optimal randomness extraction from a DiffieHellman element
 EUROCRYPT 2009, volume 5479 of LNCS
, 2009
"... Abstract. In this paper, we study a quite simple deterministic randomness extractor from random DiffieHellman elements defined over a prime order multiplicative subgroup G of a finite field Zp (the truncation), and over a group of points of an elliptic curve (the truncation of the abscissa). Inform ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
at ICALP’06 by Fouque et al. It can also be used to improve previous bounds proposed by Canetti et al. One of the main application of this extractor is to mathematically prove an assumption proposed at Crypto ’07 and used in the security proof of the Elliptic Curve Pseudo Random Generator proposed
Barriers in cryptography with weak, correlated and leaky sources
, 2012
"... There has been much recent progress in constructing cryptosystems that maintain their security without requiring uniform randomness and perfect secrecy. These schemes are motivated by a diverse set of problems such as providing resilience to sidechannel leakage, using weak physical sources of rando ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
of randomness as secret keys, and allowing deterministic encryption for highentropy messages. The study of these problems has significantly deepened our understanding of how randomness is used in cryptographic constructions and proofs. Nevertheless, despite this progress, some basic and seemingly achievable
PrivacyPreserving Accountable Computation
"... Abstract. Accountability of distributed systems aims to ensure that whenever a malicious behavior is observed, it can be irrefutably linked to a malicious node and that every honest node can disprove false accusations. Recent work, such as PeerReview and its extensions, shows how to achieve accounta ..."
Abstract
 Add to MetaCart
accountability in both deterministic and randomized systems. The basic idea is to generate tamperevident logs of the performed computations such that an external auditor can check the system’s actions by mere recomputation. For randomized computations it is more challenging: revealing the seed of the pseudo
On FHE Without Bootstrapping (Informal)
, 2013
"... In this work we come up with two fully homomorphic schemes. First, we propose an INDCPA secure symmetric key homomorphic encryption scheme using multivariate polynomial ring over finite fields. This scheme gives a method of constructing a CPA secure homomorphic encryption scheme from another symm ..."
Abstract
 Add to MetaCart
symmetric deterministic CPA secure scheme. We base the security of the scheme on pseudo random functions and prove the scheme to be INDCPA secure, rather than basing security on hard problems like Ideal Membership and Gröbner basis as seen in most polly cracker based schemes which also use multivariate
Results 1  10
of
33