Sciweavers

5324 search results - page 779 / 1065
» Internet Security Protocols
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 10 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
IACR
2011
115views more  IACR 2011»
12 years 10 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
TMC
2012
12 years 1 months ago
Protecting Location Privacy in Sensor Networks against a Global Eavesdropper
— While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be c...
Kiran Mehta, Donggang Liu, Matthew Wright
WWW
2004
ACM
14 years 11 months ago
Session level techniques for improving web browsing performance on wireless links
Recent observations through experiments that we have performed in current third generation wireless networks have revealed that the achieved throughput over wireless links varies ...
Pablo Rodriguez, Sarit Mukherjee, Sampath Rangaraj...
WWW
2002
ACM
14 years 11 months ago
Aliasing on the world wide web: prevalence and performance implications
Aliasing occurs in Web transactions when requests containing different URLs elicit replies containing identical data payloads. Conventional caches associate stored data with URLs ...
Terence Kelly, Jeffrey C. Mogul