Sciweavers

2237 search results - page 64 / 448
» On the Security of Random Sources
Sort
View
182
Voted
AFRICACRYPT
2010
Springer
15 years 11 months ago
Fair Blind Signatures without Random Oracles
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
Georg Fuchsbauer, Damien Vergnaud
ISW
2007
Springer
15 years 11 months ago
Identity-Based Proxy Re-encryption Without Random Oracles
A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert ...
Cheng-Kang Chu, Wen-Guey Tzeng
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
15 years 10 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
ICCS
2004
Springer
15 years 10 months ago
Reuse of Paths in Final Gathering Step with Moving Light Sources
Abstract. In this paper we extend our previous result on reusing shooting paths when dealing with moving light sources in radiosity to the final gathering step algorithm, which co...
Mateu Sbert, Francesc Castro
TIT
2011
116views more  TIT 2011»
14 years 11 months ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai