@article{7764,
abstract = {States of self stress, organizations of internal forces in many-body systems that are in equilibrium with an absence of external forces, can be thought of as the constitutive building blocks of the elastic response of a material. In overconstrained disordered packings they have a natural mathematical correspondence with the zero-energy vibrational modes in underconstrained systems. While substantial attention in the literature has been paid to diverging length scales associated with zero- and finite-energy vibrational modes in jammed systems, less is known about the spatial structure of the states of self stress. In this work we define a natural way in which a unique state of self stress can be associated with each bond in a disordered spring network derived from a jammed packing, and then investigate the spatial structure of these bond-localized states of self stress. This allows for an understanding of how the elastic properties of a system would change upon changing the strength or even existence of any bond in the system.},
author = {Sussman, Daniel M. and Goodrich, Carl Peter and Liu, Andrea J.},
issn = {1744-683X},
journal = {Soft Matter},
number = {17},
pages = {3982--3990},
publisher = {Royal Society of Chemistry},
title = {{Spatial structure of states of self stress in jammed systems}},
doi = {10.1039/c6sm00094k},
volume = {12},
year = {2016},
}
@inproceedings{1165,
abstract = {We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.},
author = {Fulek, Radoslav},
location = {Athens, Greece},
pages = {94 -- 106},
publisher = {Springer},
title = {{C-planarity of embedded cyclic c-graphs}},
doi = {10.1007/978-3-319-50106-2_8},
volume = {9801 },
year = {2016},
}
@article{816,
abstract = {Immature HIV-1 assembles at and buds from the plasma membrane before proteolytic cleavage of the viral Gag polyprotein induces structural maturation. Maturation can be blocked by maturation inhibitors (MIs), thereby abolishing infectivity. The CA (capsid) and SP1 (spacer peptide 1) region of Gag is the key regulator of assembly and maturation and is the target of MIs.We applied optimized cryo-electron tomography and subtomogram averaging to resolve this region within assembled immature HIV-1 particles at 3.9 angstrom resolution and built an atomic model. The structure reveals a network of intra- And intermolecular interactions mediating immature HIV-1 assembly. The proteolytic cleavage site between CA and SP1 is inaccessible to protease.We suggest that MIs prevent CA-SP1 cleavage by stabilizing the structure, and MI resistance develops by destabilizing CA-SP1.},
author = {Florian Schur and Martin Obr and Hagen, Wim J and Wan, William and Jakobi, Arjen J and Kirkpatrick, Joanna M and Sachse, Carsten and Kraüsslich, Hans Georg and Briggs, John A},
journal = {Science},
number = {6298},
pages = {506 -- 508},
publisher = {American Association for the Advancement of Science},
title = {{An atomic model of HIV-1 capsid-SP1 reveals structures regulating assembly and maturation}},
doi = {10.1126/science.aaf9620},
volume = {353},
year = {2016},
}
@article{8241,
abstract = {Background: Anticancer vaccines could represent a valuable complementary strategy to established therapies, especially in settings of early stage and minimal residual disease. HER-2 is an important target for immunotherapy and addressed by the monoclonal antibody trastuzumab. We have previously generated HER-2 mimotope peptides from phage display libraries. The synthesized peptides were coupled to carriers and applied for epitope-specific induction of trastuzumab-like IgG. For simplification and to avoid methodological limitations of synthesis and coupling chemistry, we herewith present a novel and optimized approach by using adeno-associated viruses (AAV) as effective and high-density mimotope-display system, which can be directly used for vaccination. Methods: An AAV capsid display library was constructed by genetically incorporating random peptides in a plasmid encoding the wild-type AAV2 capsid protein. AAV clones, expressing peptides specifically reactive to trastuzumab, were employed to immunize BALB/c mice. Antibody titers against human HER-2 were determined, and the isotype composition and functional properties of these were tested. Finally, prophylactically immunized mice were challenged with human HER-2 transfected mouse D2F2/E2 cells. Results: HER-2 mimotope AAV-vaccines induced antibodies specific to human HER-2. Two clones were selected for immunization of mice, which were subsequently grafted D2F2/E2 cells. Both mimotope AAV clones delayed the growth of tumors significantly, as compared to controls. Conclusion: In this study, a novel mimotope AAV-based platform was created allowing the isolation of mimotopes, which can be directly used as anticancer vaccines. The example of trastuzumab AAV-mimotopes demonstrates that this vaccine strategy could help to establish active immunotherapy for breast-cancer patients.},
author = {Singer, Josef and Manzano-Szalai, Krisztina and Fazekas, Judit and Thell, Kathrin and Bentley-Lukschal, Anna and Stremnitzer, Caroline and Roth-Walter, Franziska and Weghofer, Margit and Ritter, Mirko and Pino Tossi, Kerstin and Hörer, Markus and Michaelis, Uwe and Jensen-Jarolim, Erika},
issn = {2162-402X},
journal = {OncoImmunology},
number = {7},
publisher = {Taylor & Francis},
title = {{Proof of concept study with an HER-2 mimotope anticancer vaccine deduced from a novel AAV-mimotope library platform}},
doi = {10.1080/2162402x.2016.1171446},
volume = {5},
year = {2016},
}
@inproceedings{1071,
abstract = {We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W=Theta(log n). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries. The data-structure uses at all times O(n) space. Our second contribution is a space-time tradeoff data-structure for distance queries. For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing time that allows pair queries in O(n^{1-\epsilon} alpha(n)) time, where alpha is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space. The input graph G is not considered in the space complexity. },
author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas},
location = {Aarhus, Denmark},
publisher = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik},
title = {{Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs}},
doi = {10.4230/LIPIcs.ESA.2016.28},
volume = {57},
year = {2016},
}
@inproceedings{8300,
abstract = {The integration of social networking concepts into Internet of Things systems is a burgeoning topic of research that promises to support novel and more powerful applications. In this paper we focus on the design and implementation of a highly scalable Trust and Reputation Model for the Internet of Things based on the social approach that the COSMOS project introduces, as part of its final results. We create our model by combining popular solutions proposed for Peer-to-Peer and mobile ad-hoc networks and adapting them on the Internet of Things concept. Each Thing can compute the Trust index of another Thing based on its own experiences, while it has the capability of determining its Reputation Index either by consulting its other “friends” (Followees) or referring to the Platform, a management system used in COSMOS. The model is tested through simulations of the proposed social system, demonstrating the ability of TRM-SIoT to achieve the Social Exclusion of malicious nodes and collectives from the network, with low computational overhead and high scalability. Furthermore, due to the adaptive nature of the system, Social Reintegration of these nodes is also possible.},
author = {Kokoris Kogias, Eleftherios and Voutyras, Orfefs and Varvarigou, Theodora},
booktitle = {2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation},
isbn = {9781509013142},
location = {Berlin, Germany},
publisher = {IEEE},
title = {{TRM-SIoT: A scalable hybrid trust & reputation model for the social Internet of Things}},
doi = {10.1109/etfa.2016.7733612},
year = {2016},
}
@inproceedings{8302,
abstract = {While showing great promise, Bitcoin requires users to wait tens of minutes for transactions to commit, and even then, offering only probabilistic guarantees. This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable collective signing to commit Bitcoin transactions irreversibly within seconds. ByzCoin achieves Byzantine consensus while preserving Bitcoin’s open membership by dynamically forming hash power-proportionate consensus groups that represent recently-successful block miners. ByzCoin employs communication trees to optimize transaction commitment and verification under normal operation while guaranteeing safety and liveness under Byzantine faults, up to a near-optimal tolerance of f faulty group members among 3f + 2 total. ByzCoin mitigates double spending and selfish mining attacks by producing collectively signed transaction blocks within one minute of transaction submission. Tree-structured communication further reduces this latency to less than 30 seconds. Due to these optimizations, ByzCoin achieves a throughput higher than Paypal currently handles, with a confirmation latency of 15-20 seconds.},
author = {Kokoris Kogias, Eleftherios and Jovanovic, Philipp and Gailly, Nicolas and Khoffi, Ismail and Gasser, Linus and Ford, Bryan},
booktitle = {Proceedings of the 25th USENIX Conference on Security Symposium},
isbn = {9781931971324},
location = {Austin, TX, United States},
pages = {279–296},
publisher = {USENIX Association},
title = {{Enhancing bitcoin security and performance with strong consistency via collective signing}},
year = {2016},
}
@inproceedings{1229,
abstract = {Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme is defined for some NP language L and lets a sender encrypt messages relative to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L, but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps and give another construction [GGH+13b] using indistinguishability obfuscation (iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently hardly be implemented on powerful hardware and will unlikely be realizable on constrained devices like smart cards any time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption keys and a common reference string (used for encryption). This setup need only be run once, and the parame- ters can be used for arbitrary many encryptions. Our scheme can also be turned into a functional WE scheme, where a message is encrypted w.r.t. a statement and a function f, and decryption with a witness w yields f (m, w). Our construction is inspired by the functional encryption scheme by Garg et al. and we prove (selective) security assuming iO and statistically simulation-sound NIZK. We give a construction of the latter in bilinear groups and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at a 128-bit security level and can be computed on a smart card.},
author = {Abusalah, Hamza M and Fuchsbauer, Georg and Pietrzak, Krzysztof Z},
location = {Guildford, UK},
pages = {285 -- 303},
publisher = {Springer},
title = {{Offline witness encryption}},
doi = {10.1007/978-3-319-39555-5_16},
volume = {9696},
year = {2016},
}
@inproceedings{1236,
abstract = {A constrained pseudorandom function F: K × X → Y for a family T ⊆ 2X of subsets of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while even given this key, the outputs on all inputs x ∉ S look random. At Asiacrypt’13 Boneh and Waters gave a construction which supports the most general set family so far. Its keys kc are defined for sets decided by boolean circuits C and enable evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF input length and the size of the circuits C for which constrained keys can be computed must be fixed beforehand during key generation. We construct a constrained PRF that has an unbounded input length and whose constrained keys can be defined for any set recognized by a Turing machine. The only a priori bound we make is on the description size of the machines. We prove our construction secure assuming publiccoin differing-input obfuscation. As applications of our constrained PRF we build a broadcast encryption scheme where the number of potential receivers need not be fixed at setup (in particular, the length of the keys is independent of the number of parties) and the first identity-based non-interactive key exchange protocol with no bound on the number of parties that can agree on a shared key.},
author = {Abusalah, Hamza M and Fuchsbauer, Georg and Pietrzak, Krzysztof Z},
location = {San Francisco, CA, USA},
pages = {413 -- 428},
publisher = {Springer},
title = {{Constrained PRFs for unbounded inputs}},
doi = {10.1007/978-3-319-29485-8_24},
volume = {9610},
year = {2016},
}
@inproceedings{1235,
abstract = {A constrained pseudorandom function (CPRF) F: K×X → Y for a family T of subsets of χ is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a short constrained key kS, which allows to evaluate F(k, ·) on all inputs x ∈ S, while the outputs on all inputs x /∈ S look random even given kS. Abusalah et al. recently constructed the first constrained PRF for inputs of arbitrary length whose sets S are decided by Turing machines. They use their CPRF to build broadcast encryption and the first ID-based non-interactive key exchange for an unbounded number of users. Their constrained keys are obfuscated circuits and are therefore large. In this work we drastically reduce the key size and define a constrained key for a Turing machine M as a short signature on M. For this, we introduce a new signature primitive with constrained signing keys that let one only sign certain messages, while forging a signature on others is hard even when knowing the coins for key generation.},
author = {Abusalah, Hamza M and Fuchsbauer, Georg},
location = {Guildford, UK},
pages = {445 -- 463},
publisher = {Springer},
title = {{Constrained PRFs for unbounded inputs with short keys}},
doi = {10.1007/978-3-319-39555-5_24},
volume = {9696},
year = {2016},
}