---
_id: '9146'
abstract:
- lang: eng
text: "The factors governing the rate of change in the amount of atmospheric water
vapor are analyzed in simulations of climate change. The global-mean amount of
water vapor is estimated to increase at a differential rate of 7.3% K − 1 with
respect to global-mean surface air temperature in the multi-model mean. Larger
rates of change result if the fractional change is evaluated over a finite change
in temperature (e.g., 8.2% K − 1 for a 3 K warming), and rates of change of zonal-mean
column water vapor range from 6 to 12% K − 1 depending on latitude.\r\nClausius–Clapeyron
scaling is directly evaluated using an invariant distribution of monthly-mean
relative humidity, giving a rate of 7.4% K − 1 for global-mean water vapor. There
are deviations from Clausius–Clapeyron scaling of zonal-mean column water vapor
in the tropics and mid-latitudes, but they largely cancel in the global mean.
A purely thermodynamic scaling based on a saturated troposphere gives a higher
global rate of 7.9% K − 1.\r\nSurface specific humidity increases at a rate of
5.7% K − 1, considerably lower than the rate for global-mean water vapor. Surface
specific humidity closely follows Clausius–Clapeyron scaling over ocean. But there
are widespread decreases in surface relative humidity over land (by more than
1% K − 1 in many regions), and it is argued that decreases of this magnitude could
result from the land/ocean contrast in surface warming."
article_number: '025207'
article_processing_charge: No
article_type: original
author:
- first_name: P A
full_name: O’Gorman, P A
last_name: O’Gorman
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
citation:
ama: O’Gorman PA, Muller CJ. How closely do changes in surface and column water
vapor follow Clausius–Clapeyron scaling in climate change simulations? Environmental
Research Letters. 2010;5(2). doi:10.1088/1748-9326/5/2/025207
apa: O’Gorman, P. A., & Muller, C. J. (2010). How closely do changes in surface
and column water vapor follow Clausius–Clapeyron scaling in climate change simulations?
Environmental Research Letters. IOP Publishing. https://doi.org/10.1088/1748-9326/5/2/025207
chicago: O’Gorman, P A, and Caroline J Muller. “How Closely Do Changes in Surface
and Column Water Vapor Follow Clausius–Clapeyron Scaling in Climate Change Simulations?”
Environmental Research Letters. IOP Publishing, 2010. https://doi.org/10.1088/1748-9326/5/2/025207.
ieee: P. A. O’Gorman and C. J. Muller, “How closely do changes in surface and column
water vapor follow Clausius–Clapeyron scaling in climate change simulations?,”
Environmental Research Letters, vol. 5, no. 2. IOP Publishing, 2010.
ista: O’Gorman PA, Muller CJ. 2010. How closely do changes in surface and column
water vapor follow Clausius–Clapeyron scaling in climate change simulations? Environmental
Research Letters. 5(2), 025207.
mla: O’Gorman, P. A., and Caroline J. Muller. “How Closely Do Changes in Surface
and Column Water Vapor Follow Clausius–Clapeyron Scaling in Climate Change Simulations?”
Environmental Research Letters, vol. 5, no. 2, 025207, IOP Publishing,
2010, doi:10.1088/1748-9326/5/2/025207.
short: P.A. O’Gorman, C.J. Muller, Environmental Research Letters 5 (2010).
date_created: 2021-02-15T14:40:46Z
date_published: 2010-04-09T00:00:00Z
date_updated: 2022-01-24T13:51:02Z
day: '09'
doi: 10.1088/1748-9326/5/2/025207
extern: '1'
intvolume: ' 5'
issue: '2'
keyword:
- Renewable Energy
- Sustainability and the Environment
- Public Health
- Environmental and Occupational Health
- General Environmental Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1088/1748-9326/5/2/025207
month: '04'
oa: 1
oa_version: Published Version
publication: Environmental Research Letters
publication_identifier:
issn:
- 1748-9326
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
status: public
title: How closely do changes in surface and column water vapor follow Clausius–Clapeyron
scaling in climate change simulations?
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 5
year: '2010'
...
---
_id: '920'
abstract:
- lang: eng
text: Most eukaryotic cells sense and respond to the mechanical properties of their
surroundings. This can strongly influence their collective behavior in embryonic
development, tissue function, and wound healing. We use a deformable substrate
to measure collective behavior in cell motion due to substrate mediated cell-cell
interactions. We quantify spatial and temporal correlations in migration velocity
and substrate deformation, and show that cooperative cell-driven patterns of substrate
deformation mediate long-distance mechanical coupling between cells and control
collective cell migration.
acknowledgement: "This work was supported by the NSF (DMR-0602684) and the Harvard
MRSEC (DMR-0820484).\r\nWe would like to thank Dr. James Butler for helpful conversations."
article_processing_charge: No
author:
- first_name: Thomas
full_name: Angelini, Thomas
last_name: Angelini
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Xavier
full_name: Trepat, Xavier
last_name: Trepat
- first_name: Jeffrey
full_name: Fredberg, Jeffrey
last_name: Fredberg
- first_name: David
full_name: Weitz, David
last_name: Weitz
citation:
ama: Angelini T, Hannezo EB, Trepat X, Fredberg J, Weitz D. Cell migration driven
by cooperative substrate deformation patterns. Physical Review Letters.
2010;104(16). doi:10.1103/PhysRevLett.104.168104
apa: Angelini, T., Hannezo, E. B., Trepat, X., Fredberg, J., & Weitz, D. (2010).
Cell migration driven by cooperative substrate deformation patterns. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.104.168104
chicago: Angelini, Thomas, Edouard B Hannezo, Xavier Trepat, Jeffrey Fredberg, and
David Weitz. “Cell Migration Driven by Cooperative Substrate Deformation Patterns.”
Physical Review Letters. American Physical Society, 2010. https://doi.org/10.1103/PhysRevLett.104.168104.
ieee: T. Angelini, E. B. Hannezo, X. Trepat, J. Fredberg, and D. Weitz, “Cell migration
driven by cooperative substrate deformation patterns,” Physical Review Letters,
vol. 104, no. 16. American Physical Society, 2010.
ista: Angelini T, Hannezo EB, Trepat X, Fredberg J, Weitz D. 2010. Cell migration
driven by cooperative substrate deformation patterns. Physical Review Letters.
104(16).
mla: Angelini, Thomas, et al. “Cell Migration Driven by Cooperative Substrate Deformation
Patterns.” Physical Review Letters, vol. 104, no. 16, American Physical
Society, 2010, doi:10.1103/PhysRevLett.104.168104.
short: T. Angelini, E.B. Hannezo, X. Trepat, J. Fredberg, D. Weitz, Physical Review
Letters 104 (2010).
date_created: 2018-12-11T11:49:12Z
date_published: 2010-04-23T00:00:00Z
date_updated: 2021-01-12T08:21:55Z
day: '23'
doi: 10.1103/PhysRevLett.104.168104
extern: '1'
intvolume: ' 104'
issue: '16'
language:
- iso: eng
month: '04'
oa_version: None
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '6523'
status: public
title: Cell migration driven by cooperative substrate deformation patterns
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2010'
...
---
_id: '9452'
abstract:
- lang: eng
text: Eukaryotic cytosine methylation represses transcription but also occurs in
the bodies of active genes, and the extent of methylation biology conservation
is unclear. We quantified DNA methylation in 17 eukaryotic genomes and found that
gene body methylation is conserved between plants and animals, whereas selective
methylation of transposons is not. We show that methylation of plant transposons
in the CHG context extends to green algae and that exclusion of histone H2A.Z
from methylated DNA is conserved between plants and animals, and we present evidence
for RNA-directed DNA methylation of fungal genes. Our data demonstrate that extant
DNA methylation systems are mosaics of conserved and derived features, and indicate
that gene body methylation is an ancient property of eukaryotic genomes.
article_processing_charge: No
article_type: original
author:
- first_name: 'Assaf '
full_name: 'Zemach, Assaf '
last_name: Zemach
- first_name: Ivy E.
full_name: McDaniel, Ivy E.
last_name: McDaniel
- first_name: Pedro
full_name: Silva, Pedro
last_name: Silva
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zemach A, McDaniel IE, Silva P, Zilberman D. Genome-wide evolutionary analysis
of eukaryotic DNA methylation. Science. 2010;328(5980):916-919. doi:10.1126/science.1186366
apa: Zemach, A., McDaniel, I. E., Silva, P., & Zilberman, D. (2010). Genome-wide
evolutionary analysis of eukaryotic DNA methylation. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.1186366
chicago: Zemach, Assaf , Ivy E. McDaniel, Pedro Silva, and Daniel Zilberman. “Genome-Wide
Evolutionary Analysis of Eukaryotic DNA Methylation.” Science. American
Association for the Advancement of Science, 2010. https://doi.org/10.1126/science.1186366.
ieee: A. Zemach, I. E. McDaniel, P. Silva, and D. Zilberman, “Genome-wide evolutionary
analysis of eukaryotic DNA methylation,” Science, vol. 328, no. 5980. American
Association for the Advancement of Science, pp. 916–919, 2010.
ista: Zemach A, McDaniel IE, Silva P, Zilberman D. 2010. Genome-wide evolutionary
analysis of eukaryotic DNA methylation. Science. 328(5980), 916–919.
mla: Zemach, Assaf, et al. “Genome-Wide Evolutionary Analysis of Eukaryotic DNA
Methylation.” Science, vol. 328, no. 5980, American Association for the
Advancement of Science, 2010, pp. 916–19, doi:10.1126/science.1186366.
short: A. Zemach, I.E. McDaniel, P. Silva, D. Zilberman, Science 328 (2010) 916–919.
date_created: 2021-06-04T08:26:08Z
date_published: 2010-05-14T00:00:00Z
date_updated: 2021-12-14T08:35:37Z
day: '14'
department:
- _id: DaZi
doi: 10.1126/science.1186366
extern: '1'
external_id:
pmid:
- '20395474 '
intvolume: ' 328'
issue: '5980'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '05'
oa_version: None
page: 916-919
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genome-wide evolutionary analysis of eukaryotic DNA methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 328
year: '2010'
...
---
_id: '9485'
abstract:
- lang: eng
text: 'Cytosine methylation silences transposable elements in plants, vertebrates,
and fungi but also regulates gene expression. Plant methylation is catalyzed by
three families of enzymes, each with a preferred sequence context: CG, CHG (H
= A, C, or T), and CHH, with CHH methylation targeted by the RNAi pathway. Arabidopsis
thaliana endosperm, a placenta-like tissue that nourishes the embryo, is globally
hypomethylated in the CG context while retaining high non-CG methylation. Global
methylation dynamics in seeds of cereal crops that provide the bulk of human nutrition
remain unknown. Here, we show that rice endosperm DNA is hypomethylated in all
sequence contexts. Non-CG methylation is reduced evenly across the genome, whereas
CG hypomethylation is localized. CHH methylation of small transposable elements
is increased in embryos, suggesting that endosperm demethylation enhances transposon
silencing. Genes preferentially expressed in endosperm, including those coding
for major storage proteins and starch synthesizing enzymes, are frequently hypomethylated
in endosperm, indicating that DNA methylation is a crucial regulator of rice endosperm
biogenesis. Our data show that genome-wide reshaping of seed DNA methylation is
conserved among angiosperms and has a profound effect on gene expression in cereal
crops.'
article_processing_charge: No
article_type: original
author:
- first_name: Assaf
full_name: Zemach, Assaf
last_name: Zemach
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Pedro
full_name: Silva, Pedro
last_name: Silva
- first_name: Jessica A.
full_name: Rodrigues, Jessica A.
last_name: Rodrigues
- first_name: Bradley
full_name: Dotson, Bradley
last_name: Dotson
- first_name: Matthew D.
full_name: Brooks, Matthew D.
last_name: Brooks
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zemach A, Kim MY, Silva P, et al. Local DNA hypomethylation activates genes
in rice endosperm. Proceedings of the National Academy of Sciences. 2010;107(43):18729-18734.
doi:10.1073/pnas.1009695107
apa: Zemach, A., Kim, M. Y., Silva, P., Rodrigues, J. A., Dotson, B., Brooks, M.
D., & Zilberman, D. (2010). Local DNA hypomethylation activates genes in rice
endosperm. Proceedings of the National Academy of Sciences. National Academy
of Sciences. https://doi.org/10.1073/pnas.1009695107
chicago: Zemach, Assaf, M. Yvonne Kim, Pedro Silva, Jessica A. Rodrigues, Bradley
Dotson, Matthew D. Brooks, and Daniel Zilberman. “Local DNA Hypomethylation Activates
Genes in Rice Endosperm.” Proceedings of the National Academy of Sciences.
National Academy of Sciences, 2010. https://doi.org/10.1073/pnas.1009695107.
ieee: A. Zemach et al., “Local DNA hypomethylation activates genes in rice
endosperm,” Proceedings of the National Academy of Sciences, vol. 107,
no. 43. National Academy of Sciences, pp. 18729–18734, 2010.
ista: Zemach A, Kim MY, Silva P, Rodrigues JA, Dotson B, Brooks MD, Zilberman D.
2010. Local DNA hypomethylation activates genes in rice endosperm. Proceedings
of the National Academy of Sciences. 107(43), 18729–18734.
mla: Zemach, Assaf, et al. “Local DNA Hypomethylation Activates Genes in Rice Endosperm.”
Proceedings of the National Academy of Sciences, vol. 107, no. 43, National
Academy of Sciences, 2010, pp. 18729–34, doi:10.1073/pnas.1009695107.
short: A. Zemach, M.Y. Kim, P. Silva, J.A. Rodrigues, B. Dotson, M.D. Brooks, D.
Zilberman, Proceedings of the National Academy of Sciences 107 (2010) 18729–18734.
date_created: 2021-06-07T09:31:01Z
date_published: 2010-10-26T00:00:00Z
date_updated: 2021-12-14T08:40:02Z
day: '26'
department:
- _id: DaZi
doi: 10.1073/pnas.1009695107
extern: '1'
external_id:
pmid:
- '20937895'
intvolume: ' 107'
issue: '43'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1009695107
month: '10'
oa: 1
oa_version: Published Version
page: 18729-18734
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local DNA hypomethylation activates genes in rice endosperm
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 107
year: '2010'
...
---
_id: '9489'
abstract:
- lang: eng
text: Cytosine methylation is an ancient process with conserved enzymology but diverse
biological functions that include defense against transposable elements and regulation
of gene expression. Here we will discuss the evolution and biological significance
of eukaryotic DNA methylation, the likely drivers of that evolution, and major
remaining mysteries.
article_processing_charge: No
article_type: review
author:
- first_name: Assaf
full_name: Zemach, Assaf
last_name: Zemach
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zemach A, Zilberman D. Evolution of eukaryotic DNA methylation and the pursuit
of safer sex. Current Biology. 2010;20(17):R780-R785. doi:10.1016/j.cub.2010.07.007
apa: Zemach, A., & Zilberman, D. (2010). Evolution of eukaryotic DNA methylation
and the pursuit of safer sex. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2010.07.007
chicago: Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation
and the Pursuit of Safer Sex.” Current Biology. Elsevier, 2010. https://doi.org/10.1016/j.cub.2010.07.007.
ieee: A. Zemach and D. Zilberman, “Evolution of eukaryotic DNA methylation and the
pursuit of safer sex,” Current Biology, vol. 20, no. 17. Elsevier, pp.
R780–R785, 2010.
ista: Zemach A, Zilberman D. 2010. Evolution of eukaryotic DNA methylation and the
pursuit of safer sex. Current Biology. 20(17), R780–R785.
mla: Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation
and the Pursuit of Safer Sex.” Current Biology, vol. 20, no. 17, Elsevier,
2010, pp. R780–85, doi:10.1016/j.cub.2010.07.007.
short: A. Zemach, D. Zilberman, Current Biology 20 (2010) R780–R785.
date_created: 2021-06-07T09:45:27Z
date_published: 2010-09-14T00:00:00Z
date_updated: 2021-12-14T08:52:34Z
day: '14'
department:
- _id: DaZi
doi: 10.1016/j.cub.2010.07.007
extern: '1'
external_id:
pmid:
- '20833323'
intvolume: ' 20'
issue: '17'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cub.2010.07.007
month: '09'
oa: 1
oa_version: Published Version
page: R780-R785
pmid: 1
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution of eukaryotic DNA methylation and the pursuit of safer sex
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 20
year: '2010'
...
---
_id: '9764'
article_processing_charge: No
author:
- first_name: Ulises
full_name: Rosas, Ulises
last_name: Rosas
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Lucy
full_name: Copsey, Lucy
last_name: Copsey
- first_name: Pierre
full_name: Barbier De Reuille, Pierre
last_name: Barbier De Reuille
- first_name: Enrico
full_name: Coen, Enrico
last_name: Coen
citation:
ama: Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. Heterosis and the
drift load. 2010. doi:10.1371/journal.pbio.1000429.s003
apa: Rosas, U., Barton, N. H., Copsey, L., Barbier De Reuille, P., & Coen, E.
(2010). Heterosis and the drift load. Public Library of Science. https://doi.org/10.1371/journal.pbio.1000429.s003
chicago: Rosas, Ulises, Nicholas H Barton, Lucy Copsey, Pierre Barbier De Reuille,
and Enrico Coen. “Heterosis and the Drift Load.” Public Library of Science, 2010.
https://doi.org/10.1371/journal.pbio.1000429.s003.
ieee: U. Rosas, N. H. Barton, L. Copsey, P. Barbier De Reuille, and E. Coen, “Heterosis
and the drift load.” Public Library of Science, 2010.
ista: Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. 2010. Heterosis
and the drift load, Public Library of Science, 10.1371/journal.pbio.1000429.s003.
mla: Rosas, Ulises, et al. Heterosis and the Drift Load. Public Library of
Science, 2010, doi:10.1371/journal.pbio.1000429.s003.
short: U. Rosas, N.H. Barton, L. Copsey, P. Barbier De Reuille, E. Coen, (2010).
date_created: 2021-08-02T09:45:39Z
date_published: 2010-07-20T00:00:00Z
date_updated: 2025-09-30T09:42:52Z
day: '20'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.1000429.s003
month: '07'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '3779'
relation: used_in_publication
status: public
status: public
title: Heterosis and the drift load
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2010'
...
---
_id: '7078'
abstract:
- lang: eng
text: We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction,
magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy
measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate
that our Bridgman-grown single crystals have a p-type carrier concentration of
3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3.
Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K,
the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature
of 294 K. For each sample type, three-terminal capacitive dilatometry measurements
detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on
SnTe show elastic hardening near the structural transition, pointing to co-elastic
behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening,
pointing to ferroelastic behavior. Effective Debye temperature, θD, values of
SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the
range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In
addition, a precursor softening extending over approximately 100 K anticipates
this collapse at the critical temperature and quantitative analysis over three
decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02,
a value indicating a three-dimensional softening of phonon branches at a temperature
T0∼75 K, considerably below Tc. We suggest that the differences in these two types
of elastic behaviors lie in the absence of elastic domain-wall motion in the one
case and their nucleation in the other.
article_number: '184112'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: E. K. H.
full_name: Salje, E. K. H.
last_name: Salje
- first_name: D. J.
full_name: Safarik, D. J.
last_name: Safarik
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: J. E.
full_name: Gubernatis, J. E.
last_name: Gubernatis
- first_name: J. C.
full_name: Cooley, J. C.
last_name: Cooley
- first_name: R. D.
full_name: Taylor, R. D.
last_name: Taylor
- first_name: B.
full_name: Mihaila, B.
last_name: Mihaila
- first_name: A.
full_name: Saxena, A.
last_name: Saxena
- first_name: T.
full_name: Lookman, T.
last_name: Lookman
- first_name: J. L.
full_name: Smith, J. L.
last_name: Smith
- first_name: R. A.
full_name: Fisher, R. A.
last_name: Fisher
- first_name: M.
full_name: Pasternak, M.
last_name: Pasternak
- first_name: C. P.
full_name: Opeil, C. P.
last_name: Opeil
- first_name: T.
full_name: Siegrist, T.
last_name: Siegrist
- first_name: P. B.
full_name: Littlewood, P. B.
last_name: Littlewood
- first_name: J. C.
full_name: Lashley, J. C.
last_name: Lashley
citation:
ama: 'Salje EKH, Safarik DJ, Modic KA, et al. Tin telluride: A weakly co-elastic
metal. Physical Review B. 2010;82(18). doi:10.1103/physrevb.82.184112'
apa: 'Salje, E. K. H., Safarik, D. J., Modic, K. A., Gubernatis, J. E., Cooley,
J. C., Taylor, R. D., … Lashley, J. C. (2010). Tin telluride: A weakly co-elastic
metal. Physical Review B. APS. https://doi.org/10.1103/physrevb.82.184112'
chicago: 'Salje, E. K. H., D. J. Safarik, Kimberly A Modic, J. E. Gubernatis, J.
C. Cooley, R. D. Taylor, B. Mihaila, et al. “Tin Telluride: A Weakly Co-Elastic
Metal.” Physical Review B. APS, 2010. https://doi.org/10.1103/physrevb.82.184112.'
ieee: 'E. K. H. Salje et al., “Tin telluride: A weakly co-elastic metal,”
Physical Review B, vol. 82, no. 18. APS, 2010.'
ista: 'Salje EKH, Safarik DJ, Modic KA, Gubernatis JE, Cooley JC, Taylor RD, Mihaila
B, Saxena A, Lookman T, Smith JL, Fisher RA, Pasternak M, Opeil CP, Siegrist T,
Littlewood PB, Lashley JC. 2010. Tin telluride: A weakly co-elastic metal. Physical
Review B. 82(18), 184112.'
mla: 'Salje, E. K. H., et al. “Tin Telluride: A Weakly Co-Elastic Metal.” Physical
Review B, vol. 82, no. 18, 184112, APS, 2010, doi:10.1103/physrevb.82.184112.'
short: E.K.H. Salje, D.J. Safarik, K.A. Modic, J.E. Gubernatis, J.C. Cooley, R.D.
Taylor, B. Mihaila, A. Saxena, T. Lookman, J.L. Smith, R.A. Fisher, M. Pasternak,
C.P. Opeil, T. Siegrist, P.B. Littlewood, J.C. Lashley, Physical Review B 82 (2010).
date_created: 2019-11-19T13:46:28Z
date_published: 2010-11-18T00:00:00Z
date_updated: 2021-01-12T08:11:44Z
day: '18'
doi: 10.1103/physrevb.82.184112
extern: '1'
external_id:
arxiv:
- '1011.1445'
intvolume: ' 82'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1011.1445
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
issn:
- 1098-0121
- 1550-235X
publication_status: published
publisher: APS
quality_controlled: '1'
status: public
title: 'Tin telluride: A weakly co-elastic metal'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2010'
...
---
_id: '7079'
abstract:
- lang: eng
text: We have observed that reacting Pb:Te:Ag:Se in a 1:1:1.9:1 molar ratio gives
rise to what appears to be a predominantly single-phase alloy, which crystallizes
in the PbSe cF8 fcc structure. However, further investigation of the structure
using energy dispersive x-ray analysis reveals the presence of two phases, PbSe
and β-Ag2Te, with identical lattice parameters. The total thermal conductivity
of the formed alloy is remarkably low for a crystalline material, κT<0.6W∕mK at
675K, it is reproducible, and in addition, the compound has good mechanical properties.
article_number: '033519'
article_processing_charge: No
article_type: original
author:
- first_name: Fivos R.
full_name: Drymiotis, Fivos R.
last_name: Drymiotis
- first_name: Tyler B.
full_name: Drye, Tyler B.
last_name: Drye
- first_name: Yisha
full_name: Wang, Yisha
last_name: Wang
- first_name: Jian
full_name: He, Jian
last_name: He
- first_name: Daniel
full_name: Rhodes, Daniel
last_name: Rhodes
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Samantha
full_name: Cawthorne, Samantha
last_name: Cawthorne
- first_name: Qiu Run
full_name: Zhang, Qiu Run
last_name: Zhang
citation:
ama: Drymiotis FR, Drye TB, Wang Y, et al. Structure formation and very low thermal
conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. 2010;107(3).
doi:10.1063/1.3284946
apa: Drymiotis, F. R., Drye, T. B., Wang, Y., He, J., Rhodes, D., Modic, K. A.,
… Zhang, Q. R. (2010). Structure formation and very low thermal conductivity in
Pb:Te:Ag:Se mixtures. Journal of Applied Physics. AIP. https://doi.org/10.1063/1.3284946
chicago: Drymiotis, Fivos R., Tyler B. Drye, Yisha Wang, Jian He, Daniel Rhodes,
Kimberly A Modic, Samantha Cawthorne, and Qiu Run Zhang. “Structure Formation
and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” Journal of Applied
Physics. AIP, 2010. https://doi.org/10.1063/1.3284946.
ieee: F. R. Drymiotis et al., “Structure formation and very low thermal conductivity
in Pb:Te:Ag:Se mixtures,” Journal of Applied Physics, vol. 107, no. 3.
AIP, 2010.
ista: Drymiotis FR, Drye TB, Wang Y, He J, Rhodes D, Modic KA, Cawthorne S, Zhang
QR. 2010. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se
mixtures. Journal of Applied Physics. 107(3), 033519.
mla: Drymiotis, Fivos R., et al. “Structure Formation and Very Low Thermal Conductivity
in Pb:Te:Ag:Se Mixtures.” Journal of Applied Physics, vol. 107, no. 3,
033519, AIP, 2010, doi:10.1063/1.3284946.
short: F.R. Drymiotis, T.B. Drye, Y. Wang, J. He, D. Rhodes, K.A. Modic, S. Cawthorne,
Q.R. Zhang, Journal of Applied Physics 107 (2010).
date_created: 2019-11-19T13:47:24Z
date_published: 2010-02-09T00:00:00Z
date_updated: 2021-01-12T08:11:44Z
day: '09'
doi: 10.1063/1.3284946
extern: '1'
intvolume: ' 107'
issue: '3'
language:
- iso: eng
month: '02'
oa_version: None
publication: Journal of Applied Physics
publication_identifier:
issn:
- 0021-8979
- 1089-7550
publication_status: published
publisher: AIP
quality_controlled: '1'
status: public
title: Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 107
year: '2010'
...
---
_id: '7318'
abstract:
- lang: eng
text: The decomposition reaction of H2O2 aqueous solutions (H2O2 - H2O + 1/2O2)
catalyzed by transition metal oxide powders has been compared with the charging
voltage of nonaqueous Li-O2 cells containing the same catalyst. An inverse linear
relationship between Ln k (rate constant for the H2O2 decomposition) and the charging
voltage has been found, despite differences in media and possible mechanistic
differences. The results suggest that the decomposition may be a reliable, useful,
and fast screening tool for materials that promote the charging process of the
Li-O2 battery and may ultimately give insight into the charging mechanism.
article_number: A180
article_processing_charge: No
article_type: letter_note
author:
- first_name: V.
full_name: Giordani, V.
last_name: Giordani
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: P. G.
full_name: Bruce, P. G.
last_name: Bruce
- first_name: J.-M.
full_name: Tarascon, J.-M.
last_name: Tarascon
- first_name: D.
full_name: Larcher, D.
last_name: Larcher
citation:
ama: Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. H2O2 decomposition
reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and
Solid-State Letters. 2010;13(12). doi:10.1149/1.3494045
apa: Giordani, V., Freunberger, S. A., Bruce, P. G., Tarascon, J.-M., & Larcher,
D. (2010). H2O2 decomposition reaction as selecting tool for catalysts in Li–O2
cells. Electrochemical and Solid-State Letters. The Electrochemical Society.
https://doi.org/10.1149/1.3494045
chicago: Giordani, V., Stefan Alexander Freunberger, P. G. Bruce, J.-M. Tarascon,
and D. Larcher. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in
Li–O2 Cells.” Electrochemical and Solid-State Letters. The Electrochemical
Society, 2010. https://doi.org/10.1149/1.3494045.
ieee: V. Giordani, S. A. Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher,
“H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells,”
Electrochemical and Solid-State Letters, vol. 13, no. 12. The Electrochemical
Society, 2010.
ista: Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. 2010. H2O2
decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical
and Solid-State Letters. 13(12), A180.
mla: Giordani, V., et al. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts
in Li–O2 Cells.” Electrochemical and Solid-State Letters, vol. 13, no.
12, A180, The Electrochemical Society, 2010, doi:10.1149/1.3494045.
short: V. Giordani, S.A. Freunberger, P.G. Bruce, J.-M. Tarascon, D. Larcher, Electrochemical
and Solid-State Letters 13 (2010).
date_created: 2020-01-15T12:21:06Z
date_published: 2010-10-04T00:00:00Z
date_updated: 2021-01-12T08:13:01Z
day: '04'
doi: 10.1149/1.3494045
extern: '1'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
month: '10'
oa_version: None
publication: Electrochemical and Solid-State Letters
publication_identifier:
issn:
- 1099-0062
publication_status: published
publisher: The Electrochemical Society
quality_controlled: '1'
status: public
title: H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2010'
...
---
_id: '754'
abstract:
- lang: eng
text: 'Most people believe that renaming is easy: simply choose a name at random;
if more than one process selects the same name, then try again. We highlight the
issues that occur when trying to implement such a scheme and shed new light on
the read-write complexity of randomized renaming in an asynchronous environment.
At the heart of our new perspective stands an adaptive implementation of a randomized
test-and-set object, that has poly-logarithmic step complexity per operation,
with high probability. Interestingly, our implementation is anonymous, as it does
not require process identifiers. Based on this implementation, we present two
new randomized renaming algorithms. The first ensures a tight namespace of n names
using O( n log4 n) total steps, with high probability. This significantly improves
on the complexity of the best previously known namespace-optimal algorithms. The
second algorithm achieves a namespace of size k (1 + ε) using O( k log4 k / log2
(1 + ε) ) total steps, both with high probability, where k is the total contention
in the execution. It is the first adaptive randomized renaming algorithm, and
it improves on existing deterministic solutions by providing a smaller namespace,
and by lowering step complexity.'
acknowledgement: The work of Dan Alistarh is supported by the Swiss NCCR MICS project.
The work of Hagit Attiya is supported in part by the Israel Science Foundation (grant
number 953/06).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Hagit
full_name: Attiya, Hagit
last_name: Attiya
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Andrei
full_name: Giurgiu, Andrei
last_name: Giurgiu
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
citation:
ama: 'Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. Fast randomized
test-and-set and renaming. In: Vol 6343 LNCS. Springer; 2010:94-108. doi:10.1007/978-3-642-15763-9_9'
apa: 'Alistarh, D.-A., Attiya, H., Gilbert, S., Giurgiu, A., & Guerraoui, R.
(2010). Fast randomized test-and-set and renaming (Vol. 6343 LNCS, pp. 94–108).
Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-15763-9_9'
chicago: Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid
Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer,
2010. https://doi.org/10.1007/978-3-642-15763-9_9.
ieee: 'D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast
randomized test-and-set and renaming,” presented at the DISC: Distributed Computing,
2010, vol. 6343 LNCS, pp. 94–108.'
ista: 'Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. 2010. Fast randomized
test-and-set and renaming. DISC: Distributed Computing, LNCS, vol. 6343 LNCS,
94–108.'
mla: Alistarh, Dan-Adrian, et al. Fast Randomized Test-and-Set and Renaming.
Vol. 6343 LNCS, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-15763-9_9.
short: D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, R. Guerraoui, in:, Springer,
2010, pp. 94–108.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:19Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:21Z
day: '01'
doi: 10.1007/978-3-642-15763-9_9
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 94 - 108
publication_status: published
publisher: Springer
publist_id: '6900'
status: public
title: Fast randomized test-and-set and renaming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6343 LNCS
year: '2010'
...
---
_id: '755'
abstract:
- lang: eng
text: 'Gossip, also known as epidemic dissemination, is becoming an increasingly
popular technique in distributed systems. Yet, it has remained a partially open
question: how robust are such protocols? We consider a natural extension of the
random phone-call model (introduced by Karp et al. [1]), and we analyze two different
notions of robustness: the ability to tolerate adaptive failures, and the ability
to tolerate oblivious failures. For adaptive failures, we present a new gossip
protocol, TrickleGossip, which achieves near-optimal O(n log 3 n) message complexity.
To the best of our knowledge, this is the first epidemic-style protocol that can
tolerate adaptive failures. We also show a direct relation between resilience
and message complexity, demonstrating that gossip protocols which tolerate a large
number of adaptive failures need to use a super-linear number of messages with
high probability. For oblivious failures, we present a new gossip protocol, CoordinatedGossip,
that achieves optimal O(n) message complexity. This protocol makes novel use of
the universe reduction technique to limit the message complexity.'
acknowledgement: We would like to thank Prof. Hagit Attiya and the anonymous reviewers
for their useful comments on earlier drafts of this paper.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Morteza
full_name: Zadimoghaddam, Morteza
last_name: Zadimoghaddam
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. How efficient can gossip
be? (On the cost of resilient information exchange). In: Vol 6199 LNCS. Springer;
2010:115-126. doi:10.1007/978-3-642-14162-1_10'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Zadimoghaddam, M. (2010).
How efficient can gossip be? (On the cost of resilient information exchange) (Vol.
6199 LNCS, pp. 115–126). Presented at the ICALP: International Colloquium on Automota,
Languages and Programming, Springer. https://doi.org/10.1007/978-3-642-14162-1_10'
chicago: Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam.
“How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),”
6199 LNCS:115–26. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_10.
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient
can gossip be? (On the cost of resilient information exchange),” presented at
the ICALP: International Colloquium on Automota, Languages and Programming, 2010,
vol. 6199 LNCS, no. PART 2, pp. 115–126.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. 2010. How efficient
can gossip be? (On the cost of resilient information exchange). ICALP: International
Colloquium on Automota, Languages and Programming, LNCS, vol. 6199 LNCS, 115–126.'
mla: Alistarh, Dan-Adrian, et al. How Efficient Can Gossip Be? (On the Cost of
Resilient Information Exchange). Vol. 6199 LNCS, no. PART 2, Springer, 2010,
pp. 115–26, doi:10.1007/978-3-642-14162-1_10.
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, in:, Springer,
2010, pp. 115–126.
conference:
name: 'ICALP: International Colloquium on Automota, Languages and Programming'
date_created: 2018-12-11T11:48:20Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:40Z
day: '01'
doi: 10.1007/978-3-642-14162-1_10
extern: '1'
issue: PART 2
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 126
publication_status: published
publisher: Springer
publist_id: '6901'
status: public
title: How efficient can gossip be? (On the cost of resilient information exchange)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6199 LNCS
year: '2010'
...
---
_id: '756'
abstract:
- lang: eng
text: This paper studies non-cryptographic authenticated broadcast in radio networks
subject to malicious failures. We introduce two protocols that address this problem.
The first, NeighborWatchRB, makes use of a novel strategy in which honest devices
monitor their neighbors for malicious behavior. Second, we present a more robust
variant, MultiPathRB, that tolerates the maximum possible density of malicious
devices per region, using an elaborate voting strategy. We also introduce a new
proof technique to show that both protocols ensure asymptotically optimal running
time. We demonstrate the fault tolerance of our protocols through extensive simulation.
Simulations show the practical superiority of the NeighborWatchRB protocol (an
advantage hidden in the constants of the asymptotic complexity). The NeighborWatchRB
protocol even performs relatively well when compared to the simple, fast epidemic
protocols commonly used in the radio setting, protocols that tolerate no malicious
faults. We therefore believe that the overhead for ensuring authenticated broadcast
is reasonable, especially in applications that use authenticated broadcast only
when necessary, such as distributing an authenticated digest.
acknowledgement: "The authors would like to thank Prof. Guevara Noubir for his useful
comments on earlier\r\ndrafts of this paper."
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Žarko
full_name: Milošević, Žarko
last_name: Milošević
- first_name: Calvin
full_name: Newport, Calvin
last_name: Newport
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. Securing every
bit: Authenticated broadcast in radio networks. In: ACM; 2010:50-59. doi:10.1145/1810479.1810489'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., Milošević, Ž., & Newport,
C. (2010). Securing every bit: Authenticated broadcast in radio networks (pp.
50–59). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures,
ACM. https://doi.org/10.1145/1810479.1810489'
chicago: 'Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, Žarko Milošević,
and Calvin Newport. “Securing Every Bit: Authenticated Broadcast in Radio Networks,”
50–59. ACM, 2010. https://doi.org/10.1145/1810479.1810489.'
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, and C. Newport, “Securing
every bit: Authenticated broadcast in radio networks,” presented at the SPAA:
Symposium on Parallelism in Algorithms and Architectures, 2010, pp. 50–59.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. 2010. Securing
every bit: Authenticated broadcast in radio networks. SPAA: Symposium on Parallelism
in Algorithms and Architectures, 50–59.'
mla: 'Alistarh, Dan-Adrian, et al. Securing Every Bit: Authenticated Broadcast
in Radio Networks. ACM, 2010, pp. 50–59, doi:10.1145/1810479.1810489.'
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, C. Newport, in:,
ACM, 2010, pp. 50–59.
conference:
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
date_created: 2018-12-11T11:48:20Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:56Z
day: '01'
doi: 10.1145/1810479.1810489
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 59
publication_status: published
publisher: ACM
publist_id: '6902'
status: public
title: 'Securing every bit: Authenticated broadcast in radio networks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '3146'
abstract:
- lang: eng
text: 'Coordinated migration of newly born neurons to their prospective target laminae
is a prerequisite for neural circuit assembly in the developing brain. The evolutionarily
conserved LIS1/NDEL1 complex is essential for neuronal migration in the mammalian
cerebral cortex. The cytoplasmic nature of LIS1 and NDEL1 proteins suggest that
they regulate neuronal migration cell autonomously. Here, we extend mosaic analysis
with double markers (MADM) to mouse chromosome 11 where Lis1, Ndel1, and 14-3-3e{open}
(encoding a LIS1/NDEL1 signaling partner) are located. Analyses of sparse and
uniquely labeled mutant cells in mosaic animals reveal distinct cell-autonomous
functions for these three genes. Lis1 regulates neuronal migration efficiency
in a dose-dependent manner, while Ndel1 is essential for a specific, previously
uncharacterized, late step of neuronal migration: entry into the target lamina.
Comparisons with previous genetic perturbations of Lis1 and Ndel1 also suggest
a surprising degree of cell-nonautonomous function for these proteins in regulating
neuronal migration.'
author:
- first_name: Simon
full_name: Simon Hippenmeyer
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Yong
full_name: Youn, Yong H
last_name: Youn
- first_name: Hyang
full_name: Moon, Hyang M
last_name: Moon
- first_name: Kazunari
full_name: Miyamichi, Kazunari
last_name: Miyamichi
- first_name: Hui
full_name: Zong, Hui
last_name: Zong
- first_name: Anthony
full_name: Wynshaw-Boris, Anthony
last_name: Wynshaw Boris
- first_name: Liqun
full_name: Luo, Liqun
last_name: Luo
citation:
ama: Hippenmeyer S, Youn Y, Moon H, et al. Genetic mosaic dissection of Lis1 and
Ndel1 in neuronal migration. Neuron. 2010;68(4):695-709. doi:10.1016/j.neuron.2010.09.027
apa: Hippenmeyer, S., Youn, Y., Moon, H., Miyamichi, K., Zong, H., Wynshaw Boris,
A., & Luo, L. (2010). Genetic mosaic dissection of Lis1 and Ndel1 in neuronal
migration. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2010.09.027
chicago: Hippenmeyer, Simon, Yong Youn, Hyang Moon, Kazunari Miyamichi, Hui Zong,
Anthony Wynshaw Boris, and Liqun Luo. “Genetic Mosaic Dissection of Lis1 and Ndel1
in Neuronal Migration.” Neuron. Elsevier, 2010. https://doi.org/10.1016/j.neuron.2010.09.027.
ieee: S. Hippenmeyer et al., “Genetic mosaic dissection of Lis1 and Ndel1
in neuronal migration,” Neuron, vol. 68, no. 4. Elsevier, pp. 695–709,
2010.
ista: Hippenmeyer S, Youn Y, Moon H, Miyamichi K, Zong H, Wynshaw Boris A, Luo L.
2010. Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration. Neuron.
68(4), 695–709.
mla: Hippenmeyer, Simon, et al. “Genetic Mosaic Dissection of Lis1 and Ndel1 in
Neuronal Migration.” Neuron, vol. 68, no. 4, Elsevier, 2010, pp. 695–709,
doi:10.1016/j.neuron.2010.09.027.
short: S. Hippenmeyer, Y. Youn, H. Moon, K. Miyamichi, H. Zong, A. Wynshaw Boris,
L. Luo, Neuron 68 (2010) 695–709.
date_created: 2018-12-11T12:01:39Z
date_published: 2010-11-18T00:00:00Z
date_updated: 2021-01-12T07:41:22Z
day: '18'
doi: 10.1016/j.neuron.2010.09.027
extern: 1
intvolume: ' 68'
issue: '4'
month: '11'
page: 695 - 709
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '3550'
quality_controlled: 0
status: public
title: Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration
type: journal_article
volume: 68
year: '2010'
...
---
_id: '3153'
abstract:
- lang: eng
text: Human immune cells have to penetrate an endothelial barrier during their beneficial
pursuit of infection and their destructive infiltration of tissues in autoimmune
diseases. This transmigration requires Rap1 GTPase to activate integrin affinity.
We define a new model system for this process by demonstrating, with live imaging
and genetics, that during embryonic development Drosophila melanogaster immune
cells penetrate an epithelial, Drosophila E-cadherin (DE-cadherin)-based tissue
barrier. A mutant in RhoL, a GTPase homologue that is specifically expressed in
haemocytes, blocks this invasive step but not other aspects of guided migration.
RhoL mediates integrin adhesion caused by Drosophila Rap1 overexpression and moves
Rap1 away from a concentration in the cytoplasm to the leading edge during invasive
migration. These findings indicate that a programmed migratory step during Drosophila
development bears striking molecular similarities to vertebrate immune cell transmigration
during inflammation, and identify RhoL as a new regulator of invasion, adhesion
and Rap1 localization. Our work establishes the utility of Drosophila for identifying
novel components of immune cell transmigration and for understanding the in vivo
interplay of immune cells with the barriers they penetrate.
author:
- first_name: Daria E
full_name: Daria Siekhaus
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Martin
full_name: Haesemeyer, Martin
last_name: Haesemeyer
- first_name: Olivia
full_name: Moffitt, Olivia
last_name: Moffitt
- first_name: Ruth
full_name: Lehmann, Ruth
last_name: Lehmann
citation:
ama: Siekhaus DE, Haesemeyer M, Moffitt O, Lehmann R. RhoL controls invasion and
Rap1 localization during immune cell transmigration in Drosophila. Nature Cell
Biology. 2010;12(6):605-610.
apa: Siekhaus, D. E., Haesemeyer, M., Moffitt, O., & Lehmann, R. (2010). RhoL
controls invasion and Rap1 localization during immune cell transmigration in Drosophila.
Nature Cell Biology. Nature Publishing Group.
chicago: Siekhaus, Daria E, Martin Haesemeyer, Olivia Moffitt, and Ruth Lehmann.
“RhoL Controls Invasion and Rap1 Localization during Immune Cell Transmigration
in Drosophila.” Nature Cell Biology. Nature Publishing Group, 2010.
ieee: D. E. Siekhaus, M. Haesemeyer, O. Moffitt, and R. Lehmann, “RhoL controls
invasion and Rap1 localization during immune cell transmigration in Drosophila,”
Nature Cell Biology, vol. 12, no. 6. Nature Publishing Group, pp. 605–610,
2010.
ista: Siekhaus DE, Haesemeyer M, Moffitt O, Lehmann R. 2010. RhoL controls invasion
and Rap1 localization during immune cell transmigration in Drosophila. Nature
Cell Biology. 12(6), 605–610.
mla: Siekhaus, Daria E., et al. “RhoL Controls Invasion and Rap1 Localization during
Immune Cell Transmigration in Drosophila.” Nature Cell Biology, vol. 12,
no. 6, Nature Publishing Group, 2010, pp. 605–10.
short: D.E. Siekhaus, M. Haesemeyer, O. Moffitt, R. Lehmann, Nature Cell Biology
12 (2010) 605–610.
date_created: 2018-12-11T12:01:42Z
date_published: 2010-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:25Z
day: '01'
extern: 1
intvolume: ' 12'
issue: '6'
main_file_link:
- open_access: '0'
url: 10.1038/ncb2063 PubMed
month: '06'
page: 605 - 610
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '3542'
quality_controlled: 0
status: public
title: RhoL controls invasion and Rap1 localization during immune cell transmigration
in Drosophila
type: journal_article
volume: 12
year: '2010'
...
---
_id: '3201'
abstract:
- lang: eng
text: 'The problem of cosegmentation consists of segmenting the same object (or
objects of the same class) in two or more distinct images. Recently a number of
different models have been proposed for this problem. However, no comparison of
such models and corresponding optimization techniques has been done so far. We
analyze three existing models: the L1 norm model of Rother et al. [1], the L2
norm model of Mukherjee et al. [2] and the "reward" model of Hochbaum
and Singh [3]. We also study a new model, which is a straightforward extension
of the Boykov-Jolly model for single image segmentation [4]. In terms of optimization,
we use a Dual Decomposition (DD) technique in addition to optimization methods
in [1,2]. Experiments show a significant improvement of DD over published methods.
Our main conclusion, however, is that the new model is the best overall because
it: (i) has fewest parameters; (ii) is most robust in practice, and (iii) can
be optimized well with an efficient EM-style procedure.'
alternative_title:
- LNCS
author:
- first_name: Sara
full_name: Vicente, Sara
last_name: Vicente
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Vicente S, Kolmogorov V, Rother C. Cosegmentation revisited: Models and optimization.
In: Vol 6312. Springer; 2010:465-479. doi:10.1007/978-3-642-15552-9_34'
apa: 'Vicente, S., Kolmogorov, V., & Rother, C. (2010). Cosegmentation revisited:
Models and optimization (Vol. 6312, pp. 465–479). Presented at the ECCV: European
Conference on Computer Vision, Springer. https://doi.org/10.1007/978-3-642-15552-9_34'
chicago: 'Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Cosegmentation
Revisited: Models and Optimization,” 6312:465–79. Springer, 2010. https://doi.org/10.1007/978-3-642-15552-9_34.'
ieee: 'S. Vicente, V. Kolmogorov, and C. Rother, “Cosegmentation revisited: Models
and optimization,” presented at the ECCV: European Conference on Computer Vision,
2010, vol. 6312, pp. 465–479.'
ista: 'Vicente S, Kolmogorov V, Rother C. 2010. Cosegmentation revisited: Models
and optimization. ECCV: European Conference on Computer Vision, LNCS, vol. 6312,
465–479.'
mla: 'Vicente, Sara, et al. Cosegmentation Revisited: Models and Optimization.
Vol. 6312, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-15552-9_34.'
short: S. Vicente, V. Kolmogorov, C. Rother, in:, Springer, 2010, pp. 465–479.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:59Z
date_published: 2010-08-30T00:00:00Z
date_updated: 2021-01-12T07:41:46Z
day: '30'
doi: 10.1007/978-3-642-15552-9_34
extern: 1
intvolume: ' 6312'
main_file_link:
- open_access: '0'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.6803df
month: '08'
page: 465 - 479
publication_status: published
publisher: Springer
publist_id: '3479'
quality_controlled: 0
status: public
title: 'Cosegmentation revisited: Models and optimization'
type: conference
volume: 6312
year: '2010'
...
---
_id: '3202'
abstract:
- lang: eng
text: 'We consider the following problem: given an undirected weighted graph G =
(V,E,c) with nonnegative weights, minimize function c(δ(Π))- λ|Π| for all values
of parameter λ. Here Π is a partition of the set of nodes, the first term is the
cost of edges whose endpoints belong to different components of the partition,
and |Π| is the number of components. The current best known algorithm for this
problem has complexity O(|V| 2) maximum flow computations. We improve it to |V|
parametric maximum flow computations. We observe that the complexity can be improved
further for families of graphs which admit a good separator, e.g. for planar graphs.'
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. A faster algorithm for computing the principal sequence of partitions
of a graph. Algorithmica. 2010;56(4):394-412. doi:10.1007/s00453-008-9177-z
apa: Kolmogorov, V. (2010). A faster algorithm for computing the principal sequence
of partitions of a graph. Algorithmica. Springer. https://doi.org/10.1007/s00453-008-9177-z
chicago: Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence
of Partitions of a Graph.” Algorithmica. Springer, 2010. https://doi.org/10.1007/s00453-008-9177-z.
ieee: V. Kolmogorov, “A faster algorithm for computing the principal sequence of
partitions of a graph,” Algorithmica, vol. 56, no. 4. Springer, pp. 394–412,
2010.
ista: Kolmogorov V. 2010. A faster algorithm for computing the principal sequence
of partitions of a graph. Algorithmica. 56(4), 394–412.
mla: Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence
of Partitions of a Graph.” Algorithmica, vol. 56, no. 4, Springer, 2010,
pp. 394–412, doi:10.1007/s00453-008-9177-z.
short: V. Kolmogorov, Algorithmica 56 (2010) 394–412.
date_created: 2018-12-11T12:01:59Z
date_published: 2010-04-01T00:00:00Z
date_updated: 2021-01-12T07:41:46Z
day: '01'
doi: 10.1007/s00453-008-9177-z
extern: 1
intvolume: ' 56'
issue: '4'
month: '04'
page: 394 - 412
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '3480'
quality_controlled: 0
status: public
title: A faster algorithm for computing the principal sequence of partitions of a
graph
type: journal_article
volume: 56
year: '2010'
...
---
_id: '3233'
abstract:
- lang: eng
text: We present a general parallel-repetition theorem with an efficient reduction.
As a corollary of this theorem we establish that parallel repetition reduces the
soundness error at an exponential rate in any public-coin argument, and more generally,
any argument where the verifier's messages, but not necessarily its decision to
accept or reject, can be efficiently simulated with noticeable probability.
alternative_title:
- LNCS
author:
- first_name: Johan
full_name: Håstad, Johan
last_name: Håstad
- first_name: Rafael
full_name: Pass, Rafael
last_name: Pass
- first_name: Douglas
full_name: Wikström, Douglas
last_name: Wikström
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Håstad J, Pass R, Wikström D, Pietrzak KZ. An efficient parallel repetition
theorem. In: Vol 5978. Springer; 2010:1-18. doi:10.1007/978-3-642-11799-2_1'
apa: 'Håstad, J., Pass, R., Wikström, D., & Pietrzak, K. Z. (2010). An efficient
parallel repetition theorem (Vol. 5978, pp. 1–18). Presented at the TCC: Theory
of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-642-11799-2_1'
chicago: Håstad, Johan, Rafael Pass, Douglas Wikström, and Krzysztof Z Pietrzak.
“An Efficient Parallel Repetition Theorem,” 5978:1–18. Springer, 2010. https://doi.org/10.1007/978-3-642-11799-2_1.
ieee: 'J. Håstad, R. Pass, D. Wikström, and K. Z. Pietrzak, “An efficient parallel
repetition theorem,” presented at the TCC: Theory of Cryptography Conference,
2010, vol. 5978, pp. 1–18.'
ista: 'Håstad J, Pass R, Wikström D, Pietrzak KZ. 2010. An efficient parallel repetition
theorem. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 1–18.'
mla: Håstad, Johan, et al. An Efficient Parallel Repetition Theorem. Vol.
5978, Springer, 2010, pp. 1–18, doi:10.1007/978-3-642-11799-2_1.
short: J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, pp.
1–18.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:10Z
date_published: 2010-03-26T00:00:00Z
date_updated: 2021-01-12T07:41:59Z
day: '26'
doi: 10.1007/978-3-642-11799-2_1
extern: 1
intvolume: ' 5978'
month: '03'
page: 1 - 18
publication_status: published
publisher: Springer
publist_id: '3446'
quality_controlled: 0
status: public
title: An efficient parallel repetition theorem
type: conference
volume: 5978
year: '2010'
...
---
_id: '3234'
abstract:
- lang: eng
text: 'The strongest standard security notion for digital signature schemes is unforgeability
under chosen message attacks. In practice, however, this notion can be insufficient
due to "side-channel attacks" which exploit leakage of information about
the secret internal state. In this work we put forward the notion of "leakage-resilient
signatures," which strengthens the standard security notion by giving the
adversary the additional power to learn a bounded amount of arbitrary information
about the secret state that was accessed during every signature generation. This
notion naturally implies security against all side-channel attacks as long as
the amount of information leaked on each invocation is bounded and "only
computation leaks information." The main result of this paper is a construction
which gives a (tree-based, stateful) leakage-resilient signature scheme based
on any 3-time signature scheme. The amount of information that our scheme can
safely leak per signature generation is 1/3 of the information the underlying
3-time signature scheme can leak in total. Signature schemes that remain secure
even if a bounded total amount of information is leaked were recently constructed,
hence instantiating our construction with these schemes gives the first constructions
of provably secure leakage-resilient signature schemes. The above construction
assumes that the signing algorithm can sample truly random bits, and thus an implementation
would need some special hardware (randomness gates). Simply generating this randomness
using a leakage-resilient stream-cipher will in general not work. Our second contribution
is a sound general principle to replace uniform random bits in any leakage-resilient
construction with pseudorandom ones: run two leakage-resilient stream-ciphers
(with independent keys) in parallel and then apply a two-source extractor to their
outputs. '
alternative_title:
- LNCS
author:
- first_name: Sebastian
full_name: Faust, Sebastian
last_name: Faust
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Guy
full_name: Rothblum, Guy N
last_name: Rothblum
citation:
ama: 'Faust S, Kiltz E, Pietrzak KZ, Rothblum G. Leakage resilient signatures. In:
Vol 5978. Springer; 2010:343-360. doi:10.1007/978-3-642-11799-2_21'
apa: 'Faust, S., Kiltz, E., Pietrzak, K. Z., & Rothblum, G. (2010). Leakage
resilient signatures (Vol. 5978, pp. 343–360). Presented at the TCC: Theory of
Cryptography Conference, Springer. https://doi.org/10.1007/978-3-642-11799-2_21'
chicago: Faust, Sebastian, Eike Kiltz, Krzysztof Z Pietrzak, and Guy Rothblum. “Leakage
Resilient Signatures,” 5978:343–60. Springer, 2010. https://doi.org/10.1007/978-3-642-11799-2_21.
ieee: 'S. Faust, E. Kiltz, K. Z. Pietrzak, and G. Rothblum, “Leakage resilient signatures,”
presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp.
343–360.'
ista: 'Faust S, Kiltz E, Pietrzak KZ, Rothblum G. 2010. Leakage resilient signatures.
TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 343–360.'
mla: Faust, Sebastian, et al. Leakage Resilient Signatures. Vol. 5978, Springer,
2010, pp. 343–60, doi:10.1007/978-3-642-11799-2_21.
short: S. Faust, E. Kiltz, K.Z. Pietrzak, G. Rothblum, in:, Springer, 2010, pp.
343–360.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:10Z
date_published: 2010-03-26T00:00:00Z
date_updated: 2021-01-12T07:41:59Z
day: '26'
doi: 10.1007/978-3-642-11799-2_21
extern: 1
intvolume: ' 5978'
month: '03'
page: 343 - 360
publication_status: published
publisher: Springer
publist_id: '3447'
quality_controlled: 0
status: public
title: Leakage resilient signatures
type: conference
volume: 5978
year: '2010'
...
---
_id: '3235'
abstract:
- lang: eng
text: 'A cryptographic primitive is leakage-resilient, if it remains secure even
if an adversary can learn a bounded amount of arbitrary information about the
computation with every invocation. As a consequence, the physical implementation
of a leakage-resilient primitive is secure against every side-channel as long
as the amount of information leaked per invocation is bounded. In this paper we
prove positive and negative results about the feasibility of constructing leakage-resilient
pseudorandom functions and permutations (i.e. block-ciphers). Our results are
three fold: 1. We construct (from any standard PRF) a PRF which satisfies a relaxed
notion of leakage-resilience where (1) the leakage function is fixed (and not
adaptively chosen with each query.) and (2) the computation is split into several
steps which leak individually (a "step" will be the invocation of the
underlying PRF.) 2. We prove that a Feistel network with a super-logarithmic number
of rounds, each instantiated with a leakage-resilient PRF, is a leakage resilient
PRP. This reduction also holds for the non-adaptive notion just discussed, we
thus get a block-cipher which is leakage-resilient (against non-adaptive leakage).
3. We propose generic side-channel attacks against Feistel networks. The attacks
are generic in the sense that they work for any round functions (e.g. uniformly
random functions) and only require some simple leakage from the inputs to the
round functions. For example we show how to invert an r round Feistel network
over 2n bits making 4•(n+1) r-2 forward queries, if with each query we are also
given as leakage the Hamming weight of the inputs to the r round functions. This
complements the result from the previous item showing that a super-constant number
of rounds is necessary.'
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Dodis Y, Pietrzak KZ. Leakage resilient pseudorandom functions and side channel
attacks on feistel networks. In: Vol 6223. Springer; 2010:21-40. doi:10.1007/978-3-642-14623-7_2'
apa: 'Dodis, Y., & Pietrzak, K. Z. (2010). Leakage resilient pseudorandom functions
and side channel attacks on feistel networks (Vol. 6223, pp. 21–40). Presented
at the CRYPTO: International Cryptology Conference, Springer. https://doi.org/10.1007/978-3-642-14623-7_2'
chicago: Dodis, Yevgeniy, and Krzysztof Z Pietrzak. “Leakage Resilient Pseudorandom
Functions and Side Channel Attacks on Feistel Networks,” 6223:21–40. Springer,
2010. https://doi.org/10.1007/978-3-642-14623-7_2.
ieee: 'Y. Dodis and K. Z. Pietrzak, “Leakage resilient pseudorandom functions and
side channel attacks on feistel networks,” presented at the CRYPTO: International
Cryptology Conference, 2010, vol. 6223, pp. 21–40.'
ista: 'Dodis Y, Pietrzak KZ. 2010. Leakage resilient pseudorandom functions and
side channel attacks on feistel networks. CRYPTO: International Cryptology Conference,
LNCS, vol. 6223, 21–40.'
mla: Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. Leakage Resilient Pseudorandom
Functions and Side Channel Attacks on Feistel Networks. Vol. 6223, Springer,
2010, pp. 21–40, doi:10.1007/978-3-642-14623-7_2.
short: Y. Dodis, K.Z. Pietrzak, in:, Springer, 2010, pp. 21–40.
conference:
name: 'CRYPTO: International Cryptology Conference'
date_created: 2018-12-11T12:02:10Z
date_published: 2010-09-30T00:00:00Z
date_updated: 2021-01-12T07:42:00Z
day: '30'
doi: 10.1007/978-3-642-14623-7_2
extern: 1
intvolume: ' 6223'
month: '09'
page: 21 - 40
publication_status: published
publisher: Springer
publist_id: '3445'
quality_controlled: 0
status: public
title: Leakage resilient pseudorandom functions and side channel attacks on feistel
networks
type: conference
volume: 6223
year: '2010'
...
---
_id: '3237'
abstract:
- lang: eng
text: 'Blinding is a popular and well-known countermeasure to protect public-key
cryptosystems against side-channel attacks. The high level idea is to randomize
an exponentiation in order to prevent multiple measurements of the same operation
on different data, as such measurements might allow the adversary to learn the
secret exponent. Several variants of blinding have been proposed in the literature,
using additive or multiplicative secret-sharing to blind either the base or the
exponent. These countermeasures usually aim at preventing particular side-channel
attacks (mostly power analysis) and come without any formal security guarantee.
In this work we investigate to which extend blinding can provide provable security
against a general class of side-channel attacks. Surprisingly, it turns out that
in the context of public-key encryption some blinding techniques are more suited
than others. In particular, we consider a multiplicatively blinded version of
ElGamal public-key encryption where - we prove that the scheme, instantiated over
bilinear groups of prime order p (where p - 1 is not smooth) is leakage resilient
in the generic-group model. Here we consider the model of chosen-ciphertext security
in the presence of continuous leakage, i.e., the scheme remains chosen-ciphertext
secure even if with every decryption query the adversary can learn a bounded amount
(roughly log(p)/2 bits) of arbitrary, adversarially chosen information about the
computation. - we conjecture that the scheme, instantiated over arbitrary groups
of prime order p (where p - 1 is not smooth) is leakage resilient. Previous to
this work no encryption scheme secure against continuous leakage was known. Constructing
a scheme that can be proven secure in the standard model remains an interesting
open problem. '
alternative_title:
- LNCS
author:
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Kiltz E, Pietrzak KZ. Leakage resilient ElGamal encryption. In: Vol 6477.
Springer; 2010:595-612. doi:10.1007/978-3-642-17373-8_34'
apa: 'Kiltz, E., & Pietrzak, K. Z. (2010). Leakage resilient ElGamal encryption
(Vol. 6477, pp. 595–612). Presented at the ASIACRYPT: Theory and Application of
Cryptology and Information Security, Springer. https://doi.org/10.1007/978-3-642-17373-8_34'
chicago: Kiltz, Eike, and Krzysztof Z Pietrzak. “Leakage Resilient ElGamal Encryption,”
6477:595–612. Springer, 2010. https://doi.org/10.1007/978-3-642-17373-8_34.
ieee: 'E. Kiltz and K. Z. Pietrzak, “Leakage resilient ElGamal encryption,” presented
at the ASIACRYPT: Theory and Application of Cryptology and Information Security,
2010, vol. 6477, pp. 595–612.'
ista: 'Kiltz E, Pietrzak KZ. 2010. Leakage resilient ElGamal encryption. ASIACRYPT:
Theory and Application of Cryptology and Information Security, LNCS, vol. 6477,
595–612.'
mla: Kiltz, Eike, and Krzysztof Z. Pietrzak. Leakage Resilient ElGamal Encryption.
Vol. 6477, Springer, 2010, pp. 595–612, doi:10.1007/978-3-642-17373-8_34.
short: E. Kiltz, K.Z. Pietrzak, in:, Springer, 2010, pp. 595–612.
conference:
name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
date_created: 2018-12-11T12:02:11Z
date_published: 2010-01-14T00:00:00Z
date_updated: 2021-01-12T07:42:01Z
day: '14'
doi: 10.1007/978-3-642-17373-8_34
extern: 1
intvolume: ' 6477'
month: '01'
page: 595 - 612
publication_status: published
publisher: Springer
publist_id: '3444'
quality_controlled: 0
status: public
title: Leakage resilient ElGamal encryption
type: conference
volume: 6477
year: '2010'
...