The first distinguishing, forgery and second preimage attacks on step-reduced HMAC-SHA-1 have recently been presented by Kim et al. In this note we report on ongoing work to improve their data complexity and present new attacks on HMAC-SHA-1 covering more steps. Additionally, we show how a collision-based technique can be used to reduce the key entropy of NMAC-SHA-1. Finally we comment on the a...

We investigate the merits of altering the Garg, Gentry and Halevi (GGH13) graded encoding scheme to remove the presence of the ideal 〈g〉. In particular, we show that we can alter the form of encodings so that effectively a new gi is used for each source group Gi, while retaining correctness. This would appear to prevent all known attacks on indistinguishability obfuscation (IO) candidates insta...

A coloring of the vertices of a graph G is said to be distinguishing provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G. The distinguishing chromatic number of G, χD(G), is the minimum number of colors in a distinguishing coloring of G that is also a proper coloring....

A group A acting faithfully on a set X has distinguishing number k, written D(A,X) = k, if there is a coloring of the elements of X with k colors such that no nonidentity element of A is color-preserving, and no such coloring with fewer than k colors exists. Given a map M with vertex set V and automorphism group Aut(M), let D(M) = D(Aut(M), V ). If M is orientable, let D+(M) = D(Aut+(M), V ), w...

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

‎The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$‎ ‎such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial‎ ‎automorphism‎. ‎For any $n in mathbb{N}$‎, ‎the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...

Editorial Hand-arm vibration syndrome: a new clinical classification and an updated British standard guide for hand transmitted vibration Raynaud's phenomenon of occupational origin known in the 1950s as "the vibration syndrome" or "vibration induced white finger (VWF)" has, in the 1980s, been renamed "the hand-arm vibration syndrome ." This occupational hazard has, since 1890, afflicted operat...

In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number. We find χD(G) for various families of graphs and characterize those graphs with χD(G) = |V (G)|, and those trees with the maximum chromatic distingushing number for trees. We prove analogs of Brooks’ Theorem for both the...

Objetivo: focada na Hermenêutica Jurídica e adequada prestação jurisdicional, a pesquisa objetiva traçar elementos do precedente judicial, como um todo, distinguishing, objeto específico, sob o sistema de precedentes obrigatórios adotado pelo Código Processo Civil brasileiro. O argumento distinção impõe busca sua natureza jurídica, seus limites e, ainda, reforçou importância da atividade interp...