20 search results - page 1 / 4 » Explicit Randomness is not Necessary when Modeling Probabili... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we discuss non-interactive updating of decryption keys in identity-based encryption (IBE). IBE is a public key cryptosystem where a public key is an arbitrary strin...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...