@inproceedings{3211,
abstract = {We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bits. The result assumes that no message queried is a prefix of any other, as is the case when all messages to be MACed have the same length. We go on to give an improved analysis of the encrypted CBC MAC, where there is no restriction on queried messages. Letting m be the block length of the longest query, our bounds are about mq2/2n for the basic CBC MAC and mo(1)q2/2n for the encrypted CBC MAC, improving prior bounds of m2q2/2n. The new bounds translate into improved guarantees on the probability of forging these MACs.},
author = {Bellare, Mihir and Krzysztof Pietrzak and Rogaway, Phillip},
pages = {527 -- 545},
publisher = {Springer},
title = {{Improved security analyses for CBC MACs}},
doi = {10.1007/11535218_32},
volume = {3621},
year = {2005},
}
@inproceedings{3212,
abstract = {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 is computed as f−1(h(m)) (here f ∈R F and h is modelled as a random oracle). It is known to be existentially unforgeable for any TDP family F [3], although a much tighter security reduction is known for a restrictive class of TDP’s [10,14] — namely, those induced by a family of claw-free permutations (CFP) pairs. The latter result was shown [11] to match the best possible “black-box” security reduction in the random oracle model, irrespective of the TDP family F (e.g., RSA) one might use.
In this work we investigate the question if it is possible to instantiate the random oracle h with a “real” family of hash functions H such that the corresponding schemes can be proven secure in the standard model, under some natural assumption on the family F. Our main result rules out the existence of such instantiations for any assumption on F which (1) is satisfied by a family of random permutations; and (2) does not allow the attacker to invert f ∈R F on an a-priori unbounded number of points. Moreover, this holds even if the choice of H can arbitrarily depend on f. As an immediate corollary, we rule out instantiating FDH based on general claw-free permutations, which shows that in order to prove the security of FDH in the standard model one must utilize significantly more structure on F than what is sufficient for the best proof of security in the random oracle model.},
author = {Dodis, Yevgeniy and Oliveira, Roberto and Krzysztof Pietrzak},
pages = {449 -- 466},
publisher = {Springer},
title = {{On the generic insecurity of the full domain hash}},
doi = {10.1007/11535218_27},
volume = {3621},
year = {2005},
}
@inproceedings{3213,
abstract = {We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure against adaptive distinguishers. The sequential composition of F and G is the function G(F()), the parallel composition is F G where ⋆ is some group operation. It has been shown that composition indeed gives adaptive security in the information theoretic setting, but unfortunately the proof does not translate into the more interesting computational case.
In this work we show that in the computational setting composition does not imply adaptive security: If there is a prime order cyclic group where the decisional Diffie-Hellman assumption holds, then there are functions F and G which are indistinguishable by non-adaptive polynomially time-bounded adversaries, but whose parallel composition can be completely broken (i.e. we recover the key) with only three adaptive queries. We give a similar result for sequential composition. Interestingly, we need a standard assumption from the asymmetric (aka. public-key) world to prove a negative result for symmetric (aka. private-key) systems.},
author = {Krzysztof Pietrzak},
pages = {55 -- 65},
publisher = {Springer},
title = {{Composition does not imply adaptive security}},
doi = {10.1007/11535218_4},
volume = {3621},
year = {2005},
}
@article{3416,
abstract = {In the last decade atomic force microscopy has been used to measure the mechanical stability of single proteins. These force spectroscopy experiments have shown that many water-soluble and membrane proteins unfold via one or more intermediates. Recently, Li and co-workers found a linear correlation between the unfolding force of the native state and the intermediate in fibronectin, which they suggested indicated the presence of a molecular memory or multiple unfolding pathways (1). Here, we apply two independent methods in combination with Monte Carlo simulations to analyze the unfolding of α-helices E and D of bacteriorhodopsin (BR). We show that correlation analysis of unfolding forces is very sensitive to errors in force calibration of the instrument. In contrast, a comparison of relative forces provides a robust measure for the stability of unfolding intermediates. The proposed approach detects three energetically different states of α-helices E and D in trimeric BR. These states are not observed for monomeric BR and indicate that substantial information is hidden in forced unfolding experiments of single proteins.},
author = {Harald Janovjak and Sapra, Tanuj K and Mueller, Daniel J},
journal = {Biophysical Journal},
number = {5},
pages = {37 -- 39},
publisher = {Biophysical Society},
title = {{Complex stability of single proteins explored by forced unfolding experiments}},
doi = {10.1529/biophysj.105.059774},
volume = {88},
year = {2005},
}
@article{3417,
abstract = {Recently, direct measurements of forces stabilizing single proteins or individual receptor–ligand bonds became possible with ultra-sensitive force probe methods like the atomic force microscope (AFM). In force spectroscopy experiments using AFM, a single molecule or receptor–ligand pair is tethered between the tip of a micromachined cantilever and a supporting surface. While the molecule is stretched, forces are measured by the deflection of the cantilever and plotted against extension, yielding a force spectrum characteristic for each biomolecular system. In order to obtain statistically relevant results, several hundred to thousand single-molecule experiments have to be performed, each resulting in a unique force spectrum. We developed software and algorithms to analyse large numbers of force spectra. Our algorithms include the fitting polymer extension models to force peaks as well as the automatic alignment of spectra. The aligned spectra allowed recognition of patterns of peaks across different spectra. We demonstrate the capabilities of our software by analysing force spectra that were recorded by unfolding single transmembrane proteins such as bacteriorhodopsin and NhaA. Different unfolding pathways were detected by classifying peak patterns. Deviant spectra, e.g. those with no attachment or erratic peaks, can be easily identified. The software is based on the programming language C++, the GNU Scientific Library (GSL), the software WaveMetrics IGOR Pro and available open-source at http://bioinformatics.org/fskit/.},
author = {Kuhn, Michael and Harald Janovjak and Hubain, Maurice and Mueller, Daniel J},
journal = {Journal of Microscopy},
number = {2},
pages = {125 -- 132},
publisher = {Wiley-Blackwell},
title = {{Automated alignment and pattern recognition of single-molecule force spectroscopy data}},
doi = {10.1111/j.1365-2818.2005.01478.x},
volume = {218},
year = {2005},
}
@article{3418,
abstract = {Atomic force microscopy (AFM) allows the critical forces that unfold single proteins and rupture individual receptor–ligand bonds to be measured. To derive the shape of the energy landscape, the dynamic strength of the system is probed at different force loading rates. This is usually achieved by varying the pulling speed between a few nm/s and a few mgrm/s, although for a more complete investigation of the kinetic properties higher speeds are desirable. Above 10 mgrm/s, the hydrodynamic drag force acting on the AFM cantilever reaches the same order of magnitude as the molecular forces. This has limited the maximum pulling speed in AFM single-molecule force spectroscopy experiments. Here, we present an approach for considering these hydrodynamic effects, thereby allowing a correct evaluation of AFM force measurements recorded over an extended range of pulling speeds (and thus loading rates). To support and illustrate our theoretical considerations, we experimentally evaluated the mechanical unfolding of a multi-domain protein recorded at 30 mgrm/s pulling speed.},
author = {Harald Janovjak and Struckmeier, Jens and Mueller, Daniel J},
journal = {European Biophysics Journal},
number = {1},
pages = {91 -- 96},
publisher = {Springer},
title = {{Hydrodynamic effects in fast AFM single molecule force measurements}},
doi = {10.1007/s00249-004-0430-3},
volume = {34},
year = {2005},
}
@inbook{3433,
author = {Jonathan Bollback},
booktitle = {Statistical methods in Molecular Evolution},
editor = {Nielsen, Rasmus},
pages = {439 -- 462},
publisher = {Springer},
title = {{Posterior mapping and posterior predictive distributions}},
doi = {10.1007/0-387-27733-1},
year = {2005},
}
@article{3443,
abstract = {In the hippocampal CA1 area, a relatively homogenous population of pyramidal cells is accompanied by a diversity of GABAergic interneurons. Previously, we found that parvalbumin-expressing basket, axo-axonic, bistratified, and oriens-lacunosum moleculare cells, innervating different domains of pyramidal cells, have distinct firing patterns during network oscillations in vivo. A second family of interneurons, expressing cholecystokinin but not parvalbumin, is known to target the same domains of pyramidal cells as do the parvalbumin cells. To test the temporal activity of these independent and parallel GABAergic inputs, we recorded the precise spike timing of identified cholecystokinin interneurons during hippocampal network oscillations in anesthetized rats and determined their molecular expression profiles and synaptic targets. The cells were cannabinoid receptor type 1 immunopositive. Contrary to the stereotyped firing of parvalbumin interneurons, cholecystokinin-expressing basket and dendrite-innervating cells discharge, on average, with 1.7 ± 2.0 Hz during high-frequency ripple oscillations in an episode-dependent manner. During theta oscillations, cholecystokinin- expressing interneurons fire with 8.8 ± 3.3 Hz at a characteristic time on the ascending phase of theta waves (155 ± 81°), when place cells start firing in freely moving animals. The firing patterns of some interneurons recorded in drug-free behaving rats were similar to cholecystokinin cells in anesthetized animals. Our results demonstrate that cholecystokinin- and parvalbumin-expressing interneurons make different contributions to network oscillations and play distinct roles in different brain states. We suggest that the specific spike timing of cholecystokinin interneurons and their sensitivity to endocannabinoids might contribute to differentiate subgroups of pyramidal cells forming neuronal assemblies, whereas parvalbumin interneurons contribute to synchronizing the entire network. Copyright © 2005 Society for Neuroscience.},
author = {Klausberger,Thomas and Marton,Laszlo F and Joseph O'Neill and Huck, Jojanneke H and Dalezios, Yannis and Fuentealba,Pablo and Suen, Wai Yee and Papp, Edit Cs and Kaneko, Takeshi and Watanabe, Masahiko and Jozsef Csicsvari and Somogyi, Péter},
journal = {Journal of Neuroscience},
number = {42},
pages = {9782 -- 9793},
publisher = {Society for Neuroscience},
title = {{Complementary roles of cholecystokinin- and parvalbumin-expressing GABAergic neurons in hippocampal network oscillations}},
doi = {10.1523/JNEUROSCI.3269-05.2005},
volume = {25},
year = {2005},
}
@misc{3509,
abstract = {Methods, apparatus and computer program products can generate light weight but highly realistic and accurate colored models of three-dimensional colored objects. The colored model may be generated from a second plurality of points that define a coarse digital representation of the surface and at least one texture map containing information derived from a first plurality of colored points that define a fine digital representation of the surface. This derivation is achieved by mapping points within the texture map to the fine digital representation of the three-dimensional surface. Colored scan data may be used to construct the fine digital representation as a triangulated surface (i.e., triangulation) using a wrapping operation.},
author = {Williams, Steven P and Herbert Edelsbrunner and Fu, Ping},
publisher = {Elsevier},
title = {{Methods, apparatus and computer program products for modeling three-dimensional colored objects}},
doi = {US 6,853,373 B2},
year = {2005},
}
@inproceedings{3557,
abstract = {A challenging problem in computer-aided geometric design is the decomposition of a surface into four-sided regions that are then represented by NURBS patches. There are various approaches published in the literature and implemented as commercially available software, but all fall short in either automation or quality of the result. At Raindrop Geomagic, we have recently taken a fresh approach based on concepts from Morse theory. This by itself is not a new idea, but we have some novel ingredients that make this work, one being a rational notion of hierarchy that guides the construction of a simplified decomposition sensitive to only the major critical points.},
author = {Herbert Edelsbrunner},
pages = {9 -- 11},
publisher = {ACM},
title = {{Surface tiling with differential topology}},
doi = {http://dx.doi.org/10.2312/SGP/SGP05/009-011},
year = {2005},
}