---
_id: '7212'
abstract:
- lang: eng
text: The fixation probability of a single mutant invading a population of residents
is among the most widely-studied quantities in evolutionary dynamics. Amplifiers
of natural selection are population structures that increase the fixation probability
of advantageous mutants, compared to well-mixed populations. Extensive studies
have shown that many amplifiers exist for the Birth-death Moran process, some
of them substantially increasing the fixation probability or even guaranteeing
fixation in the limit of large population size. On the other hand, no amplifiers
are known for the death-Birth Moran process, and computer-assisted exhaustive
searches have failed to discover amplification. In this work we resolve this disparity,
by showing that any amplification under death-Birth updating is necessarily bounded
and transient. Our boundedness result states that even if a population structure
does amplify selection, the resulting fixation probability is close to that of
the well-mixed population. Our transience result states that for any population
structure there exists a threshold r⋆ such that the population structure ceases
to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally,
we also extend the above results to δ-death-Birth updating, which is a combination
of Birth-death and death-Birth updating. On the positive side, we identify population
structures that maintain amplification for a wide range of values r and δ. These
results demonstrate that amplification of natural selection depends on the specific
mechanisms of the evolutionary process.
article_number: e1007494
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin A.
full_name: Nowak, Martin A.
last_name: Nowak
citation:
ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of
natural selection under death-Birth updating. PLoS computational biology.
2020;16. doi:10.1371/journal.pcbi.1007494
apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits
on amplifiers of natural selection under death-Birth updating. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007494
chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin
A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.”
PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.
ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers
of natural selection under death-Birth updating,” PLoS computational biology,
vol. 16. Public Library of Science, 2020.
ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers
of natural selection under death-Birth updating. PLoS computational biology. 16,
e1007494.
mla: Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth
Updating.” PLoS Computational Biology, vol. 16, e1007494, Public Library
of Science, 2020, doi:10.1371/journal.pcbi.1007494.
short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational
Biology 16 (2020).
date_created: 2019-12-23T13:45:11Z
date_published: 2020-01-17T00:00:00Z
date_updated: 2026-04-16T08:32:38Z
day: '17'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1371/journal.pcbi.1007494
ec_funded: 1
external_id:
arxiv:
- '1906.02785'
isi:
- '000510916500025'
file:
- access_level: open_access
checksum: ce32ee2d2f53aed832f78bbd47e882df
content_type: application/pdf
creator: dernst
date_created: 2020-02-03T07:32:42Z
date_updated: 2020-07-14T12:47:53Z
file_id: '7441'
file_name: 2020_PlosCompBio_Tkadlec.pdf
file_size: 1817531
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: PLoS computational biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '7196'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Limits on amplifiers of natural selection under death-Birth updating
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 16
year: '2020'
...
---
_id: '8384'
abstract:
- lang: eng
text: Previous research on animations of soap bubbles, films, and foams largely
focuses on the motion and geometric shape of the bubble surface. These works neglect
the evolution of the bubble’s thickness, which is normally responsible for visual
phenomena like surface vortices, Newton’s interference patterns, capillary waves,
and deformation-dependent rupturing of films in a foam. In this paper, we model
these natural phenomena by introducing the film thickness as a reduced degree
of freedom in the Navier-Stokes equations and deriving their equations of motion.
We discretize the equations on a nonmanifold triangle mesh surface and couple
it to an existing bubble solver. In doing so, we also introduce an incompressible
fluid solver for 2.5D films and a novel advection algorithm for convecting fields
across non-manifold surface junctions. Our simulations enhance state-of-the-art
bubble solvers with additional effects caused by convection, rippling, draining,
and evaporation of the thin film.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
Visual Computing Group at IST Austria for their valuable feedback, especially Camille
Schreck for her help in rendering. This research was supported by the Scientific
Service Units (SSU) of IST Austria through resources provided by Scientific Computing.
We would like to thank the authors of [Belcour and Barla 2017] for providing their
implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al.
2008] for allowing us to use their results, and Rok Grah for helpful discussions.
Finally, we thank Ryoichi Ando for many discussions from the beginning of the project
that resulted in important contents of the paper including our formulation, numerical
scheme, and initial implementation. This project has received funding from the\r\nEuropean
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme under grant agreement No. 638176."
article_number: '31'
article_processing_charge: No
article_type: original
author:
- first_name: Sadashige
full_name: Ishida, Sadashige
id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
last_name: Ishida
orcid: 0000-0002-3121-3100
- first_name: Peter
full_name: Synak, Peter
id: 331776E2-F248-11E8-B48F-1D18A9856A87
last_name: Synak
- first_name: Fumiya
full_name: Narita, Fumiya
last_name: Narita
- first_name: Toshiya
full_name: Hachisuka, Toshiya
last_name: Hachisuka
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics
with evolving thickness. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392405
apa: Ishida, S., Synak, P., Narita, F., Hachisuka, T., & Wojtan, C. (2020).
A model for soap film dynamics with evolving thickness. ACM Transactions on
Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392405
chicago: Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris
Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions
on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392405.
ieee: S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for
soap film dynamics with evolving thickness,” ACM Transactions on Graphics,
vol. 39, no. 4. Association for Computing Machinery, 2020.
ista: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap
film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.
mla: Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.”
ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing
Machinery, 2020, doi:10.1145/3386569.3392405.
short: S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions
on Graphics 39 (2020).
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2026-04-16T08:29:36Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392405
ec_funded: 1
external_id:
isi:
- '000583700300004'
file:
- access_level: open_access
checksum: 813831ca91319d794d9748c276b24578
content_type: application/pdf
creator: dernst
date_created: 2020-11-23T09:03:19Z
date_updated: 2020-11-23T09:03:19Z
file_id: '8795'
file_name: 2020_soapfilm_submitted.pdf
file_size: 14935529
relation: main_file
success: 1
file_date_updated: 2020-11-23T09:03:19Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3386569.3392405
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '19630'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A model for soap film dynamics with evolving thickness
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '8385'
abstract:
- lang: eng
text: 'We present a method for animating yarn-level cloth effects using a thin-shell
solver. We accomplish this through numerical homogenization: we first use a large
number of yarn-level simulations to build a model of the potential energy density
of the cloth, and then use this energy density function to compute forces in a
thin shell simulator. We model several yarn-based materials, including both woven
and knitted fabrics. Our model faithfully reproduces expected effects like the
stiffness of woven fabrics, and the highly deformable nature and anisotropy of
knitted fabrics. Our approach does not require any real-world experiments nor
measurements; because the method is based entirely on simulations, it can generate
entirely new material models quickly, without the need for testing apparatuses
or human intervention. We provide data-driven models of several woven and knitted
fabrics, which can be used for efficient simulation with an off-the-shelf cloth
solver.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
Visual Computing Group at IST Austria for their valuable feedback. We also thank
the creators of the Berkeley Garment Library [de Joya et al. 2012] for providing
garment meshes, [Krishnamurthy and Levoy 1996] and [Turk and Levoy 1994] for the
armadillo and bunny meshes, the creators of libWetCloth [Fei et al. 2018] for their
implementation of discrete elastic rod forces, and Tomáš Skřivan for\r\ninspiring
discussions and help with Mathematica code generation. This research was supported
by the Scientific Service Units (SSU) of IST Austria through resources provided
by Scientific Computing. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young
Faculty Fellowship and a gift from Adobe Inc."
article_number: '48'
article_processing_charge: No
article_type: original
author:
- first_name: Georg
full_name: Sperl, Georg
id: 4DD40360-F248-11E8-B48F-1D18A9856A87
last_name: Sperl
- first_name: Rahul
full_name: Narain, Rahul
last_name: Narain
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. ACM Transactions
on Graphics. 2020;39(4). doi:10.1145/3386569.3392412
apa: Sperl, G., Narain, R., & Wojtan, C. (2020). Homogenized yarn-level cloth.
ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392412
chicago: Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.”
ACM Transactions on Graphics. Association for Computing Machinery, 2020.
https://doi.org/10.1145/3386569.3392412.
ieee: G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” ACM
Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery,
2020.
ista: Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions
on Graphics. 39(4), 48.
mla: Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” ACM Transactions on
Graphics, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392412.
short: G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).
corr_author: '1'
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2026-04-16T08:31:55Z
day: '08'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3386569.3392412
ec_funded: 1
external_id:
isi:
- '000583700300021'
file:
- access_level: open_access
checksum: cf4c1d361c3196c4bd424520a5588205
content_type: application/pdf
creator: dernst
date_created: 2020-11-23T09:01:22Z
date_updated: 2020-11-23T09:01:22Z
file_id: '8794'
file_name: 2020_hylc_submitted.pdf
file_size: 38922662
relation: main_file
success: 1
file_date_updated: 2020-11-23T09:01:22Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3386569.3392412
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '12358'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Homogenized yarn-level cloth
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
OA_place: publisher
_id: '7196'
abstract:
- lang: eng
text: 'In this thesis we study certain mathematical aspects of evolution. The two
primary forces that drive an evolutionary process are mutation and selection.
Mutation generates new variants in a population. Selection chooses among the variants
depending on the reproductive rates of individuals. Evolutionary processes are
intrinsically random – a new mutation that is initially present in the population
at low frequency can go extinct, even if it confers a reproductive advantage.
The overall rate of evolution is largely determined by two quantities: the probability
that an invading advantageous mutation spreads through the population (called
fixation probability) and the time until it does so (called fixation time). Both
those quantities crucially depend not only on the strength of the invading mutation
but also on the population structure. In this thesis, we aim to understand how
the underlying population structure affects the overall rate of evolution. Specifically,
we study population structures that increase the fixation probability of advantageous
mutants (called amplifiers of selection). Broadly speaking, our results are of
three different types: We present various strong amplifiers, we identify regimes
under which only limited amplification is feasible, and we propose population
structures that provide different tradeoffs between high fixation probability
and short fixation time.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196
apa: Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196
chicago: Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute
of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196.
ieee: J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science
and Technology Austria, 2020.
ista: Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of
Science and Technology Austria.
mla: Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute
of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.
short: J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science
and Technology Austria, 2020.
corr_author: '1'
date_created: 2019-12-20T12:26:36Z
date_published: 2020-01-12T00:00:00Z
date_updated: 2026-04-16T08:32:37Z
day: '12'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: KrCh
- _id: GradSch
doi: 10.15479/AT:ISTA:7196
file:
- access_level: closed
checksum: 451f8e64b0eb26bf297644ac72bfcbe9
content_type: application/zip
creator: jtkadlec
date_created: 2020-01-12T11:49:49Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7255'
file_name: thesis.zip
file_size: 21100497
relation: source_file
- access_level: open_access
checksum: d8c44cbc4f939c49a8efc9d4b8bb3985
content_type: application/pdf
creator: dernst
date_created: 2020-01-28T07:32:42Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7367'
file_name: 2020_Tkadlec_Thesis.pdf
file_size: 11670983
relation: main_file
file_date_updated: 2020-07-14T12:47:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '144'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5751'
relation: dissertation_contains
status: public
- id: '7210'
relation: dissertation_contains
status: public
- id: '7212'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: A role of graphs in evolutionary processes
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '8173'
abstract:
- lang: eng
text: Understanding how the activity of membrane receptors and cellular signaling
pathways shapes cell behavior is of fundamental interest in basic and applied
research. Reengineering receptors to react to light instead of their cognate ligands
allows for generating defined signaling inputs with high spatial and temporal
precision and facilitates the dissection of complex signaling networks. Here,
we describe fundamental considerations in the design of light-regulated receptor
tyrosine kinases (Opto-RTKs) and appropriate control experiments. We also introduce
methods for transient receptor expression in HEK293 cells, quantitative assessment
of signaling activity in reporter gene assays, semiquantitative assessment of
(in)activation time courses through Western blot (WB) analysis, and easy to implement
light stimulation hardware.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Stephanie
full_name: Kainrath, Stephanie
id: 32CFBA64-F248-11E8-B48F-1D18A9856A87
last_name: Kainrath
orcid: 0000-0002-6709-2195
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: 'Kainrath S, Janovjak HL. Design and application of light-regulated receptor
tyrosine kinases. In: Niopek D, ed. Photoswitching Proteins. Vol 2173.
MIMB. Springer Nature; 2020:233-246. doi:10.1007/978-1-0716-0755-8_16'
apa: Kainrath, S., & Janovjak, H. L. (2020). Design and application of light-regulated
receptor tyrosine kinases. In D. Niopek (Ed.), Photoswitching Proteins
(Vol. 2173, pp. 233–246). Springer Nature. https://doi.org/10.1007/978-1-0716-0755-8_16
chicago: Kainrath, Stephanie, and Harald L Janovjak. “Design and Application of
Light-Regulated Receptor Tyrosine Kinases.” In Photoswitching Proteins,
edited by Dominik Niopek, 2173:233–46. MIMB. Springer Nature, 2020. https://doi.org/10.1007/978-1-0716-0755-8_16.
ieee: S. Kainrath and H. L. Janovjak, “Design and application of light-regulated
receptor tyrosine kinases,” in Photoswitching Proteins, vol. 2173, D. Niopek,
Ed. Springer Nature, 2020, pp. 233–246.
ista: 'Kainrath S, Janovjak HL. 2020.Design and application of light-regulated receptor
tyrosine kinases. In: Photoswitching Proteins. Methods in Molecular Biology, vol.
2173, 233–246.'
mla: Kainrath, Stephanie, and Harald L. Janovjak. “Design and Application of Light-Regulated
Receptor Tyrosine Kinases.” Photoswitching Proteins, edited by Dominik
Niopek, vol. 2173, Springer Nature, 2020, pp. 233–46, doi:10.1007/978-1-0716-0755-8_16.
short: S. Kainrath, H.L. Janovjak, in:, D. Niopek (Ed.), Photoswitching Proteins,
Springer Nature, 2020, pp. 233–246.
date_created: 2020-07-26T22:01:03Z
date_published: 2020-07-11T00:00:00Z
date_updated: 2026-04-16T09:22:45Z
day: '11'
department:
- _id: CaGu
doi: 10.1007/978-1-0716-0755-8_16
editor:
- first_name: Dominik
full_name: Niopek, Dominik
last_name: Niopek
external_id:
pmid:
- '32651922'
intvolume: ' 2173'
language:
- iso: eng
month: '07'
oa_version: None
page: 233-246
pmid: 1
publication: Photoswitching Proteins
publication_identifier:
eisbn:
- '9781071607558'
eissn:
- 1940-6029
isbn:
- '9781071607541'
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
scopus_import: '1'
series_title: MIMB
status: public
title: Design and application of light-regulated receptor tyrosine kinases
type: book_chapter
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2173
year: '2020'
...
---
_id: '8272'
abstract:
- lang: eng
text: We study turn-based stochastic zero-sum games with lexicographic preferences
over reachability and safety objectives. Stochastic games are standard models
in control, verification, and synthesis of stochastic reactive systems that exhibit
both randomness as well as angelic and demonic non-determinism. Lexicographic
order allows to consider multiple objectives with a strict preference order over
the satisfaction of the objectives. To the best of our knowledge, stochastic games
with lexicographic objectives have not been studied before. We establish determinacy
of such games and present strategy and computational complexity results. For strategy
complexity, we show that lexicographically optimal strategies exist that are deterministic
and memory is only required to remember the already satisfied and violated objectives.
For a constant number of objectives, we show that the relevant decision problem
is in NP∩coNP , matching the current known bound for single objectives; and
in general the decision problem is PSPACE -hard and can be solved in NEXPTIME∩coNEXPTIME
. We present an algorithm that computes the lexicographically optimal strategies
via a reduction to computation of optimal strategies in a sequence of single-objectives
games. We have implemented our algorithm and report experimental results on various
case studies.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Joost P
full_name: Katoen, Joost P
id: 4524F760-F248-11E8-B48F-1D18A9856A87
last_name: Katoen
orcid: 0000-0002-6143-1926
- first_name: Maximilian
full_name: Weininger, Maximilian
last_name: Weininger
- first_name: Tobias
full_name: Winkler, Tobias
last_name: Winkler
citation:
ama: 'Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic
reachability-safety objectives. In: International Conference on Computer Aided
Verification. Vol 12225. Springer Nature; 2020:398-420. doi:10.1007/978-3-030-53291-8_21'
apa: Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic
games with lexicographic reachability-safety objectives. In International Conference
on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature.
https://doi.org/10.1007/978-3-030-53291-8_21
chicago: Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias
Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.”
In International Conference on Computer Aided Verification, 12225:398–420.
Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53291-8_21.
ieee: K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games
with lexicographic reachability-safety objectives,” in International Conference
on Computer Aided Verification, 2020, vol. 12225, pp. 398–420.
ista: 'Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with
lexicographic reachability-safety objectives. International Conference on Computer
Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.'
mla: Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety
Objectives.” International Conference on Computer Aided Verification, vol.
12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.
short: K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International
Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2020-08-16T22:00:58Z
date_published: 2020-07-14T00:00:00Z
date_updated: 2026-04-16T09:31:14Z
day: '14'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-53291-8_21
ec_funded: 1
external_id:
arxiv:
- '2005.04018'
isi:
- '000695272500021'
file:
- access_level: open_access
checksum: 093d4788d7d5b2ce0ffe64fbe7820043
content_type: application/pdf
creator: dernst
date_created: 2020-08-17T11:32:44Z
date_updated: 2020-08-17T11:32:44Z
file_id: '8276'
file_name: 2020_LNCS_CAV_Chatterjee.pdf
file_size: 625056
relation: main_file
success: 1
file_date_updated: 2020-08-17T11:32:44Z
has_accepted_license: '1'
intvolume: ' 12225'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 398-420
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: International Conference on Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030532901'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '12738'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Stochastic games with lexicographic reachability-safety objectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12225
year: '2020'
...
---
_id: '8674'
abstract:
- lang: eng
text: 'Extrasynaptic actions of glutamate are limited by high-affinity transporters
expressed by perisynaptic astroglial processes (PAPs): this helps maintain point-to-point
transmission in excitatory circuits. Memory formation in the brain is associated
with synaptic remodeling, but how this affects PAPs and therefore extrasynaptic
glutamate actions is poorly understood. Here, we used advanced imaging methods,
in situ and in vivo, to find that a classical synaptic memory mechanism, long-term
potentiation (LTP), triggers withdrawal of PAPs from potentiated synapses. Optical
glutamate sensors combined with patch-clamp and 3D molecular localization reveal
that LTP induction thus prompts spatial retreat of astroglial glutamate transporters,
boosting glutamate spillover and NMDA-receptor-mediated inter-synaptic cross-talk.
The LTP-triggered PAP withdrawal involves NKCC1 transporters and the actin-controlling
protein cofilin but does not depend on major Ca2+-dependent cascades in astrocytes.
We have therefore uncovered a mechanism by which a memory trace at one synapse
could alter signal handling by multiple neighboring connections.'
acknowledgement: We thank J. Angibaud for organotypic cultures and R. Chereau and
J. Tonnesen for help with the STED microscope; also D. Gonzales and the Neurocentre
Magendie INSERM U1215 Genotyping Platform, for breeding management and genotyping.
This work was supported by the Wellcome Trust Principal Fellowships 101896 and 212251,
ERC Advanced Grant 323113, ERC Proof-of-Concept Grant 767372, EC FP7 ITN 606950,
and EU CSA 811011 (D.A.R.); NRW-Rückkehrerpogramm, UCL Excellence Fellowship, German
Research Foundation (DFG) SPP1757 and SFB1089 (C.H.); Human Frontiers Science Program
(C.H., C.J.J., and H.J.); EMBO Long-Term Fellowship (L.B.); Marie Curie FP7 PIRG08-GA-2010-276995
(A.P.), ASTROMODULATION (S.R.); Equipe FRM DEQ 201 303 26519, Conseil Régional d’Aquitaine
R12056GG, INSERM (S.H.R.O.); ANR SUPERTri, ANR Castro (ANR-17-CE16-0002), R-13-BSV4-0007-01,
Université de Bordeaux, labex BRAIN (S.H.R.O. and U.V.N.); CNRS (A.P., S.H.R.O.,
and U.V.N.); HFSP, ANR CEXC, and France-BioImaging ANR-10-INSB-04 (U.V.N.); and
FP7 MemStick Project No. 201600 (M.G.S.).
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
- first_name: Lucie
full_name: Bard, Lucie
last_name: Bard
- first_name: Aude
full_name: Panatier, Aude
last_name: Panatier
- first_name: James P.
full_name: Reynolds, James P.
last_name: Reynolds
- first_name: Olga
full_name: Kopach, Olga
last_name: Kopach
- first_name: Nikolay I.
full_name: Medvedev, Nikolay I.
last_name: Medvedev
- first_name: Daniel
full_name: Minge, Daniel
last_name: Minge
- first_name: Michel K.
full_name: Herde, Michel K.
last_name: Herde
- first_name: Stefanie
full_name: Anders, Stefanie
last_name: Anders
- first_name: Igor
full_name: Kraev, Igor
last_name: Kraev
- first_name: Janosch P.
full_name: Heller, Janosch P.
last_name: Heller
- first_name: Sylvain
full_name: Rama, Sylvain
last_name: Rama
- first_name: Kaiyu
full_name: Zheng, Kaiyu
last_name: Zheng
- first_name: Thomas P.
full_name: Jensen, Thomas P.
last_name: Jensen
- first_name: Inmaculada
full_name: Sanchez-Romero, Inmaculada
id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
last_name: Sanchez-Romero
- first_name: Colin J.
full_name: Jackson, Colin J.
last_name: Jackson
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Ole Petter
full_name: Ottersen, Ole Petter
last_name: Ottersen
- first_name: Erlend Arnulf
full_name: Nagelhus, Erlend Arnulf
last_name: Nagelhus
- first_name: Stephane H.R.
full_name: Oliet, Stephane H.R.
last_name: Oliet
- first_name: Michael G.
full_name: Stewart, Michael G.
last_name: Stewart
- first_name: U. VAlentin
full_name: Nägerl, U. VAlentin
last_name: Nägerl
- first_name: 'Dmitri A. '
full_name: 'Rusakov, Dmitri A. '
last_name: Rusakov
citation:
ama: Henneberger C, Bard L, Panatier A, et al. LTP induction boosts glutamate spillover
by driving withdrawal of perisynaptic astroglia. Neuron. 2020;108(5):P919-936.E11.
doi:10.1016/j.neuron.2020.08.030
apa: Henneberger, C., Bard, L., Panatier, A., Reynolds, J. P., Kopach, O., Medvedev,
N. I., … Rusakov, D. A. (2020). LTP induction boosts glutamate spillover by driving
withdrawal of perisynaptic astroglia. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2020.08.030
chicago: Henneberger, Christian, Lucie Bard, Aude Panatier, James P. Reynolds, Olga
Kopach, Nikolay I. Medvedev, Daniel Minge, et al. “LTP Induction Boosts Glutamate
Spillover by Driving Withdrawal of Perisynaptic Astroglia.” Neuron. Elsevier,
2020. https://doi.org/10.1016/j.neuron.2020.08.030.
ieee: C. Henneberger et al., “LTP induction boosts glutamate spillover by
driving withdrawal of perisynaptic astroglia,” Neuron, vol. 108, no. 5.
Elsevier, p. P919–936.E11, 2020.
ista: Henneberger C, Bard L, Panatier A, Reynolds JP, Kopach O, Medvedev NI, Minge
D, Herde MK, Anders S, Kraev I, Heller JP, Rama S, Zheng K, Jensen TP, Sanchez-Romero
I, Jackson CJ, Janovjak HL, Ottersen OP, Nagelhus EA, Oliet SHR, Stewart MG, Nägerl
UVa, Rusakov DA. 2020. LTP induction boosts glutamate spillover by driving withdrawal
of perisynaptic astroglia. Neuron. 108(5), P919–936.E11.
mla: Henneberger, Christian, et al. “LTP Induction Boosts Glutamate Spillover by
Driving Withdrawal of Perisynaptic Astroglia.” Neuron, vol. 108, no. 5,
Elsevier, 2020, p. P919–936.E11, doi:10.1016/j.neuron.2020.08.030.
short: C. Henneberger, L. Bard, A. Panatier, J.P. Reynolds, O. Kopach, N.I. Medvedev,
D. Minge, M.K. Herde, S. Anders, I. Kraev, J.P. Heller, S. Rama, K. Zheng, T.P.
Jensen, I. Sanchez-Romero, C.J. Jackson, H.L. Janovjak, O.P. Ottersen, E.A. Nagelhus,
S.H.R. Oliet, M.G. Stewart, U.Va. Nägerl, D.A. Rusakov, Neuron 108 (2020) P919–936.E11.
date_created: 2020-10-18T22:01:38Z
date_published: 2020-12-09T00:00:00Z
date_updated: 2026-04-16T09:33:03Z
day: '09'
ddc:
- '570'
department:
- _id: HaJa
doi: 10.1016/j.neuron.2020.08.030
external_id:
isi:
- '000603428000010'
pmid:
- '32976770'
file:
- access_level: open_access
checksum: 054562bb50165ef9a1f46631c1c5e36b
content_type: application/pdf
creator: dernst
date_created: 2020-12-10T14:42:09Z
date_updated: 2020-12-10T14:42:09Z
file_id: '8939'
file_name: 2020_Neuron_Henneberger.pdf
file_size: 7518960
relation: main_file
success: 1
file_date_updated: 2020-12-10T14:42:09Z
has_accepted_license: '1'
intvolume: ' 108'
isi: 1
issue: '5'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: P919-936.E11
pmid: 1
publication: Neuron
publication_identifier:
eissn:
- 1097-4199
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic
astroglia
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 108
year: '2020'
...
---
_id: '8339'
abstract:
- lang: eng
text: "Discrete Gaussian distributions over lattices are central to lattice-based
cryptography, and to the computational and mathematical aspects of lattices more
broadly. The literature contains a wealth of useful theorems about the behavior
of discrete Gaussians under convolutions and related operations. Yet despite their
structural similarities, most of these theorems are formally incomparable, and
their proofs tend to be monolithic and written nearly “from scratch,” making them
unnecessarily hard to verify, understand, and extend.\r\nIn this work we present
a modular framework for analyzing linear operations on discrete Gaussian distributions.
The framework abstracts away the particulars of Gaussians, and usually reduces
proofs to the choice of appropriate linear transformations and elementary linear
algebra. To showcase the approach, we establish several general properties of
discrete Gaussians, and show how to obtain all prior convolution theorems (along
with some new ones) as straightforward corollaries. As another application, we
describe a self-reduction for Learning With Errors (LWE) that uses a fixed number
of samples to generate an unlimited number of additional ones (having somewhat
larger error). The distinguishing features of our reduction are its simple analysis
in our framework, and its exclusive use of discrete Gaussians without any loss
in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs
a contribution of independent interest, for subgaussian random matrices we prove
a singular value concentration bound with explicitly stated constants, and we
give tighter heuristics for specific distributions that are commonly used for
generating lattice trapdoors. These bounds yield improvements in the concrete
bit-security estimates for trapdoor lattice cryptosystems."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nicholas
full_name: Genise, Nicholas
last_name: Genise
- first_name: Daniele
full_name: Micciancio, Daniele
last_name: Micciancio
- first_name: Chris
full_name: Peikert, Chris
last_name: Peikert
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and
subgaussian analysis for lattice cryptography. In: 23rd IACR International
Conference on the Practice and Theory of Public-Key Cryptography. Vol 12110.
Springer Nature; 2020:623-651. doi:10.1007/978-3-030-45374-9_21'
apa: 'Genise, N., Micciancio, D., Peikert, C., & Walter, M. (2020). Improved
discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd
IACR International Conference on the Practice and Theory of Public-Key Cryptography
(Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21'
chicago: Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter.
“Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.”
In 23rd IACR International Conference on the Practice and Theory of Public-Key
Cryptography, 12110:623–51. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45374-9_21.
ieee: N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian
and subgaussian analysis for lattice cryptography,” in 23rd IACR International
Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh,
United Kingdom, 2020, vol. 12110, pp. 623–651.
ista: 'Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian
and subgaussian analysis for lattice cryptography. 23rd IACR International Conference
on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography,
LNCS, vol. 12110, 623–651.'
mla: Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis
for Lattice Cryptography.” 23rd IACR International Conference on the Practice
and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020,
pp. 623–51, doi:10.1007/978-3-030-45374-9_21.
short: N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International
Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature,
2020, pp. 623–651.
conference:
end_date: 2020-05-07
location: Edinburgh, United Kingdom
name: 'PKC: Public-Key Cryptography'
start_date: 2020-05-04
date_created: 2020-09-06T22:01:13Z
date_published: 2020-05-15T00:00:00Z
date_updated: 2026-04-16T09:32:27Z
day: '15'
department:
- _id: KrPi
doi: 10.1007/978-3-030-45374-9_21
ec_funded: 1
external_id:
isi:
- '001299210200021'
intvolume: ' 12110'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2020/337
month: '05'
oa: 1
oa_version: Preprint
page: 623-651
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 23rd IACR International Conference on the Practice and Theory of Public-Key
Cryptography
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030453732'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved discrete Gaussian and subgaussian analysis for lattice cryptography
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12110
year: '2020'
...
---
_id: '8987'
abstract:
- lang: eng
text: "Currently several projects aim at designing and implementing protocols for
privacy preserving automated contact tracing to help fight the current pandemic.
Those proposal are quite similar, and in their most basic form basically propose
an app for mobile phones which broadcasts frequently changing pseudorandom identifiers
via (low energy) Bluetooth, and at the same time, the app stores IDs broadcast
by phones in its proximity. Only if a user is tested positive, they upload either
the beacons they did broadcast (which is the case in decentralized proposals as
DP-3T, east and west coast PACT or Covid watch) or received (as in Popp-PT or
ROBERT) during the last two weeks or so.\r\n\r\nVaudenay [eprint 2020/399] observes
that this basic scheme (he considers the DP-3T proposal) succumbs to relay and
even replay attacks, and proposes more complex interactive schemes which prevent
those attacks without giving up too many privacy aspects. Unfortunately interaction
is problematic for this application for efficiency and security reasons. The countermeasures
that have been suggested so far are either not practical or give up on key privacy
aspects. We propose a simple non-interactive variant of the basic protocol that\r\n(security)
Provably prevents replay and (if location data is available) relay attacks.\r\n(privacy)
The data of all parties (even jointly) reveals no information on the location
or time where encounters happened.\r\n(efficiency) The broadcasted message can
fit into 128 bits and uses only basic crypto (commitments and secret key authentication).\r\n\r\nTowards
this end we introduce the concept of “delayed authentication”, which basically
is a message authentication code where verification can be done in two steps,
where the first doesn’t require the key, and the second doesn’t require the message."
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Delayed authentication: Preventing replay and relay attacks in
private contact tracing. In: Progress in Cryptology. Vol 12578. LNCS. Springer
Nature; 2020:3-15. doi:10.1007/978-3-030-65277-7_1'
apa: 'Pietrzak, K. Z. (2020). Delayed authentication: Preventing replay and relay
attacks in private contact tracing. In Progress in Cryptology (Vol. 12578,
pp. 3–15). Bangalore, India: Springer Nature. https://doi.org/10.1007/978-3-030-65277-7_1'
chicago: 'Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and
Relay Attacks in Private Contact Tracing.” In Progress in Cryptology, 12578:3–15.
LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-65277-7_1.'
ieee: 'K. Z. Pietrzak, “Delayed authentication: Preventing replay and relay attacks
in private contact tracing,” in Progress in Cryptology, Bangalore, India,
2020, vol. 12578, pp. 3–15.'
ista: 'Pietrzak KZ. 2020. Delayed authentication: Preventing replay and relay attacks
in private contact tracing. Progress in Cryptology. INDOCRYPT: International Conference
on Cryptology in IndiaLNCS vol. 12578, 3–15.'
mla: 'Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay
Attacks in Private Contact Tracing.” Progress in Cryptology, vol. 12578,
Springer Nature, 2020, pp. 3–15, doi:10.1007/978-3-030-65277-7_1.'
short: K.Z. Pietrzak, in:, Progress in Cryptology, Springer Nature, 2020, pp. 3–15.
conference:
end_date: 2020-12-16
location: Bangalore, India
name: 'INDOCRYPT: International Conference on Cryptology in India'
start_date: 2020-12-13
date_created: 2021-01-03T23:01:23Z
date_published: 2020-12-08T00:00:00Z
date_updated: 2026-04-16T09:33:26Z
day: '08'
department:
- _id: KrPi
doi: 10.1007/978-3-030-65277-7_1
ec_funded: 1
external_id:
isi:
- '000927592800001'
intvolume: ' 12578'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2020/418
month: '12'
oa: 1
oa_version: Preprint
page: 3-15
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Progress in Cryptology
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030652760'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: 'Delayed authentication: Preventing replay and relay attacks in private contact
tracing'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12578
year: '2020'
...
---
_id: '8322'
abstract:
- lang: eng
text: "Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz,
as a method for protecting cryptographic protocols against attacks on the devices
of the honest parties. In a nutshell: a reverse firewall is placed outside of
a device and its goal is to “sanitize” the messages sent by it, in such a way
that a malicious device cannot leak its secrets to the outside world. It is typically
assumed that the cryptographic devices are attacked in a “functionality-preserving
way” (i.e. informally speaking, the functionality of the protocol remains unchanged
under this attacks). In their paper, Mironov and Stephens-Davidowitz construct
a protocol for passively-secure two-party computations with firewalls, leaving
extension of this result to stronger models as an open question.\r\nIn this paper,
we address this problem by constructing a protocol for secure computation with
firewalls that has two main advantages over the original protocol from Eurocrypt
2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary
number n of the parties, and not just for 2). Secondly, it is secure in much stronger
corruption settings, namely in the active corruption model. More precisely: we
consider an adversary that can fully corrupt up to \U0001D45B−1 parties, while
the remaining parties are corrupt in a functionality-preserving way.\r\nOur core
techniques are: malleable commitments and malleable non-interactive zero-knowledge,
which in particular allow us to create a novel protocol for multiparty augmented
coin-tossing into the well with reverse firewalls (that is based on a protocol
of Lindell from Crypto 2001)."
acknowledgement: We would like to thank the anonymous reviewers for their helpful
comments and suggestions. The work was initiated while the first author was in IIT
Madras, India. Part of this work was done while the author was visiting the University
of Warsaw. This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4
founded within the UE 2014–2020 Smart Growth Operational Program. The last author
was supported by the Independent Research Fund Denmark project BETHE and the Concordium
Blockchain Research Center, Aarhus University, Denmark.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Suvradip
full_name: Chakraborty, Suvradip
id: B9CD0494-D033-11E9-B219-A439E6697425
last_name: Chakraborty
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Jesper Buus
full_name: Nielsen, Jesper Buus
last_name: Nielsen
citation:
ama: 'Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs.
In: Advances in Cryptology – CRYPTO 2020. Vol 12171. Springer Nature; 2020:732-762.
doi:10.1007/978-3-030-56880-1_26'
apa: 'Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs.
In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa
Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26'
chicago: Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.”
In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature,
2020. https://doi.org/10.1007/978-3-030-56880-1_26.
ieee: S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,”
in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States,
2020, vol. 12171, pp. 732–762.
ista: 'Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs.
Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology
Conference, LNCS, vol. 12171, 732–762.'
mla: Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.”
Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020,
pp. 732–62, doi:10.1007/978-3-030-56880-1_26.
short: S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology
– CRYPTO 2020, Springer Nature, 2020, pp. 732–762.
conference:
end_date: 2020-08-21
location: Santa Barbara, CA, United States
name: 'CRYPTO: Annual International Cryptology Conference'
start_date: 2020-08-17
date_created: 2020-08-30T22:01:12Z
date_published: 2020-08-10T00:00:00Z
date_updated: 2026-04-16T09:31:34Z
day: '10'
department:
- _id: KrPi
doi: 10.1007/978-3-030-56880-1_26
ec_funded: 1
external_id:
isi:
- '001415325700026'
intvolume: ' 12171'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1317
month: '08'
oa: 1
oa_version: Preprint
page: 732-762
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – CRYPTO 2020
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030568795'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reverse firewalls for actively secure MPCs
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12171
year: '2020'
...
---
_id: '9103'
abstract:
- lang: eng
text: 'We introduce LRT-NG, a set of techniques and an associated toolset that computes
a reachtube (an over-approximation of the set of reachable states over a given
time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the
state-of-the-art Langrangian Reachability and its associated tool LRT. From a
theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses
for the first time an analytically computed metric for the propagated ball which
is proven to minimize the ball’s volume. We emphasize that the metric computation
is the centerpiece of all bloating-based techniques. Secondly, it computes the
next reachset as the intersection of two balls: one based on the Cartesian metric
and the other on the new metric. While the two metrics were previously considered
opposing approaches, their joint use considerably tightens the reachtubes. Thirdly,
it avoids the "wrapping effect" associated with the validated integration of the
center of the reachset, by optimally absorbing the interval approximation in the
radius of the next ball. From a tool-development perspective, LRT-NG is superior
to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD.
This required the implementation of the Lohner method and a Runge-Kutta time-propagation
method. Secondly, it has an improved interface, allowing the input model and initial
conditions to be provided as external input files. Our experiments on a comprehensive
set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance
compared to LRT, CAPD, and Flow*.'
acknowledgement: "The authors would like to thank Ramin Hasani and Guillaume Berger
for intellectual discussions about the research which lead to the generation of
new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant
Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832
and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially
supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Sophie
full_name: Gruenbacher, Sophie
last_name: Gruenbacher
- first_name: Jacek
full_name: Cyranka, Jacek
last_name: Cyranka
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Md Ariful
full_name: Islam, Md Ariful
last_name: Islam
- first_name: Scott A.
full_name: Smolka, Scott A.
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian
reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference
on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042'
apa: 'Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &
Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings
of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563).
Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042'
chicago: 'Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam,
Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.”
In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63.
IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.'
ieee: 'S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R.
Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the
59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South),
2020, vol. 2020, pp. 1556–1563.'
ista: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020.
Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference
on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.'
mla: 'Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.”
Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020,
IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.'
short: S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu,
in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020,
pp. 1556–1563.
conference:
end_date: 2020-12-18
location: Jeju Islang, Korea (South)
name: 'CDC: Conference on Decision and Control'
start_date: 2020-12-14
date_created: 2021-02-07T23:01:14Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2026-04-16T09:34:59Z
day: '14'
department:
- _id: ToHe
doi: 10.1109/CDC42340.2020.9304042
external_id:
arxiv:
- '2012.07458'
intvolume: ' 2020'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.07458
month: '12'
oa: 1
oa_version: Preprint
page: 1556-1563
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the 59th IEEE Conference on Decision and Control
publication_identifier:
isbn:
- '9781728174471'
issn:
- 0743-1546
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lagrangian reachtubes: The next generation'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2020
year: '2020'
...
---
_id: '8194'
abstract:
- lang: eng
text: 'Fixed-point arithmetic is a popular alternative to floating-point arithmetic
on embedded systems. Existing work on the verification of fixed-point programs
relies on custom formalizations of fixed-point arithmetic, which makes it hard
to compare the described techniques or reuse the implementations. In this paper,
we address this issue by proposing and formalizing an SMT theory of fixed-point
arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point
theory, and provide formal semantics for it based on rational arithmetic. We also
describe two decision procedures for this theory: one based on the theory of bit-vectors
and the other on the theory of reals. We implement the two decision procedures,
and evaluate our implementations using existing mature SMT solvers on a benchmark
suite we created. Finally, we perform a case study of using the theory we propose
to verify properties of quantized neural networks.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Baranowski, Marek
last_name: Baranowski
- first_name: Shaobo
full_name: He, Shaobo
last_name: He
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Thanh Son
full_name: Nguyen, Thanh Son
last_name: Nguyen
- first_name: Zvonimir
full_name: Rakamarić, Zvonimir
last_name: Rakamarić
citation:
ama: 'Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point
arithmetic. In: Automated Reasoning. Vol 12166. Springer Nature; 2020:13-31.
doi:10.1007/978-3-030-51074-9_2'
apa: 'Baranowski, M., He, S., Lechner, M., Nguyen, T. S., & Rakamarić, Z. (2020).
An SMT theory of fixed-point arithmetic. In Automated Reasoning (Vol. 12166,
pp. 13–31). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-030-51074-9_2'
chicago: Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir
Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In Automated Reasoning,
12166:13–31. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-51074-9_2.
ieee: M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT
theory of fixed-point arithmetic,” in Automated Reasoning, Paris, France,
2020, vol. 12166, pp. 13–31.
ista: 'Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory
of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference
on Automated Reasoning, LNCS, vol. 12166, 13–31.'
mla: Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” Automated
Reasoning, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:10.1007/978-3-030-51074-9_2.
short: M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated
Reasoning, Springer Nature, 2020, pp. 13–31.
conference:
end_date: 2020-07-04
location: Paris, France
name: 'IJCAR: International Joint Conference on Automated Reasoning'
start_date: 2020-07-01
date_created: 2020-08-02T22:00:59Z
date_published: 2020-06-24T00:00:00Z
date_updated: 2026-04-16T09:29:42Z
day: '24'
department:
- _id: ToHe
doi: 10.1007/978-3-030-51074-9_2
external_id:
isi:
- '000884318000002'
intvolume: ' 12166'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-030-51074-9_2
month: '06'
oa: 1
oa_version: Published Version
page: 13-31
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Automated Reasoning
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030510732'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An SMT theory of fixed-point arithmetic
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12166
year: '2020'
...
---
_id: '7684'
article_processing_charge: No
article_type: original
author:
- first_name: Igor
full_name: Gridchyn, Igor
id: 4B60654C-F248-11E8-B48F-1D18A9856A87
last_name: Gridchyn
orcid: 0000-0002-1807-1929
- first_name: Philipp
full_name: Schönenberger, Philipp
id: 3B9D816C-F248-11E8-B48F-1D18A9856A87
last_name: Schönenberger
- first_name: Joseph
full_name: O'Neill, Joseph
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. Assembly-specific disruption
of hippocampal replay leads to selective memory deficit. Neuron. 2020;106(2):291-300.e6.
doi:10.1016/j.neuron.2020.01.021
apa: Gridchyn, I., Schönenberger, P., O’Neill, J., & Csicsvari, J. L. (2020).
Assembly-specific disruption of hippocampal replay leads to selective memory deficit.
Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2020.01.021
chicago: Gridchyn, Igor, Philipp Schönenberger, Joseph O’Neill, and Jozsef L Csicsvari.
“Assembly-Specific Disruption of Hippocampal Replay Leads to Selective Memory
Deficit.” Neuron. Elsevier, 2020. https://doi.org/10.1016/j.neuron.2020.01.021.
ieee: I. Gridchyn, P. Schönenberger, J. O’Neill, and J. L. Csicsvari, “Assembly-specific
disruption of hippocampal replay leads to selective memory deficit,” Neuron,
vol. 106, no. 2. Elsevier, p. 291–300.e6, 2020.
ista: Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. 2020. Assembly-specific
disruption of hippocampal replay leads to selective memory deficit. Neuron. 106(2),
291–300.e6.
mla: Gridchyn, Igor, et al. “Assembly-Specific Disruption of Hippocampal Replay
Leads to Selective Memory Deficit.” Neuron, vol. 106, no. 2, Elsevier,
2020, p. 291–300.e6, doi:10.1016/j.neuron.2020.01.021.
short: I. Gridchyn, P. Schönenberger, J. O’Neill, J.L. Csicsvari, Neuron 106 (2020)
291–300.e6.
date_created: 2020-04-26T22:00:45Z
date_published: 2020-04-22T00:00:00Z
date_updated: 2026-04-16T09:29:06Z
day: '22'
department:
- _id: JoCs
doi: 10.1016/j.neuron.2020.01.021
ec_funded: 1
external_id:
isi:
- '000528268200013'
pmid:
- '32070475'
intvolume: ' 106'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.neuron.2020.01.021
month: '04'
oa: 1
oa_version: Published Version
page: 291-300.e6
pmid: 1
project:
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
publication: Neuron
publication_identifier:
eissn:
- 1097-4199
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/librarian-of-memory/
scopus_import: '1'
status: public
title: Assembly-specific disruption of hippocampal replay leads to selective memory
deficit
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 106
year: '2020'
...
---
_id: '7808'
abstract:
- lang: eng
text: Quantization converts neural networks into low-bit fixed-point computations
which can be carried out by efficient integer-only hardware, and is standard practice
for the deployment of neural networks on real-time embedded devices. However,
like their real-numbered counterpart, quantized networks are not immune to malicious
misclassification caused by adversarial attacks. We investigate how quantization
affects a network’s robustness to adversarial attacks, which is a formal verification
question. We show that neither robustness nor non-robustness are monotonic with
changing the number of bits for the representation and, also, neither are preserved
by quantization from a real-numbered network. For this reason, we introduce a
verification method for quantized neural networks which, using SMT solving over
bit-vectors, accounts for their exact, bit-precise semantics. We built a tool
and analyzed the effect of quantization on a classifier for the MNIST dataset.
We demonstrate that, compared to our method, existing methods for the analysis
of real-numbered networks often derive false conclusions about their quantizations,
both when determining robustness and when detecting attacks, and that existing
methods for quantized networks often miss attacks. Furthermore, we applied our
method beyond robustness, showing how the number of bits in quantization enlarges
the gender bias of a predictor for students’ grades.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
citation:
ama: 'Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize
your neural network? In: International Conference on Tools and Algorithms for
the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97.
doi:10.1007/978-3-030-45237-7_5'
apa: 'Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does
it take to quantize your neural network? In International Conference on Tools
and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp.
79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5'
chicago: Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits
Does It Take to Quantize Your Neural Network?” In International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97.
Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5.
ieee: M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take
to quantize your neural network?,” in International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, Dublin, Ireland,
2020, vol. 12079, pp. 79–97.
ista: 'Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to
quantize your neural network? International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.'
mla: Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural
Network?” International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.
short: M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on
Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature,
2020, pp. 79–97.
conference:
end_date: 2020-04-30
location: Dublin, Ireland
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2020-04-25
corr_author: '1'
date_created: 2020-05-10T22:00:49Z
date_published: 2020-04-17T00:00:00Z
date_updated: 2026-04-16T09:46:07Z
day: '17'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-45237-7_5
external_id:
isi:
- '001288734300005'
file:
- access_level: open_access
checksum: f19905a42891fe5ce93d69143fa3f6fb
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T12:48:15Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7893'
file_name: 2020_TACAS_Giacobbe.pdf
file_size: 2744030
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 12079'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 79-97
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030452360'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: How many bits does it take to quantize your neural network?
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12079
year: '2020'
...
---
_id: '7586'
abstract:
- lang: eng
text: CLC chloride/proton exchangers may support acidification of endolysosomes
and raise their luminal Cl− concentration. Disruption of endosomal ClC‐3 causes
severe neurodegeneration. To assess the importance of ClC‐3 Cl−/H+ exchange, we
now generate Clcn3unc/unc mice in which ClC‐3 is converted into a Cl− channel.
Unlike Clcn3−/− mice, Clcn3unc/unc mice appear normal owing to compensation by
ClC‐4 with which ClC‐3 forms heteromers. ClC‐4 protein levels are strongly reduced
in Clcn3−/−, but not in Clcn3unc/unc mice because ClC‐3unc binds and stabilizes
ClC‐4 like wild‐type ClC‐3. Although mice lacking ClC‐4 appear healthy, its absence
in Clcn3unc/unc/Clcn4−/− mice entails even stronger neurodegeneration than observed
in Clcn3−/− mice. A fraction of ClC‐3 is found on synaptic vesicles, but miniature
postsynaptic currents and synaptic vesicle acidification are not affected in Clcn3unc/unc
or Clcn3−/− mice before neurodegeneration sets in. Both, Cl−/H+‐exchange activity
and the stabilizing effect on ClC‐4, are central to the biological function of
ClC‐3.
acknowledgement: "We thank T. Stauber and T. Breiderhoff for cloning expression constructs;
K. Räbel, S. Hohensee, and C. Backhaus for technical assistance; R. Jahn (MPIbpc,
Göttingen) for providing the equipment required for SV purification; and A\r\nWoehler
(MDC, Berlin) for assistance with SV imaging. Supported, in part, by grants from
the Deutsche Forschungsgemeinschaft (JE164/9-2, SFB740 TP C5, FOR 2625 (JE164/14-1),
NeuroCure Cluster of Excellence), the European Research Council Advanced Grant CYTOVOLION
(ERC 294435) and the Prix Louis-Jeantet de Médecine to TJJ, and Peter and Traudl
Engelhorn fellowship to ZF."
article_number: e103358
article_processing_charge: No
article_type: original
author:
- first_name: Stefanie
full_name: Weinert, Stefanie
last_name: Weinert
- first_name: Niclas
full_name: Gimber, Niclas
last_name: Gimber
- first_name: Dorothea
full_name: Deuschel, Dorothea
last_name: Deuschel
- first_name: Till
full_name: Stuhlmann, Till
last_name: Stuhlmann
- first_name: Dmytro
full_name: Puchkov, Dmytro
last_name: Puchkov
- first_name: Zohreh
full_name: Farsi, Zohreh
last_name: Farsi
- first_name: Carmen F.
full_name: Ludwig, Carmen F.
last_name: Ludwig
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Karen I.
full_name: López-Cayuqueo, Karen I.
last_name: López-Cayuqueo
- first_name: Rosa
full_name: Planells-Cases, Rosa
last_name: Planells-Cases
- first_name: Thomas J.
full_name: Jentsch, Thomas J.
last_name: Jentsch
citation:
ama: Weinert S, Gimber N, Deuschel D, et al. Uncoupling endosomal CLC chloride/proton
exchange causes severe neurodegeneration. EMBO Journal. 2020;39. doi:10.15252/embj.2019103358
apa: Weinert, S., Gimber, N., Deuschel, D., Stuhlmann, T., Puchkov, D., Farsi, Z.,
… Jentsch, T. J. (2020). Uncoupling endosomal CLC chloride/proton exchange causes
severe neurodegeneration. EMBO Journal. EMBO Press. https://doi.org/10.15252/embj.2019103358
chicago: Weinert, Stefanie, Niclas Gimber, Dorothea Deuschel, Till Stuhlmann, Dmytro
Puchkov, Zohreh Farsi, Carmen F. Ludwig, et al. “Uncoupling Endosomal CLC Chloride/Proton
Exchange Causes Severe Neurodegeneration.” EMBO Journal. EMBO Press, 2020.
https://doi.org/10.15252/embj.2019103358.
ieee: S. Weinert et al., “Uncoupling endosomal CLC chloride/proton exchange
causes severe neurodegeneration,” EMBO Journal, vol. 39. EMBO Press, 2020.
ista: Weinert S, Gimber N, Deuschel D, Stuhlmann T, Puchkov D, Farsi Z, Ludwig CF,
Novarino G, López-Cayuqueo KI, Planells-Cases R, Jentsch TJ. 2020. Uncoupling
endosomal CLC chloride/proton exchange causes severe neurodegeneration. EMBO Journal.
39, e103358.
mla: Weinert, Stefanie, et al. “Uncoupling Endosomal CLC Chloride/Proton Exchange
Causes Severe Neurodegeneration.” EMBO Journal, vol. 39, e103358, EMBO
Press, 2020, doi:10.15252/embj.2019103358.
short: S. Weinert, N. Gimber, D. Deuschel, T. Stuhlmann, D. Puchkov, Z. Farsi, C.F.
Ludwig, G. Novarino, K.I. López-Cayuqueo, R. Planells-Cases, T.J. Jentsch, EMBO
Journal 39 (2020).
date_created: 2020-03-15T23:00:55Z
date_published: 2020-03-02T00:00:00Z
date_updated: 2026-04-16T09:35:48Z
day: '02'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.15252/embj.2019103358
external_id:
isi:
- '000517335000001'
pmid:
- '32118314'
file:
- access_level: open_access
checksum: 82750a7a93e3740decbce8474004111a
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T13:51:11Z
date_updated: 2020-07-14T12:48:00Z
file_id: '7615'
file_name: 2020_EMBO_Weinert.pdf
file_size: 12243278
relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: ' 39'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: EMBO Journal
publication_identifier:
eissn:
- 1460-2075
issn:
- 0261-4189
publication_status: published
publisher: EMBO Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '6761'
abstract:
- lang: eng
text: In resource allocation games, selfish players share resources that are needed
in order to fulfill their objectives. The cost of using a resource depends on
the load on it. In the traditional setting, the players make their choices concurrently
and in one-shot. That is, a strategy for a player is a subset of the resources.
We introduce and study dynamic resource allocation games. In this setting, the
game proceeds in phases. In each phase each player chooses one resource. A scheduler
dictates the order in which the players proceed in a phase, possibly scheduling
several players to proceed concurrently. The game ends when each player has collected
a set of resources that fulfills his objective. The cost for each player then
depends on this set as well as on the load on the resources in it – we consider
both congestion and cost-sharing games. We argue that the dynamic setting is the
suitable setting for many applications in practice. We study the stability of
dynamic resource allocation games, where the appropriate notion of stability is
that of subgame perfect equilibrium, study the inefficiency incurred due to selfish
behavior, and also study problems that are particular to the dynamic setting,
like constraints on the order in which resources can be chosen or the problem
of finding a scheduler that achieves stability.
article_processing_charge: No
article_type: original
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical
Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
apa: Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation
games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031
chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation
Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.
ieee: G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,”
Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
ista: Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games.
Theoretical Computer Science. 807, 42–55.
mla: Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer
Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.
short: G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020)
42–55.
date_created: 2019-08-04T21:59:20Z
date_published: 2020-02-06T00:00:00Z
date_updated: 2026-04-16T09:35:15Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2019.06.031
external_id:
isi:
- '000512219400004'
file:
- access_level: open_access
checksum: e86635417f45eb2cd75778f91382f737
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:31:22Z
date_updated: 2020-10-09T06:31:22Z
file_id: '8639'
file_name: 2020_TheoreticalCS_Avni.pdf
file_size: 1413001
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:31:22Z
has_accepted_license: '1'
intvolume: ' 807'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 42-55
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '1341'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic resource allocation games
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 807
year: '2020'
...
---
_id: '7623'
abstract:
- lang: eng
text: A two-dimensional mathematical model for cells migrating without adhesion
capabilities is presented and analyzed. Cells are represented by their cortex,
which is modeled as an elastic curve, subject to an internal pressure force. Net
polymerization or depolymerization in the cortex is modeled via local addition
or removal of material, driving a cortical flow. The model takes the form of a
fully nonlinear degenerate parabolic system. An existence analysis is carried
out by adapting ideas from the theory of gradient flows. Numerical simulations
show that these simple rules can account for the behavior observed in experiments,
suggesting a possible mechanical mechanism for adhesion-independent motility.
acknowledgement: This work has been supported by the Vienna Science and Technology
Fund, Grant no. LS13-029. G.J. and C.S. also acknowledge support by the Austrian
Science Fund, Grants no. W1245, F 65, and W1261, as well as by the Fondation Sciences
Mathématiques de Paris, and by Paris-Sciences-et-Lettres.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gaspard
full_name: Jankowiak, Gaspard
last_name: Jankowiak
- first_name: Diane
full_name: Peurichard, Diane
last_name: Peurichard
- first_name: Anne
full_name: Reversat, Anne
id: 35B76592-F248-11E8-B48F-1D18A9856A87
last_name: Reversat
orcid: 0000-0003-0666-8928
- first_name: Christian
full_name: Schmeiser, Christian
last_name: Schmeiser
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Jankowiak G, Peurichard D, Reversat A, Schmeiser C, Sixt MK. Modeling adhesion-independent
cell migration. Mathematical Models and Methods in Applied Sciences. 2020;30(3):513-537.
doi:10.1142/S021820252050013X
apa: Jankowiak, G., Peurichard, D., Reversat, A., Schmeiser, C., & Sixt, M.
K. (2020). Modeling adhesion-independent cell migration. Mathematical Models
and Methods in Applied Sciences. World Scientific Publishing. https://doi.org/10.1142/S021820252050013X
chicago: Jankowiak, Gaspard, Diane Peurichard, Anne Reversat, Christian Schmeiser,
and Michael K Sixt. “Modeling Adhesion-Independent Cell Migration.” Mathematical
Models and Methods in Applied Sciences. World Scientific Publishing, 2020.
https://doi.org/10.1142/S021820252050013X.
ieee: G. Jankowiak, D. Peurichard, A. Reversat, C. Schmeiser, and M. K. Sixt, “Modeling
adhesion-independent cell migration,” Mathematical Models and Methods in Applied
Sciences, vol. 30, no. 3. World Scientific Publishing, pp. 513–537, 2020.
ista: Jankowiak G, Peurichard D, Reversat A, Schmeiser C, Sixt MK. 2020. Modeling
adhesion-independent cell migration. Mathematical Models and Methods in Applied
Sciences. 30(3), 513–537.
mla: Jankowiak, Gaspard, et al. “Modeling Adhesion-Independent Cell Migration.”
Mathematical Models and Methods in Applied Sciences, vol. 30, no. 3, World
Scientific Publishing, 2020, pp. 513–37, doi:10.1142/S021820252050013X.
short: G. Jankowiak, D. Peurichard, A. Reversat, C. Schmeiser, M.K. Sixt, Mathematical
Models and Methods in Applied Sciences 30 (2020) 513–537.
date_created: 2020-03-31T11:25:05Z
date_published: 2020-03-18T00:00:00Z
date_updated: 2026-04-16T09:35:31Z
day: '18'
department:
- _id: MiSi
doi: 10.1142/S021820252050013X
external_id:
arxiv:
- '1903.09426'
isi:
- '000525349900003'
intvolume: ' 30'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.09426
month: '03'
oa: 1
oa_version: Preprint
page: 513-537
project:
- _id: 25AD6156-B435-11E9-9278-68D0E5697425
grant_number: LS13-029
name: Modeling of Polarization and Motility of Leukocytes in Three-Dimensional Environments
publication: Mathematical Models and Methods in Applied Sciences
publication_identifier:
issn:
- 0218-2025
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modeling adhesion-independent cell migration
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 30
year: '2020'
...
---
OA_place: publisher
_id: '8386'
abstract:
- lang: eng
text: "Form versus function is a long-standing debate in various design-related
fields, such as architecture as well as graphic and industrial design. A good
design that balances form and function often requires considerable human effort
and collaboration among experts from different professional fields. Computational
design tools provide a new paradigm for designing functional objects. In computational
design, form and function are represented as mathematical\r\nquantities, with
the help of numerical and combinatorial algorithms, they can assist even novice
users in designing versatile models that exhibit their desired functionality.
This thesis presents three disparate research studies on the computational design
of functional objects: The appearance of 3d print—we optimize the volumetric material
distribution for faithfully replicating colored surface texture in 3d printing;
the dynamic motion of mechanical structures—\r\nour design system helps the novice
user to retarget various mechanical templates with different functionality to
complex 3d shapes; and a more abstract functionality, multistability—our algorithm
automatically generates models that exhibit multiple stable target poses. For
each of these cases, our computational design tools not only ensure the functionality
of the results but also permit the user aesthetic freedom over the form. Moreover,
fabrication constraints\r\nwere taken into account, which allow for the immediate
creation of physical realization via 3D printing or laser cutting."
acknowledged_ssus:
- _id: SSU
acknowledgement: The research in this thesis has received funding from the European
Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie
grant agreement No 642841 (DISTRO) and the European Research Council grant agreement
No 715767 (MATERIALIZABLE). All the research projects in this thesis were also supported
by Scientific Service Units (SSUs) at IST Austria.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
citation:
ama: Zhang R. Structure-aware computational design and its application to 3D printable
volume scattering, mechanism, and multistability. 2020. doi:10.15479/AT:ISTA:8386
apa: Zhang, R. (2020). Structure-aware computational design and its application
to 3D printable volume scattering, mechanism, and multistability. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8386
chicago: Zhang, Ran. “Structure-Aware Computational Design and Its Application to
3D Printable Volume Scattering, Mechanism, and Multistability.” Institute of Science
and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8386.
ieee: R. Zhang, “Structure-aware computational design and its application to 3D
printable volume scattering, mechanism, and multistability,” Institute of Science
and Technology Austria, 2020.
ista: Zhang R. 2020. Structure-aware computational design and its application to
3D printable volume scattering, mechanism, and multistability. Institute of Science
and Technology Austria.
mla: Zhang, Ran. Structure-Aware Computational Design and Its Application to
3D Printable Volume Scattering, Mechanism, and Multistability. Institute of
Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8386.
short: R. Zhang, Structure-Aware Computational Design and Its Application to 3D
Printable Volume Scattering, Mechanism, and Multistability, Institute of Science
and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-09-14T01:04:53Z
date_published: 2020-09-14T00:00:00Z
date_updated: 2026-04-16T10:06:31Z
day: '14'
ddc:
- '003'
degree_awarded: PhD
department:
- _id: BeBi
doi: 10.15479/AT:ISTA:8386
ec_funded: 1
file:
- access_level: closed
checksum: edcf578b6e1c9b0dd81ff72d319b66ba
content_type: application/x-zip-compressed
creator: rzhang
date_created: 2020-09-14T01:02:59Z
date_updated: 2020-09-14T12:18:43Z
file_id: '8388'
file_name: Thesis_Ran.zip
file_size: 1245800191
relation: source_file
- access_level: open_access
checksum: 817e20c33be9247f906925517c56a40d
content_type: application/pdf
creator: rzhang
date_created: 2020-09-15T12:51:53Z
date_updated: 2020-09-15T12:51:53Z
file_id: '8396'
file_name: PhD_thesis_Ran Zhang_20200915.pdf
file_size: 161385316
relation: main_file
success: 1
file_date_updated: 2020-09-15T12:51:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '148'
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '486'
relation: part_of_dissertation
status: public
- id: '1002'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
title: Structure-aware computational design and its application to 3D printable volume
scattering, mechanism, and multistability
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '7966'
abstract:
- lang: eng
text: "For 1≤m≤n, we consider a natural m-out-of-n multi-instance scenario for a
public-key encryption (PKE) scheme. An adversary, given n independent instances
of PKE, wins if he breaks at least m out of the n instances. In this work, we
are interested in the scaling factor of PKE schemes, SF, which measures how well
the difficulty of breaking m out of the n instances scales in m. That is, a scaling
factor SF=ℓ indicates that breaking m out of n instances is at least ℓ times more
difficult than breaking one single instance. A PKE scheme with small scaling factor
hence provides an ideal target for mass surveillance. In fact, the Logjam attack
(CCS 2015) implicitly exploited, among other things, an almost constant scaling
factor of ElGamal over finite fields (with shared group parameters).\r\n\r\nFor
Hashed ElGamal over elliptic curves, we use the generic group model to argue that
the scaling factor depends on the scheme's granularity. In low granularity, meaning
each public key contains its independent group parameter, the scheme has optimal
scaling factor SF=m; In medium and high granularity, meaning all public keys share
the same group parameter, the scheme still has a reasonable scaling factor SF=√m.
Our findings underline that instantiating ElGamal over elliptic curves should
be preferred to finite fields in a multi-instance scenario.\r\n\r\nAs our main
technical contribution, we derive new generic-group lower bounds of Ω(√(mp)) on
the difficulty of solving both the m-out-of-n Gap Discrete Logarithm and the m-out-of-n
Gap Computational Diffie-Hellman problem over groups of prime order p, extending
a recent result by Yun (EUROCRYPT 2015). We establish the lower bound by studying
the hardness of a related computational problem which we call the search-by-hypersurface
problem."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Federico
full_name: Giacon, Federico
last_name: Giacon
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
citation:
ama: 'Auerbach B, Giacon F, Kiltz E. Everybody’s a target: Scalability in public-key
encryption. In: Advances in Cryptology – EUROCRYPT 2020. Vol 12107. Springer
Nature; 2020:475-506. doi:10.1007/978-3-030-45727-3_16'
apa: 'Auerbach, B., Giacon, F., & Kiltz, E. (2020). Everybody’s a target: Scalability
in public-key encryption. In Advances in Cryptology – EUROCRYPT 2020 (Vol.
12107, pp. 475–506). Springer Nature. https://doi.org/10.1007/978-3-030-45727-3_16'
chicago: 'Auerbach, Benedikt, Federico Giacon, and Eike Kiltz. “Everybody’s a Target:
Scalability in Public-Key Encryption.” In Advances in Cryptology – EUROCRYPT
2020, 12107:475–506. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45727-3_16.'
ieee: 'B. Auerbach, F. Giacon, and E. Kiltz, “Everybody’s a target: Scalability
in public-key encryption,” in Advances in Cryptology – EUROCRYPT 2020,
2020, vol. 12107, pp. 475–506.'
ista: 'Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in
public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory
and Applications of Cryptographic Techniques, LNCS, vol. 12107, 475–506.'
mla: 'Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key
Encryption.” Advances in Cryptology – EUROCRYPT 2020, vol. 12107, Springer
Nature, 2020, pp. 475–506, doi:10.1007/978-3-030-45727-3_16.'
short: B. Auerbach, F. Giacon, E. Kiltz, in:, Advances in Cryptology – EUROCRYPT
2020, Springer Nature, 2020, pp. 475–506.
conference:
end_date: 2020-05-15
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2020-05-11
date_created: 2020-06-15T07:13:37Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2026-04-16T10:21:02Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-030-45727-3_16
ec_funded: 1
external_id:
isi:
- '000828688000016'
intvolume: ' 12107'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/364
month: '05'
oa: 1
oa_version: Submitted Version
page: 475-506
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – EUROCRYPT 2020
publication_identifier:
eisbn:
- '9783030457273'
eissn:
- 1611-3349
isbn:
- '9783030457266'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Everybody’s a target: Scalability in public-key encryption'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12107
year: '2020'
...
---
_id: '8623'
abstract:
- lang: eng
text: We introduce the monitoring of trace properties under assumptions. An assumption
limits the space of possible traces that the monitor may encounter. An assumption
may result from knowledge about the system that is being monitored, about the
environment, or about another, connected monitor. We define monitorability under
assumptions and study its theoretical properties. In particular, we show that
for every assumption A, the boolean combinations of properties that are safe or
co-safe relative to A are monitorable under A. We give several examples and constructions
on how an assumption can make a non-monitorable property monitorable, and how
an assumption can make a monitorable property monitorable with fewer resources,
such as integer registers.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Sarac NE. Monitorability under assumptions. In: Runtime Verification.
Vol 12399. Springer Nature; 2020:3-18. doi:10.1007/978-3-030-60508-7_1'
apa: 'Henzinger, T. A., & Sarac, N. E. (2020). Monitorability under assumptions.
In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United
States: Springer Nature. https://doi.org/10.1007/978-3-030-60508-7_1'
chicago: Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.”
In Runtime Verification, 12399:3–18. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-60508-7_1.
ieee: T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in Runtime
Verification, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.
ista: 'Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification.
RV: Runtime Verification, LNCS, vol. 12399, 3–18.'
mla: Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.”
Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.
short: T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020,
pp. 3–18.
conference:
end_date: 2020-10-09
location: Los Angeles, CA, United States
name: 'RV: Runtime Verification'
start_date: 2020-10-06
date_created: 2020-10-07T15:05:37Z
date_published: 2020-10-02T00:00:00Z
date_updated: 2026-04-16T10:22:01Z
day: '02'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-60508-7_1
external_id:
isi:
- '000728160600001'
file:
- access_level: open_access
checksum: 00661f9b7034f52e18bf24fa552b8194
content_type: application/pdf
creator: esarac
date_created: 2020-10-15T14:28:06Z
date_updated: 2020-10-15T14:28:06Z
file_id: '8665'
file_name: monitorability.pdf
file_size: 478148
relation: main_file
success: 1
file_date_updated: 2020-10-15T14:28:06Z
has_accepted_license: '1'
intvolume: ' 12399'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 3-18
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Runtime Verification
publication_identifier:
eisbn:
- '9783030605087'
eissn:
- 1611-3349
isbn:
- '9783030605070'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitorability under assumptions
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12399
year: '2020'
...