Sciweavers

1401 search results - page 59 / 281
» Randomness in Interactive Proofs
Sort
View
CP
2004
Springer
15 years 3 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
15 years 3 months ago
On Deniability in the Common Reference String and Random Oracle Model
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
Rafael Pass
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
CDC
2010
IEEE
120views Control Systems» more  CDC 2010»
14 years 4 months ago
Statistical properties of the error covariance in a Kalman filter with random measurement losses
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
Eduardo Rohr, Damián Marelli, Minyue Fu
ACMDIS
2006
ACM
15 years 3 months ago
Designing for experiences: randomness as a resource
Studies which I carried out recently of users of digital music players revealed that the element of randomness plays a role in influencing the user experience (UX). Apart from bei...
Tuck Wah Leong