Cayley hashing with cookies

• URL: http://arxiv.org/abs/2402.04943v1
• Date: Wed, 7 Feb 2024 15:22:17 GMT
• Title: Cayley hashing with cookies
• Authors: Vladimir Shpilrain, Bianca Sosnovski,
• Abstract summary: Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit. In this paper, we offer a way to get rid of this alleged disadvantage and keep the advantages at the same time.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the semigroup. The main advantage of Cayley hash functions compared to, say, hash functions in the SHA family is that when an already hashed document is amended, one does not have to hash the whole amended document all over again, but rather hash just the amended part and then multiply the result by the hash of the original document. Some authors argued that this may be a security hazard, specifically that this property may facilitate finding a second preimage by splitting a long bit string into shorter pieces. In this paper, we offer a way to get rid of this alleged disadvantage and keep the advantages at the same time. We call this method ``Cayley hashing with cookies" using terminology borrowed from the theory of random walks in a random environment. For the platform semigroup, we use 2x2 matrices over F_p.

Related papers

• ConceptHash: Interpretable Fine-Grained Hashing via Concept Discovery [128.30514851911218]
  ConceptHash is a novel method that achieves sub-code level interpretability. In ConceptHash, each sub-code corresponds to a human-understandable concept, such as an object part. We incorporate language guidance to ensure that the learned hash codes are distinguishable within fine-grained object classes.
  arXiv  Detail & Related papers  (2024-06-12T17:49:26Z)
• Cryptanalysis of a Cayley Hash Function Based on Affine Maps in one Variable over a Finite Field [0.0]
  Cayley hash functions are cryptographic hashes constructed from Cayley graphs of groups. The hash function proposed by Shpilrain and Sosnovski, based on linear functions over a finite field, was proven insecure. This paper shows that the proposal by Ghaffari and Mostmaghi that uses the hash in its construction is also insecure.
  arXiv  Detail & Related papers  (2023-08-30T05:13:55Z)
• Unsupervised Hashing with Similarity Distribution Calibration [127.34239817201549]
  Unsupervised hashing methods aim to preserve the similarity between data points in a feature space by mapping them to binary hash codes. These methods often overlook the fact that the similarity between data points in the continuous feature space may not be preserved in the discrete hash code space. The similarity range is bounded by the code length and can lead to a problem known as similarity collapse. This paper introduces a novel Similarity Distribution (SDC) method to alleviate this problem.
  arXiv  Detail & Related papers  (2023-02-15T14:06:39Z)
• A Lower Bound of Hash Codes' Performance [122.88252443695492]
  In this paper, we prove that inter-class distinctiveness and intra-class compactness among hash codes determine the lower bound of hash codes' performance. We then propose a surrogate model to fully exploit the above objective by estimating the posterior of hash codes and controlling it, which results in a low-bias optimization. By testing on a series of hash-models, we obtain performance improvements among all of them, with an up to $26.5%$ increase in mean Average Precision and an up to $20.5%$ increase in accuracy.
  arXiv  Detail & Related papers  (2022-10-12T03:30:56Z)
• Post-quantum hash functions using $\mathrm{SL}_n(\mathbb{F}_p)$ [0.0]
  We define new families of Tillich-Z'emor hash functions, using higher dimensional special linear groups over finite fields as platforms. Cayley graphs of these groups combine fast mixing properties and high girth, which together give rise to good preimage and collision resistance of the corresponding hash functions.
  arXiv  Detail & Related papers  (2022-07-08T16:15:11Z)
• Self-Distilled Hashing for Deep Image Retrieval [25.645550298697938]
  In hash-based image retrieval systems, transformed input from the original usually generates different codes. We propose a novel self-distilled hashing scheme to minimize the discrepancy while exploiting the potential of augmented data. We also introduce hash proxy-based similarity learning and binary cross entropy-based quantization loss to provide fine quality hash codes.
  arXiv  Detail & Related papers  (2021-12-16T12:01:50Z)
• Quantum collision finding for homomorphic hash functions [0.0]
  We present concrete attack examples to provable hash functions, including a preimage attack to $oplus$-linear hash functions. Hash functions which are additive or multiplicative are vulnerable to a quantum attack using the hidden subgroup problem algorithm for quantum computers.
  arXiv  Detail & Related papers  (2021-07-30T23:01:02Z)
• CIMON: Towards High-quality Hash Codes [63.37321228830102]
  We propose a new method named textbfComprehensive stextbfImilarity textbfMining and ctextbfOnsistency leartextbfNing (CIMON) First, we use global refinement and similarity statistical distribution to obtain reliable and smooth guidance. Second, both semantic and contrastive consistency learning are introduced to derive both disturb-invariant and discriminative hash codes.
  arXiv  Detail & Related papers  (2020-10-15T14:47:14Z)
• Deep Hashing with Hash-Consistent Large Margin Proxy Embeddings [65.36757931982469]
  Image hash codes are produced by binarizing embeddings of convolutional neural networks (CNN) trained for either classification or retrieval. The use of a fixed set of proxies (weights of the CNN classification layer) is proposed to eliminate this ambiguity. The resulting hash-consistent large margin (HCLM) proxies are shown to encourage saturation of hashing units, thus guaranteeing a small binarization error.
  arXiv  Detail & Related papers  (2020-07-27T23:47:43Z)
• Procrustean Orthogonal Sparse Hashing [3.302605292858623]
  We show that insect olfaction is structurally and functionally analogous to sparse hashing. We present a novel method, Procrustean Orthogonal Sparse Hashing (POSH), that unifies these findings. We propose two new methods, Binary OSL and SphericalHash, to address these deficiencies.
  arXiv  Detail & Related papers  (2020-06-08T18:09:33Z)
• Reinforcing Short-Length Hashing [61.75883795807109]
  Existing methods have poor performance in retrieval using an extremely short-length hash code. In this study, we propose a novel reinforcing short-length hashing (RSLH) In this proposed RSLH, mutual reconstruction between the hash representation and semantic labels is performed to preserve the semantic information. Experiments on three large-scale image benchmarks demonstrate the superior performance of RSLH under various short-length hashing scenarios.
  arXiv  Detail & Related papers  (2020-04-24T02:23:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.