139 search results - page 20 / 28 » How Common Can Be Universality for Cellular Automata |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
SOUPS
2010
ACM
13 years 11 months ago
2010
ACM
Text-based passwords are still the most commonly used authentication mechanism in information systems. We took advantage of a unique opportunity presented by a significant change...
KBSE
2007
IEEE
14 years 2 months ago
2007
IEEE
Threat modeling analyzes how an adversary might attack a system by supplying it with malicious data or interacting with it. The analysis uses a Data Flow Diagram (DFD) to describe...
BMCBI
2008
13 years 7 months ago
2008
Background: Protein-protein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallym...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...