Sciweavers

5476 search results - page 93 / 1096
» Resettably Secure Computation
Sort
View
127
Voted
CN
2007
80views more  CN 2007»
15 years 4 months ago
A queueing analysis for the denial of service (DoS) attacks in computer networks
In most network security analysis, researchers mainly focus on qualitative studies on security schemes and possible attacks, and there are few papers on quantitative analysis in t...
Yang Wang, Chuang Lin, Quan-Lin Li, Yuguang Fang
EL
2002
181views more  EL 2002»
15 years 3 months ago
Aspects of networking in multiplayer computer games
Distributed, real-time multiplayer computer games (MCGs) are in the vanguard of utilizing the networking possibilities. Although related research have been done in military simulat...
Jouni Smed, Timo Kaukoranta, Harri Hakonen
ICISC
2009
146views Cryptology» more  ICISC 2009»
15 years 1 months ago
First CPIR Protocol with Data-Dependent Computation
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...
Helger Lipmaa
144
Voted
DCC
2011
IEEE
14 years 11 months ago
Computing bilinear pairings on elliptic curves with automorphisms
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei...
130
Voted
ECCC
1998
88views more  ECCC 1998»
15 years 3 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan