1401 search results - page 98 / 281 » Randomness in Interactive Proofs |
CRYPTO
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
JUCS
2008
14 years 9 months ago
2008
Abstract: Recently, Au et al. [Au et al. 2007] pointed out a seemingly neglected security concern for certificateless public key encryption (CL-PKE) scheme, where a malicious key g...
TCS
2010
14 years 8 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
122
click to vote
CSR
2011
Springer
14 years 1 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...