Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks

We consider network graphs $G=(V,E)$ in which adjacent nodes share common secrets. In this setting, certain techniques for perfect end-to-end security (in the sense of confidentiality, authenticity (implying integrity) and availability, i.e., CIA+) can be made applicable without end-to-end shared secrets and without computational intractability assumptions. To this end, we introduce and study the concept of a unique-neighborhood network, in which nodes are uniquely identifiable upon their graph-topological neighborhood. While the concept is motivated by authentication, it may enjoy wider applicability as being a technology-agnostic (yet topology aware) form of addressing nodes in a network

Community-Based Security for the Internet of Things

With more and more devices becoming connectable to the internet, the number of services but also a lot of threats increases dramatically. Security is often a secondary matter behind functionality and comfort, but the problem has already been recognized. Still, with many IoT devices being deployed already, security will come step-by-step and through updates, patches and new versions of apps and IoT software. While these updates can be safely retrieved from app stores, the problems kick in via jailbroken devices and with the variety of untrusted sources arising on the internet. Since hacking is typically a community effort? these days, security could be a community goal too. The challenges are manifold, and one reason for weak or absent security on IoT devices is their weak computational power. In this chapter, we discuss a community based security mechanism in which devices mutually aid each other in secure software management. We discuss game-theoretic methods of community formation and light-weight cryptographic means to accomplish authentic software deployment inside the IoT device community

On the "long" flounders of the far eastern seas of the USSR: Microstomus, Glyptocephalus, Tanakius (Pleuronectidae). (Translation of Doklady Akademii Nauk SSSR, 74(4), 855-857, Zoologii, 1950)

(Document contains 6pp.

Resolving branched DNA intermediates with structure-specific nucleases during replication in eukaryotes

Genome duplication requires that replication forks track the entire length of every chromosome. When complications occur, homologous recombination-mediated repair supports replication fork movement and recovery. This leads to physical connections between the nascent sister chromatids in the form of Holliday junctions and other branched DNA intermediates. A key role in the removal of these recombination intermediates falls to structure-specific nucleases such as the Holliday junction resolvase RuvC in Escherichia coli. RuvC is also known to cut branched DNA intermediates that originate directly from blocked replication forks, targeting them for origin-independent replication restart. In eukaryotes, multiple structure-specific nucleases, including Mus81-Mms4/MUS81-EME1, Yen1/GEN1, and Slx1-Slx4/SLX1-SLX4 (FANCP) have been implicated in the resolution of branched DNA intermediates. It is becoming increasingly clear that, as a group, they reflect the dual function of RuvC in cleaving recombination intermediates and failing replication forks to assist the DNA replication process

Freedom of movement

Holliday junction resolvases lock dynamic DNA four-way junctions into specific structural conformations for symmetric DNA cleavage. Single-molecule studies now reveal that resolvases can relax their grip, enabling Holliday junction conformer transitions and branch migration in the enzyme-bound form