Sciweavers

3130 search results - page 18 / 626
» Collusion without communication
Sort
View
TMC
2012
13 years 2 months ago
Network Coding in Cooperative Communications: Friend or Foe?
—A major benefit of employing network coding (NC) in cooperative communications (CC) is its ability to reduce time-slot overhead. Such approach is called network-coded CC (or NC...
Sushant Sharma, Yi Shi, Jia Liu, Y. Thomas Hou, Sa...
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 6 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...

Publication
257views
16 years 10 months ago
The P-Square Algorithm for Dynamic Calculation of Percentiles and Histograms without Storing Observations
A heuristic algorithm is proposed for dynamic calculation of the median and other quantiles. The estimates are produced dynamically as the observations are generated. The observati...
R. Jain, I. Chlamtac
ASIACRYPT
2005
Springer
15 years 5 months ago
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
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...
Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, H...
ACMSE
2009
ACM
14 years 9 months ago
A secure unidirectional proxy re-encryption using identity and secret key exchange
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
Edna Milgo