Sciweavers

434 search results - page 11 / 87
» Logical Analysis of Hash Functions
Sort
View
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
13 years 8 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
EUROCRYPT
2008
Springer
15 years 7 months ago
Security/Efficiency Tradeoffs for Permutation-Based Hashing
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
Phillip Rogaway, John P. Steinberger
UC
2009
Springer
16 years 12 days ago
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
Frédéric Prost, Chaouki Zerrari
ICLP
2005
Springer
15 years 11 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
DOCENG
2007
ACM
15 years 9 months ago
Logical document conversion: combining functional and formal knowledge
We present in this paper a method for document layout analysis based on identifying the function of document elements (what they do). This approach is orthogonal and complementary...
Hervé Déjean, Jean-Luc Meunier