Results 121 to 130 of about 7,628 (169)

To hash or not to hash: A security assessment of CSP’s unsafe-hashes expression

2022 IEEE Security and Privacy Workshops (SPW), 2022
More and more people use the Web on a daily basis. We use it for communicating, doing bank transactions, and entertainment. This popularity of the Web has made it one of the main targets of attacks, most prominently Cross-Site Scripting (XSS). To mitigate the effect of those attacks, the prevalence of the Content Security Policy (CSP) is increasing ...
Peter Stolz, Sebastian Roth, Ben Stock
openaire   +1 more source

MRD Hashing

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reihaneh Safavi-Naini, Chris Charnes
openaire   +1 more source

On the use of Extendible Hashing without hashing

Information Processing Letters, 1984
On fait un rapport sur l'usage de nombres decimaux codes en EBCDIC qui sont stockes dans la table ExHash sans randomisation anterieure. Ainsi on ne distingue pas les cles des pseudocles. Ceci prevoit donc le traitement sequentiel des enregistrements dans l'ordre de cle qui est communement utilise dans les applications de base de donnee.
Ulrich Bechtold, Klaus Küspert
openaire   +1 more source

Hash length prediction for video hashing

2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW), 2016
Video hashing has attracted increasing attention in the field of video searching. However, there was no technical research on the prediction of hash length, which is extremely important in mobile circumstance. In this paper, a hash length prediction method is proposed for video hashing in the case of video copy detection. The video feature is mapped to
Jiande Sun 0001, Wulin Wang, Jing Li 0046, Huaxiang Zhang 0001   +3 more
openaire   +1 more source

Nonoblivious hashing

Journal of the ACM, 1988
Nonoblivious hashing, where information gathered from unsuccessful probes is used to modify subsequent probe strategy, is introduced and used to obtain the following results for static lookup on full tables: (1) An O (1)-time worst-case ...
Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel   +3 more
openaire   +2 more sources

Hopscotch Hashing

2008
We present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore machines. The new hopscotch algorithms are based on a novel hopscotchmulti-phased probing and displacement technique that has the flavors of chaining, cuckoo hashing, and linear probing, all put together, yet avoids the ...
Herlihy M., Shavit N., Tzafrir M.
openaire   +1 more source

Adaptive hashing

Information Systems, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yeong-Shiou Hsiao, Alan L. Tharp
openaire   +2 more sources

Hashing practice: analysis of hashing and universal hashing

ACM SIGMOD Record, 1988
Much of the literature on hashing deals with overflow handling (collision resolution) techniques and its analysis. What does all the analytical results mean in practice and how can they be achieved with practical files? This paper considers the problem of achieving analytical performance of hashing techniques in practice with reference to successful ...
openaire   +1 more source

Load Balancing Hashing in Geographic Hash Tables

IEEE Transactions on Parallel and Distributed Systems, 2012
In this paper, we address the problem of balancing the network traffic load when the data generated in a wireless sensor network is stored on the sensor node themselves, and accessed through querying a geographic hash table. Existing approaches allow balancing network load by changing the georouting protocol used to forward queries in the geographic ...
Renda Elena, Resta Giovanni, Santi Paolo
openaire   +2 more sources