Sciweavers

1786 search results - page 16 / 358
» The Structure of Factor Oracles
Sort
View
90
Voted
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 6 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
BMCBI
2007
143views more  BMCBI 2007»
15 years 23 days ago
Factor analysis for gene regulatory networks and transcription factor activity profiles
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...
Iosifina Pournara, Lorenz Wernisch
ASIACRYPT
2011
Springer
14 years 20 days ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
85
Voted
ARCS
2004
Springer
15 years 6 months ago
Implementation and Evaluation of a Parallel-External Algorithm for Cycle Structure Computation on a PC-Cluster
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
Latifa Boursas, Jörg Keller