Sciweavers

128 search results - page 3 / 26
» Weak Verifiable Random Functions
Sort
View
JAR
2008
88views more  JAR 2008»
13 years 5 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
BSL
2005
70views more  BSL 2005»
13 years 5 months ago
Mass problems and randomness
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
Stephen G. Simpson
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
13 years 8 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...
FSE
2008
Springer
101views Cryptology» more  FSE 2008»
13 years 6 months ago
Post-Processing Functions for a Biased Physical Random Number Generator
Abstract. A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing desc...
Patrick Lacharme
FOCM
2007
76views more  FOCM 2007»
13 years 5 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale