---
_id: '1648'
abstract:
- lang: eng
text: Generalized Selective Decryption (GSD), introduced by Panjwani [TCC’07], is
a game for a symmetric encryption scheme Enc that captures the difficulty of proving
adaptive security of certain protocols, most notably the Logical Key Hierarchy
(LKH) multicast encryption protocol. In the GSD game there are n keys k1,...,
kn, which the adversary may adaptively corrupt (learn); moreover, it can ask for
encryptions Encki (kj) of keys under other keys. The adversary’s task is to distinguish
keys (which it cannot trivially compute) from random. Proving the hardness of
GSD assuming only IND-CPA security of Enc is surprisingly hard. Using “complexity
leveraging” loses a factor exponential in n, which makes the proof practically
meaningless. We can think of the GSD game as building a graph on n vertices, where
we add an edge i → j when the adversary asks for an encryption of kj under ki.
If restricted to graphs of depth ℓ, Panjwani gave a reduction that loses only
a factor exponential in ℓ (not n). To date, this is the only non-trivial result
known for GSD. In this paper we give almost-polynomial reductions for large classes
of graphs. Most importantly, we prove the security of the GSD game restricted
to trees losing only a quasi-polynomial factor n3 log n+5. Trees are an important
special case capturing real-world protocols like the LKH protocol. Our new bound
improves upon Panjwani’s on some LKH variants proposed in the literature where
the underlying tree is not balanced. Our proof builds on ideas from the “nested
hybrids” technique recently introduced by Fuchsbauer et al. [Asiacrypt’14] for
proving the adaptive security of constrained PRFs.
alternative_title:
- LNCS
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Zahra
full_name: Jafargholi, Zahra
last_name: Jafargholi
- 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: 'Fuchsbauer G, Jafargholi Z, Pietrzak KZ. A quasipolynomial reduction for generalized
selective decryption on trees. In: Vol 9215. Springer; 2015:601-620. doi:10.1007/978-3-662-47989-6_29'
apa: 'Fuchsbauer, G., Jafargholi, Z., & Pietrzak, K. Z. (2015). A quasipolynomial
reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620).
Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA,
USA: Springer. https://doi.org/10.1007/978-3-662-47989-6_29'
chicago: Fuchsbauer, Georg, Zahra Jafargholi, and Krzysztof Z Pietrzak. “A Quasipolynomial
Reduction for Generalized Selective Decryption on Trees,” 9215:601–20. Springer,
2015. https://doi.org/10.1007/978-3-662-47989-6_29.
ieee: 'G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction
for generalized selective decryption on trees,” presented at the CRYPTO: International
Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.'
ista: 'Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction
for generalized selective decryption on trees. CRYPTO: International Cryptology
Conference, LNCS, vol. 9215, 601–620.'
mla: Fuchsbauer, Georg, et al. A Quasipolynomial Reduction for Generalized Selective
Decryption on Trees. Vol. 9215, Springer, 2015, pp. 601–20, doi:10.1007/978-3-662-47989-6_29.
short: G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.
conference:
end_date: 2015-08-20
location: Santa Barbara, CA, USA
name: 'CRYPTO: International Cryptology Conference'
start_date: 2015-08-16
date_created: 2018-12-11T11:53:14Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:14Z
day: '01'
ddc:
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-662-47989-6_29
ec_funded: 1
file:
- access_level: open_access
checksum: 99b76b3263d5082554d0a9cbdeca3a22
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:31Z
date_updated: 2020-07-14T12:45:08Z
file_id: '5015'
file_name: IST-2016-674-v1+1_389.pdf
file_size: 505618
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9215'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Submitted Version
page: 601 - 620
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5502'
pubrep_id: '674'
quality_controlled: '1'
scopus_import: 1
status: public
title: A quasipolynomial reduction for generalized selective decryption on trees
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9215
year: '2015'
...
---
_id: '1649'
abstract:
- lang: eng
text: 'We extend a commitment scheme based on the learning with errors over rings
(RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge.
Our scheme maps elements from the ring (or equivalently, n elements from '
alternative_title:
- LNCS
author:
- first_name: Fabrice
full_name: Benhamouda, Fabrice
last_name: Benhamouda
- first_name: Stephan
full_name: Krenn, Stephan
last_name: Krenn
- first_name: Vadim
full_name: Lyubashevsky, Vadim
last_name: Lyubashevsky
- 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: Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. Efficient zero-knowledge
proofs for commitments from learning with errors over rings. 2015;9326:305-325.
doi:10.1007/978-3-319-24174-6_16
apa: 'Benhamouda, F., Krenn, S., Lyubashevsky, V., & Pietrzak, K. Z. (2015).
Efficient zero-knowledge proofs for commitments from learning with errors over
rings. Presented at the ESORICS: European Symposium on Research in Computer Security,
Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-24174-6_16'
chicago: Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z
Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with
Errors over Rings.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-24174-6_16.
ieee: F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge
proofs for commitments from learning with errors over rings,” vol. 9326. Springer,
pp. 305–325, 2015.
ista: Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge
proofs for commitments from learning with errors over rings. 9326, 305–325.
mla: Benhamouda, Fabrice, et al. Efficient Zero-Knowledge Proofs for Commitments
from Learning with Errors over Rings. Vol. 9326, Springer, 2015, pp. 305–25,
doi:10.1007/978-3-319-24174-6_16.
short: F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.
conference:
end_date: 2015-09-25
location: Vienna, Austria
name: 'ESORICS: European Symposium on Research in Computer Security'
start_date: 2015-09-21
date_created: 2018-12-11T11:53:15Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:14Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-319-24174-6_16
ec_funded: 1
file:
- access_level: open_access
checksum: 6eac4a485b2aa644b2d3f753ed0b280b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:28Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4883'
file_name: IST-2016-678-v1+1_889.pdf
file_size: 494239
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9326'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 305 - 325
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5501'
pubrep_id: '678'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Efficient zero-knowledge proofs for commitments from learning with errors over
rings
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9326
year: '2015'
...
---
_id: '1650'
abstract:
- lang: eng
text: "We consider the task of deriving a key with high HILL entropy (i.e., being
computationally indistinguishable from a key with high min-entropy) from an unpredictable
source.\r\n\r\nPrevious to this work, the only known way to transform unpredictability
into a key that was ϵ indistinguishable from having min-entropy was via pseudorandomness,
for example by Goldreich-Levin (GL) hardcore bits. This approach has the inherent
limitation that from a source with k bits of unpredictability entropy one can
derive a key of length (and thus HILL entropy) at most k−2log(1/ϵ) bits. In many
settings, e.g. when dealing with biometric data, such a 2log(1/ϵ) bit entropy
loss in not an option. Our main technical contribution is a theorem that states
that in the high entropy regime, unpredictability implies HILL entropy. Concretely,
any variable K with |K|−d bits of unpredictability entropy has the same amount
of so called metric entropy (against real-valued, deterministic distinguishers),
which is known to imply the same amount of HILL entropy. The loss in circuit size
in this argument is exponential in the entropy gap d, and thus this result only
applies for small d (i.e., where the size of distinguishers considered is exponential
in d).\r\n\r\nTo overcome the above restriction, we investigate if it’s possible
to first “condense” unpredictability entropy and make the entropy gap small. We
show that any source with k bits of unpredictability can be condensed into a source
of length k with k−3 bits of unpredictability entropy. Our condenser simply “abuses"
the GL construction and derives a k bit key from a source with k bits of unpredicatibily.
The original GL theorem implies nothing when extracting that many bits, but we
show that in this regime, GL still behaves like a “condenser" for unpredictability.
This result comes with two caveats (1) the loss in circuit size is exponential
in k and (2) we require that the source we start with has no HILL entropy (equivalently,
one can efficiently check if a guess is correct). We leave it as an intriguing
open problem to overcome these restrictions or to prove they’re inherent."
alternative_title:
- LNCS
author:
- first_name: Maciej
full_name: Skórski, Maciej
last_name: Skórski
- first_name: Alexander
full_name: Golovnev, Alexander
last_name: Golovnev
- 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: 'Skórski M, Golovnev A, Pietrzak KZ. Condensed unpredictability . In: Vol 9134.
Springer; 2015:1046-1057. doi:10.1007/978-3-662-47672-7_85'
apa: 'Skórski, M., Golovnev, A., & Pietrzak, K. Z. (2015). Condensed unpredictability (Vol.
9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming,
Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47672-7_85'
chicago: Skórski, Maciej, Alexander Golovnev, and Krzysztof Z Pietrzak. “Condensed
Unpredictability ,” 9134:1046–57. Springer, 2015. https://doi.org/10.1007/978-3-662-47672-7_85.
ieee: 'M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability
,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan,
2015, vol. 9134, pp. 1046–1057.'
ista: 'Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP:
Automata, Languages and Programming, LNCS, vol. 9134, 1046–1057.'
mla: Skórski, Maciej, et al. Condensed Unpredictability . Vol. 9134, Springer,
2015, pp. 1046–57, doi:10.1007/978-3-662-47672-7_85.
short: M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: Automata, Languages and Programming'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:15Z
date_published: 2015-06-20T00:00:00Z
date_updated: 2021-01-12T06:52:15Z
day: '20'
ddc:
- '000'
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-662-47672-7_85
ec_funded: 1
file:
- access_level: open_access
checksum: e808c7eecb631336fc9f9bf2e8d4ecae
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:32Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4693'
file_name: IST-2016-675-v1+1_384.pdf
file_size: 525503
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9134'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1046 - 1057
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5500'
pubrep_id: '675'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Condensed unpredictability '
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '1651'
abstract:
- lang: eng
text: Cryptographic e-cash allows off-line electronic transactions between a bank,
users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions
has been proposed in the literature; however, these traditional e-cash schemes
only allow coins to be transferred once between users and merchants. Ideally,
we would like users to be able to transfer coins between each other multiple times
before deposit, as happens with physical cash. “Transferable” e-cash schemes are
the solution to this problem. Unfortunately, the currently proposed schemes are
either completely impractical or do not achieve the desirable anonymity properties
without compromises, such as assuming the existence of a trusted “judge” who can
trace all coins and users in the system. This paper presents the first efficient
and fully anonymous transferable e-cash scheme without any trusted third parties.
We start by revising the security and anonymity properties of transferable e-cash
to capture issues that were previously overlooked. For our construction we use
the recently proposed malleable signatures by Chase et al. to allow the secure
and anonymous transfer of coins, combined with a new efficient double-spending
detection mechanism. Finally, we discuss an instantiation of our construction.
acknowledgement: Work done as an intern in Microsoft Research Redmond and as a student
at Brown University, where supported by NSF grant 0964379. Supported by the European
Research Council, ERC Starting Grant (259668-PSPC).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Foteini
full_name: Baldimtsi, Foteini
last_name: Baldimtsi
- first_name: Melissa
full_name: Chase, Melissa
last_name: Chase
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Markulf
full_name: Kohlweiss, Markulf
last_name: Kohlweiss
citation:
ama: 'Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. Anonymous transferable e-cash.
In: Public-Key Cryptography - PKC 2015. Vol 9020. Springer; 2015:101-124.
doi:10.1007/978-3-662-46447-2_5'
apa: 'Baldimtsi, F., Chase, M., Fuchsbauer, G., & Kohlweiss, M. (2015). Anonymous
transferable e-cash. In Public-Key Cryptography - PKC 2015 (Vol. 9020,
pp. 101–124). Gaithersburg, MD, United States: Springer. https://doi.org/10.1007/978-3-662-46447-2_5'
chicago: Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss.
“Anonymous Transferable E-Cash.” In Public-Key Cryptography - PKC 2015,
9020:101–24. Springer, 2015. https://doi.org/10.1007/978-3-662-46447-2_5.
ieee: F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable
e-cash,” in Public-Key Cryptography - PKC 2015, Gaithersburg, MD, United
States, 2015, vol. 9020, pp. 101–124.
ista: 'Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable
e-cash. Public-Key Cryptography - PKC 2015. PKC: Public Key Crypography, LNCS,
vol. 9020, 101–124.'
mla: Baldimtsi, Foteini, et al. “Anonymous Transferable E-Cash.” Public-Key Cryptography
- PKC 2015, vol. 9020, Springer, 2015, pp. 101–24, doi:10.1007/978-3-662-46447-2_5.
short: F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography
- PKC 2015, Springer, 2015, pp. 101–124.
conference:
end_date: 2015-04-01
location: Gaithersburg, MD, United States
name: 'PKC: Public Key Crypography'
start_date: 2015-03-30
date_created: 2018-12-11T11:53:15Z
date_published: 2015-03-17T00:00:00Z
date_updated: 2022-05-23T10:08:37Z
day: '17'
department:
- _id: KrPi
doi: 10.1007/978-3-662-46447-2_5
ec_funded: 1
intvolume: ' 9020'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-662-46447-2_5
month: '03'
oa: 1
oa_version: Published Version
page: 101 - 124
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Public-Key Cryptography - PKC 2015
publication_identifier:
isbn:
- 978-3-662-46446-5
publication_status: published
publisher: Springer
publist_id: '5499'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anonymous transferable e-cash
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9020
year: '2015'
...
---
_id: '1652'
abstract:
- lang: eng
text: We develop new theoretical tools for proving lower-bounds on the (amortized)
complexity of certain functions in models of parallel computation. We apply the
tools to construct a class of functions with high amortized memory complexity
in the parallel Random Oracle Model (pROM); a variant of the standard ROM allowing
for batches of simultaneous queries. In particular we obtain a new, more robust,
type of Memory-Hard Functions (MHF); a security primitive which has recently been
gaining acceptance in practice as an effective means of countering brute-force
attacks on security relevant functions. Along the way we also demonstrate an important
shortcoming of previous definitions of MHFs and give a new definition addressing
the problem. The tools we develop represent an adaptation of the powerful pebbling
paradigm (initially introduced by Hewitt and Paterson [HP70] and Cook [Coo73])
to a simple and intuitive parallel setting. We define a simple pebbling game Gp
over graphs which aims to abstract parallel computation in an intuitive way. As
a conceptual contribution we define a measure of pebbling complexity for graphs
called cumulative complexity (CC) and show how it overcomes a crucial shortcoming
(in the parallel setting) exhibited by more traditional complexity measures used
in the past. As a main technical contribution we give an explicit construction
of a constant in-degree family of graphs whose CC in Gp approaches maximality
to within a polylogarithmic factor for any graph of equal size (analogous to the
graphs of Tarjan et. al. [PTC76, LT82] for sequential pebbling games). Finally,
for a given graph G and related function fG, we derive a lower-bound on the amortized
memory complexity of fG in the pROM in terms of the CC of G in the game Gp.
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Vladimir
full_name: Serbinenko, Vladimir
last_name: Serbinenko
citation:
ama: 'Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions.
In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing.
ACM; 2015:595-603. doi:10.1145/2746539.2746622'
apa: 'Alwen, J. F., & Serbinenko, V. (2015). High parallel complexity graphs
and memory-hard functions. In Proceedings of the 47th annual ACM symposium
on Theory of computing (pp. 595–603). Portland, OR, United States: ACM. https://doi.org/10.1145/2746539.2746622'
chicago: Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs
and Memory-Hard Functions.” In Proceedings of the 47th Annual ACM Symposium
on Theory of Computing, 595–603. ACM, 2015. https://doi.org/10.1145/2746539.2746622.
ieee: J. F. Alwen and V. Serbinenko, “High parallel complexity graphs and memory-hard
functions,” in Proceedings of the 47th annual ACM symposium on Theory of computing,
Portland, OR, United States, 2015, pp. 595–603.
ista: 'Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard
functions. Proceedings of the 47th annual ACM symposium on Theory of computing.
STOC: Symposium on the Theory of Computing, 595–603.'
mla: Alwen, Joel F., and Vladimir Serbinenko. “High Parallel Complexity Graphs and
Memory-Hard Functions.” Proceedings of the 47th Annual ACM Symposium on Theory
of Computing, ACM, 2015, pp. 595–603, doi:10.1145/2746539.2746622.
short: J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium
on Theory of Computing, ACM, 2015, pp. 595–603.
conference:
end_date: 2015-06-17
location: Portland, OR, United States
name: 'STOC: Symposium on the Theory of Computing'
start_date: 2015-06-14
date_created: 2018-12-11T11:53:16Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:52:16Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/2746539.2746622
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2014/238
month: '06'
oa: 1
oa_version: Submitted Version
page: 595 - 603
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Proceedings of the 47th annual ACM symposium on Theory of computing
publication_status: published
publisher: ACM
publist_id: '5498'
quality_controlled: '1'
scopus_import: 1
status: public
title: High parallel complexity graphs and memory-hard functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1654'
abstract:
- lang: eng
text: "HMAC and its variant NMAC are the most popular approaches to deriving a MAC
(and more generally, a PRF) from a cryptographic hash function. Despite nearly
two decades of research, their exact security still remains far from understood
in many different contexts. Indeed, recent works have re-surfaced interest for
{\\em generic} attacks, i.e., attacks that treat the compression function of the
underlying hash function as a black box.\r\n\r\nGeneric security can be proved
in a model where the underlying compression function is modeled as a random function
-- yet, to date, the question of proving tight, non-trivial bounds on the generic
security of HMAC/NMAC even as a PRF remains a challenging open question.\r\n\r\nIn
this paper, we ask the question of whether a small modification to HMAC and NMAC
can allow us to exactly characterize the security of the resulting constructions,
while only incurring little penalty with respect to efficiency. To this end, we
present simple variants of NMAC and HMAC, for which we prove tight bounds on the
generic PRF security, expressed in terms of numbers of construction and compression
function queries necessary to break the construction. All of our constructions
are obtained via a (near) {\\em black-box} modification of NMAC and HMAC, which
can be interpreted as an initial step of key-dependent message pre-processing.\r\n\r\nWhile
our focus is on PRF security, a further attractive feature of our new constructions
is that they clearly defeat all recent generic attacks against properties such
as state recovery and universal forgery. These exploit properties of the so-called
``functional graph'' which are not directly accessible in our new constructions. "
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: Gazi P, Pietrzak KZ, Tessaro S. Generic security of NMAC and HMAC with input
whitening. 2015;9453:85-109. doi:10.1007/978-3-662-48800-3_4
apa: 'Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). Generic security of NMAC
and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application
of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48800-3_4'
chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security
of NMAC and HMAC with Input Whitening.” Lecture Notes in Computer Science. Springer,
2015. https://doi.org/10.1007/978-3-662-48800-3_4.
ieee: P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC
with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.
ista: Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with
input whitening. 9453, 85–109.
mla: Gazi, Peter, et al. Generic Security of NMAC and HMAC with Input Whitening.
Vol. 9453, Springer, 2015, pp. 85–109, doi:10.1007/978-3-662-48800-3_4.
short: P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.
conference:
end_date: 2015-12-03
location: Auckland, New Zealand
name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
start_date: 2015-11-29
date_created: 2018-12-11T11:53:17Z
date_published: 2015-12-30T00:00:00Z
date_updated: 2021-01-12T06:52:16Z
day: '30'
ddc:
- '004'
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48800-3_4
ec_funded: 1
file:
- access_level: open_access
checksum: d1e53203db2d8573a560995ccdffac62
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:09Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4732'
file_name: IST-2016-676-v1+1_881.pdf
file_size: 512071
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9453'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 85 - 109
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5496'
pubrep_id: '676'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Generic security of NMAC and HMAC with input whitening
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9453
year: '2015'
...
---
_id: '1655'
abstract:
- lang: eng
text: Quantifying behaviors of robots which were generated autonomously from task-independent
objective functions is an important prerequisite for objective comparisons of
algorithms and movements of animals. The temporal sequence of such a behavior
can be considered as a time series and hence complexity measures developed for
time series are natural candidates for its quantification. The predictive information
and the excess entropy are such complexity measures. They measure the amount of
information the past contains about the future and thus quantify the nonrandom
structure in the temporal sequence. However, when using these measures for systems
with continuous states one has to deal with the fact that their values will depend
on the resolution with which the systems states are observed. For deterministic
systems both measures will diverge with increasing resolution. We therefore propose
a new decomposition of the excess entropy in resolution dependent and resolution
independent parts and discuss how they depend on the dimensionality of the dynamics,
correlations and the noise level. For the practical estimation we propose to use
estimates based on the correlation integral instead of the direct estimation of
the mutual information based on next neighbor statistics because the latter allows
less control of the scale dependencies. Using our algorithm we are able to show
how autonomous learning generates behavior of increasing complexity with increasing
learning duration.
acknowledgement: This work was supported by the DFG priority program 1527 (Autonomous
Learning) and by the European Community’s Seventh Framework Programme (FP7/2007-2013)
under grant agreement no. 318723 (MatheMACS) and from the People Programme (Marie
Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013)
under REA grant agreement no. 291734.
article_processing_charge: No
author:
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
- first_name: Eckehard
full_name: Olbrich, Eckehard
last_name: Olbrich
citation:
ama: Martius GS, Olbrich E. Quantifying emergent behavior of autonomous robots.
Entropy. 2015;17(10):7266-7297. doi:10.3390/e17107266
apa: Martius, G. S., & Olbrich, E. (2015). Quantifying emergent behavior of
autonomous robots. Entropy. MDPI. https://doi.org/10.3390/e17107266
chicago: Martius, Georg S, and Eckehard Olbrich. “Quantifying Emergent Behavior
of Autonomous Robots.” Entropy. MDPI, 2015. https://doi.org/10.3390/e17107266.
ieee: G. S. Martius and E. Olbrich, “Quantifying emergent behavior of autonomous
robots,” Entropy, vol. 17, no. 10. MDPI, pp. 7266–7297, 2015.
ista: Martius GS, Olbrich E. 2015. Quantifying emergent behavior of autonomous robots.
Entropy. 17(10), 7266–7297.
mla: Martius, Georg S., and Eckehard Olbrich. “Quantifying Emergent Behavior of
Autonomous Robots.” Entropy, vol. 17, no. 10, MDPI, 2015, pp. 7266–97,
doi:10.3390/e17107266.
short: G.S. Martius, E. Olbrich, Entropy 17 (2015) 7266–7297.
date_created: 2018-12-11T11:53:17Z
date_published: 2015-10-23T00:00:00Z
date_updated: 2023-10-17T11:42:00Z
day: '23'
ddc:
- '000'
department:
- _id: ChLa
- _id: GaTk
doi: 10.3390/e17107266
ec_funded: 1
file:
- access_level: open_access
checksum: 945d99631a96e0315acb26dc8541dcf9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:25Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4943'
file_name: IST-2016-464-v1+1_entropy-17-07266.pdf
file_size: 6455007
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 17'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 7266 - 7297
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Entropy
publication_status: published
publisher: MDPI
publist_id: '5495'
pubrep_id: '464'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantifying emergent behavior of autonomous robots
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2015'
...
---
_id: '1656'
abstract:
- lang: eng
text: Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata, nor in any other know
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata which makes it possible to express important
quantitative properties such as average response time. In nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in run-time verification. We establish an almost complete
decidability picture for the basic decision problems about nested weighted automata,
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499-
N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games),
and Microsoft faculty fellows award.\r\nA Technical Report of the paper is available
at: \r\nhttps://repository.ist.ac.at/331/\r\n"
article_number: '7174926'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: Proceedings
- Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.72'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata.
In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July).
Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Automata.” In Proceedings - Symposium on Logic in Computer Science, Vol.
2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in
Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015,
vol. 2015–July.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings
- Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol.
2015–July, 7174926.'
mla: Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” Proceedings -
Symposium on Logic in Computer Science, vol. 2015–July, 7174926, IEEE, 2015,
doi:10.1109/LICS.2015.72.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic
in Computer Science, IEEE, 2015.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:17Z
date_published: 2015-07-31T00:00:00Z
date_updated: 2023-02-23T12:26:19Z
day: '31'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/LICS.2015.72
ec_funded: 1
external_id:
arxiv:
- '1606.03598'
language:
- iso: eng
month: '07'
oa_version: None
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: The Wittgenstein Prize
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings - Symposium on Logic in Computer Science
publication_status: published
publisher: IEEE
publist_id: '5494'
quality_controlled: '1'
related_material:
record:
- id: '467'
relation: later_version
status: public
- id: '5415'
relation: earlier_version
status: public
- id: '5436'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Nested weighted automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-July
year: '2015'
...
---
_id: '1657'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. There exist two different views: (i) ~the expectation
semantics, where the goal is to optimize the expected mean-payoff objective, and
(ii) ~the satisfaction semantics, where the goal is to maximize the probability
of runs such that the mean-payoff value stays above a given vector. We consider
optimization with respect to both objectives at once, thus unifying the existing
semantics. Precisely, the goal is to optimize the expectation while ensuring the
satisfaction constraint. Our problem captures the notion of optimization with
respect to strategies that are risk-averse (i.e., Ensure certain probabilistic
guarantee). Our main results are as follows: First, we present algorithms for
the decision problems, which are always polynomial in the size of the MDP. We
also show that an approximation of the Pareto curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions. Second, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem. '
acknowledgement: "A Technical Report of this paper is available at: https://repository.ist.ac.at/327\r\n"
alternative_title:
- LICS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Komárková, Zuzana
last_name: Komárková
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff
objectives in Markov decision processes. 2015:244-256. doi:10.1109/LICS.2015.32
apa: 'Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views
on multiple mean-payoff objectives in Markov decision processes. Presented at
the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32'
chicago: Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS.
IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.
ieee: K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple
mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
ista: Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes. , 244–256.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.
short: K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:18Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-02-23T12:26:16Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/LICS.2015.32
ec_funded: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 244 - 256
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: IEEE
publist_id: '5493'
quality_controlled: '1'
related_material:
record:
- id: '466'
relation: later_version
status: public
- id: '5429'
relation: earlier_version
status: public
- id: '5435'
relation: earlier_version
status: public
scopus_import: 1
series_title: LICS
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1658'
abstract:
- lang: eng
text: Continuous-time Markov chain (CTMC) models have become a central tool for
understanding the dynamics of complex reaction networks and the importance of
stochasticity in the underlying biochemical processes. When such models are employed
to answer questions in applications, in order to ensure that the model provides
a sufficiently accurate representation of the real system, it is of vital importance
that the model parameters are inferred from real measured data. This, however,
is often a formidable task and all of the existing methods fail in one case or
the other, usually because the underlying CTMC model is high-dimensional and computationally
difficult to analyze. The parameter inference methods that tend to scale best
in the dimension of the CTMC are based on so-called moment closure approximations.
However, there exists a large number of different moment closure approximations
and it is typically hard to say a priori which of the approximations is the most
suitable for the inference procedure. Here, we propose a moment-based parameter
inference method that automatically chooses the most appropriate moment closure
method. Accordingly, contrary to existing methods, the user is not required to
be experienced in moment closure techniques. In addition to that, our method adaptively
changes the approximation during the parameter inference to ensure that always
the best approximation is used, even in cases where different approximations are
best in different regions of the parameter space.
alternative_title:
- LNCS
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- 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: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Christian
full_name: Schilling, Christian
last_name: Schilling
citation:
ama: Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. Adaptive moment
closure for parameter inference of biochemical reaction networks. 2015;9308:77-89.
doi:10.1007/978-3-319-23401-4_8
apa: 'Bogomolov, S., Henzinger, T. A., Podelski, A., Ruess, J., & Schilling,
C. (2015). Adaptive moment closure for parameter inference of biochemical reaction
networks. Presented at the CMSB: Computational Methods in Systems Biology, Nantes,
France: Springer. https://doi.org/10.1007/978-3-319-23401-4_8'
chicago: Bogomolov, Sergiy, Thomas A Henzinger, Andreas Podelski, Jakob Ruess, and
Christian Schilling. “Adaptive Moment Closure for Parameter Inference of Biochemical
Reaction Networks.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-23401-4_8.
ieee: S. Bogomolov, T. A. Henzinger, A. Podelski, J. Ruess, and C. Schilling, “Adaptive
moment closure for parameter inference of biochemical reaction networks,” vol.
9308. Springer, pp. 77–89, 2015.
ista: Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. 2015. Adaptive
moment closure for parameter inference of biochemical reaction networks. 9308,
77–89.
mla: Bogomolov, Sergiy, et al. Adaptive Moment Closure for Parameter Inference
of Biochemical Reaction Networks. Vol. 9308, Springer, 2015, pp. 77–89, doi:10.1007/978-3-319-23401-4_8.
short: S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, C. Schilling, 9308 (2015)
77–89.
conference:
end_date: 2015-09-18
location: Nantes, France
name: 'CMSB: Computational Methods in Systems Biology'
start_date: 2015-09-16
date_created: 2018-12-11T11:53:18Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2023-02-21T16:17:24Z
day: '01'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1007/978-3-319-23401-4_8
ec_funded: 1
intvolume: ' 9308'
language:
- iso: eng
month: '09'
oa_version: None
page: 77 - 89
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5492'
quality_controlled: '1'
related_material:
record:
- id: '1148'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Adaptive moment closure for parameter inference of biochemical reaction networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9308
year: '2015'
...
---
_id: '1659'
abstract:
- lang: eng
text: 'The target discounted-sum problem is the following: Given a rational discount
factor 0 < λ < 1 and three rational values a, b, and t, does there exist
a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0
w(i)λi equals t? The problem turns out to relate to many fields of mathematics
and computer science, and its decidability question is surprisingly hard to solve.
We solve the finite version of the problem, and show the hardness of the infinite
version, linking it to various areas and open problems in mathematics and computer
science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations
of the Cantor set. We provide some partial results to the infinite version, among
which are solutions to its restriction to eventually-periodic sequences and to
the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving
some open problems on discounted-sum automata, among which are the exact-value
problem for nondeterministic automata over finite words and the universality and
inclusion problems for functional automata.'
acknowledgement: 'A technical report of the article is available at: https://research-explorer.app.ist.ac.at/record/5439'
article_processing_charge: No
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Boker U, Henzinger TA, Otop J. The target discounted-sum problem. In: LICS.
Logic in Computer Science. IEEE; 2015:750-761. doi:10.1109/LICS.2015.74'
apa: 'Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum
problem. In LICS (pp. 750–761). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.74'
chicago: Boker, Udi, Thomas A Henzinger, and Jan Otop. “The Target Discounted-Sum
Problem.” In LICS, 750–61. Logic in Computer Science. IEEE, 2015. https://doi.org/10.1109/LICS.2015.74.
ieee: U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,”
in LICS, Kyoto, Japan, 2015, pp. 750–761.
ista: 'Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS.
LICS: Logic in Computer ScienceLogic in Computer Science, 750–761.'
mla: Boker, Udi, et al. “The Target Discounted-Sum Problem.” LICS, IEEE,
2015, pp. 750–61, doi:10.1109/LICS.2015.74.
short: U. Boker, T.A. Henzinger, J. Otop, in:, LICS, IEEE, 2015, pp. 750–761.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-007-06
date_created: 2018-12-11T11:53:19Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-02-23T12:26:27Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/LICS.2015.74
ec_funded: 1
file:
- access_level: open_access
checksum: 6abebca9c1a620e9e103a8f9222befac
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:53:29Z
date_updated: 2020-07-14T12:45:10Z
file_id: '7852'
file_name: 2015_LICS_Boker.pdf
file_size: 340215
relation: main_file
file_date_updated: 2020-07-14T12:45:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 750 - 761
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: The Wittgenstein Prize
publication: LICS
publication_identifier:
eisbn:
- '978-1-4799-8875-4 '
issn:
- '1043-6871 '
publication_status: published
publisher: IEEE
publist_id: '5491'
quality_controlled: '1'
related_material:
record:
- id: '5439'
relation: earlier_version
status: public
scopus_import: 1
series_title: Logic in Computer Science
status: public
title: The target discounted-sum problem
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1660'
abstract:
- lang: eng
text: We study the pattern frequency vector for runs in probabilistic Vector Addition
Systems with States (pVASS). Intuitively, each configuration of a given pVASS
is assigned one of finitely many patterns, and every run can thus be seen as an
infinite sequence of these patterns. The pattern frequency vector assigns to each
run the limit of pattern frequencies computed for longer and longer prefixes of
the run. If the limit does not exist, then the vector is undefined. We show that
for one-counter pVASS, the pattern frequency vector is defined and takes one of
finitely many values for almost all runs. Further, these values and their associated
probabilities can be approximated up to an arbitrarily small relative error in
polynomial time. For stable two-counter pVASS, we show the same result, but we
do not provide any upper complexity bound. As a byproduct of our study, we discover
counterexamples falsifying some classical results about stochastic Petri nets
published in the 80s.
alternative_title:
- LICS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Stefan
full_name: Kiefer, Stefan
last_name: Kiefer
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
citation:
ama: 'Brázdil T, Kiefer S, Kučera A, Novotný P. Long-run average behaviour of probabilistic
vector addition systems. In: IEEE; 2015:44-55. doi:10.1109/LICS.2015.15'
apa: 'Brázdil, T., Kiefer, S., Kučera, A., & Novotný, P. (2015). Long-run average
behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the
LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.15'
chicago: Brázdil, Tomáš, Stefan Kiefer, Antonín Kučera, and Petr Novotný. “Long-Run
Average Behaviour of Probabilistic Vector Addition Systems,” 44–55. IEEE, 2015.
https://doi.org/10.1109/LICS.2015.15.
ieee: 'T. Brázdil, S. Kiefer, A. Kučera, and P. Novotný, “Long-run average behaviour
of probabilistic vector addition systems,” presented at the LICS: Logic in Computer
Science, Kyoto, Japan, 2015, pp. 44–55.'
ista: 'Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour
of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS,
, 44–55.'
mla: Brázdil, Tomáš, et al. Long-Run Average Behaviour of Probabilistic Vector
Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.
short: T. Brázdil, S. Kiefer, A. Kučera, P. Novotný, in:, IEEE, 2015, pp. 44–55.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:19Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2021-01-12T06:52:20Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2015.15
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1505.02655
month: '07'
oa: 1
oa_version: Preprint
page: 44 - 55
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: IEEE
publist_id: '5490'
quality_controlled: '1'
scopus_import: 1
status: public
title: Long-run average behaviour of probabilistic vector addition systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1661'
abstract:
- lang: eng
text: The computation of the winning set for one-pair Streett objectives and for
k-pair Streett objectives in (standard) graphs as well as in game graphs are central
problems in computer-aided verification, with application to the verification
of closed systems with strong fairness conditions, the verification of open systems,
checking interface compatibility, well-formed ness of specifications, and the
synthesis of reactive systems. We give faster algorithms for the computation of
the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in
game graphs and (2) for k-pair Streett objectives in graphs. For both problems
this represents the first improvement in asymptotic running time in 15 years.
acknowledgement: 'K. C. is supported by the Austrian Science Fund (FWF): P23499-N23
and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft
Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23
and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported
by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading
to these results has received funding from the European Research Council under the
European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement
no. 340506.'
article_number: '7174888'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for one-pair
and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer
Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34'
apa: 'Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2015). Improved
algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium
on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer.
“Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings
- Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.
ieee: K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms
for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on
Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V. 2015. Improved algorithms for
one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer
Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.'
mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair
Streett Objectives.” Proceedings - Symposium on Logic in Computer Science,
vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium
on Logic in Computer Science, IEEE, 2015.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:19Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2025-06-02T08:53:41Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2015.34
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprints.cs.univie.ac.at/4368/
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings - Symposium on Logic in Computer Science
publication_status: published
publisher: IEEE
publist_id: '5489'
quality_controlled: '1'
related_material:
record:
- id: '464'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Improved algorithms for one-pair and k-pair Streett objectives
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 2015-July
year: '2015'
...
---
_id: '1663'
abstract:
- lang: eng
text: CREB-binding protein (CBP) and p300 are transcriptional coactivators involved
in numerous biological processes that affect cell growth, transformation, differentiation,
and development. In this study, we provide evidence of the involvement of homeodomain-interacting
protein kinase 2 (HIPK2) in the regulation of CBP activity. We show that HIPK2
interacts with and phosphorylates several regions of CBP. We demonstrate that
serines 2361, 2363, 2371, 2376, and 2381 are responsible for the HIPK2-induced
mobility shift of CBP C-terminal activation domain. Moreover, we show that HIPK2
strongly potentiates the transcriptional activity of CBP. However, our data suggest
that HIPK2 activates CBP mainly by counteracting the repressive action of cell
cycle regulatory domain 1 (CRD1), located between amino acids 977 and 1076, independently
of CBP phosphorylation. Our findings thus highlight a complex regulation of CBP
activity by HIPK2, which might be relevant for the control of specific sets of
target genes involved in cellular proliferation, differentiation and apoptosis.
author:
- first_name: Krisztián
full_name: Kovács, Krisztián
id: 2AB5821E-F248-11E8-B48F-1D18A9856A87
last_name: Kovács
- first_name: Myriam
full_name: Steinmann, Myriam
last_name: Steinmann
- first_name: Olivier
full_name: Halfon, Olivier
last_name: Halfon
- first_name: Pierre
full_name: Magistretti, Pierre
last_name: Magistretti
- first_name: Jean
full_name: Cardinaux, Jean
last_name: Cardinaux
citation:
ama: Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. Complex regulation
of CREB-binding protein by homeodomain-interacting protein kinase 2. Cellular
Signalling. 2015;27(11):2252-2260. doi:10.1016/j.cellsig.2015.08.001
apa: Kovács, K., Steinmann, M., Halfon, O., Magistretti, P., & Cardinaux, J.
(2015). Complex regulation of CREB-binding protein by homeodomain-interacting
protein kinase 2. Cellular Signalling. Elsevier. https://doi.org/10.1016/j.cellsig.2015.08.001
chicago: Kovács, Krisztián, Myriam Steinmann, Olivier Halfon, Pierre Magistretti,
and Jean Cardinaux. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting
Protein Kinase 2.” Cellular Signalling. Elsevier, 2015. https://doi.org/10.1016/j.cellsig.2015.08.001.
ieee: K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, and J. Cardinaux, “Complex
regulation of CREB-binding protein by homeodomain-interacting protein kinase 2,”
Cellular Signalling, vol. 27, no. 11. Elsevier, pp. 2252–2260, 2015.
ista: Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. 2015. Complex
regulation of CREB-binding protein by homeodomain-interacting protein kinase 2.
Cellular Signalling. 27(11), 2252–2260.
mla: Kovács, Krisztián, et al. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting
Protein Kinase 2.” Cellular Signalling, vol. 27, no. 11, Elsevier, 2015,
pp. 2252–60, doi:10.1016/j.cellsig.2015.08.001.
short: K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, J. Cardinaux, Cellular
Signalling 27 (2015) 2252–2260.
date_created: 2018-12-11T11:53:20Z
date_published: 2015-11-01T00:00:00Z
date_updated: 2021-01-12T06:52:22Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1016/j.cellsig.2015.08.001
ec_funded: 1
file:
- access_level: local
checksum: 4ee690b6444b7a43523237f0941457d1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:03Z
date_updated: 2020-07-14T12:45:10Z
file_id: '5321'
file_name: IST-2016-578-v1+1_CLS-D-15-00072R1_.pdf
file_size: 1735337
relation: main_file
file_date_updated: 2020-07-14T12:45:10Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '11'
oa_version: Published Version
page: 2252 - 2260
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Cellular Signalling
publication_status: published
publisher: Elsevier
publist_id: '5487'
pubrep_id: '578'
quality_controlled: '1'
scopus_import: 1
status: public
title: Complex regulation of CREB-binding protein by homeodomain-interacting protein
kinase 2
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2015'
...
---
_id: '1664'
abstract:
- lang: eng
text: Over a century of research into the origin of turbulence in wall-bounded shear
flows has resulted in a puzzling picture in which turbulence appears in a variety
of different states competing with laminar background flow. At moderate flow speeds,
turbulence is confined to localized patches; it is only at higher speeds that
the entire flow becomes turbulent. The origin of the different states encountered
during this transition, the front dynamics of the turbulent regions and the transformation
to full turbulence have yet to be explained. By combining experiments, theory
and computer simulations, here we uncover a bifurcation scenario that explains
the transformation to fully turbulent pipe flow and describe the front dynamics
of the different states encountered in the process. Key to resolving this problem
is the interpretation of the flow as a bistable system with nonlinear propagation
(advection) of turbulent fronts. These findings bridge the gap between our understanding
of the onset of turbulence and fully turbulent flows.
acknowledgement: We acknowledge the Deutsche Forschungsgemeinschaft (Project No. FOR
1182), and the European Research Council under the European Union’s Seventh Framework
Programme (FP/2007-2013)/ERC Grant Agreement 306589 for financial support. B.S.
acknowledges financial support from the Chinese State Scholarship Fund under grant
number 2010629145. B.S. acknowledges support from the International Max Planck Research
School for the Physics of Biological and Complex Systems and the Göttingen Graduate
School for Neurosciences and Molecular Biosciences. We acknowledge computing resources
from GWDG (Gesellschaft für wissenschaftliche Datenverarbeitung Göttingen) and the
Jülich Supercomputing Centre (grant HGU16) where the simulations were performed.
author:
- first_name: Dwight
full_name: Barkley, Dwight
last_name: Barkley
- first_name: Baofang
full_name: Song, Baofang
last_name: Song
- first_name: Mukund
full_name: Vasudevan, Mukund
id: 3C5A959A-F248-11E8-B48F-1D18A9856A87
last_name: Vasudevan
- first_name: Grégoire M
full_name: Lemoult, Grégoire M
id: 4787FE80-F248-11E8-B48F-1D18A9856A87
last_name: Lemoult
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. The rise of fully
turbulent flow. Nature. 2015;526(7574):550-553. doi:10.1038/nature15701
apa: Barkley, D., Song, B., Vasudevan, M., Lemoult, G. M., Avila, M., & Hof,
B. (2015). The rise of fully turbulent flow. Nature. Nature Publishing
Group. https://doi.org/10.1038/nature15701
chicago: Barkley, Dwight, Baofang Song, Mukund Vasudevan, Grégoire M Lemoult, Marc
Avila, and Björn Hof. “The Rise of Fully Turbulent Flow.” Nature. Nature
Publishing Group, 2015. https://doi.org/10.1038/nature15701.
ieee: D. Barkley, B. Song, M. Vasudevan, G. M. Lemoult, M. Avila, and B. Hof, “The
rise of fully turbulent flow,” Nature, vol. 526, no. 7574. Nature Publishing
Group, pp. 550–553, 2015.
ista: Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. 2015. The rise
of fully turbulent flow. Nature. 526(7574), 550–553.
mla: Barkley, Dwight, et al. “The Rise of Fully Turbulent Flow.” Nature,
vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 550–53, doi:10.1038/nature15701.
short: D. Barkley, B. Song, M. Vasudevan, G.M. Lemoult, M. Avila, B. Hof, Nature
526 (2015) 550–553.
date_created: 2018-12-11T11:53:20Z
date_published: 2015-10-21T00:00:00Z
date_updated: 2021-01-12T06:52:22Z
day: '21'
department:
- _id: BjHo
doi: 10.1038/nature15701
ec_funded: 1
intvolume: ' 526'
issue: '7574'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.09143
month: '10'
oa: 1
oa_version: Preprint
page: 550 - 553
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5485'
quality_controlled: '1'
scopus_import: 1
status: public
title: The rise of fully turbulent flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 526
year: '2015'
...
---
_id: '1665'
abstract:
- lang: eng
text: Which genetic alterations drive tumorigenesis and how they evolve over the
course of disease and therapy are central questions in cancer biology. Here we
identify 44 recurrently mutated genes and 11 recurrent somatic copy number variations
through whole-exome sequencing of 538 chronic lymphocytic leukaemia (CLL) and
matched germline DNA samples, 278 of which were collected in a prospective clinical
trial. These include previously unrecognized putative cancer drivers (RPS15, IKZF3),
and collectively identify RNA processing and export, MYC activity, and MAPK signalling
as central pathways involved in CLL. Clonality analysis of this large data set
further enabled reconstruction of temporal relationships between driver events.
Direct comparison between matched pre-treatment and relapse samples from 59 patients
demonstrated highly frequent clonal evolution. Thus, large sequencing data sets
of clinically informative samples enable the discovery of novel genes associated
with cancer, the network of relationships between the driver events, and their
impact on disease relapse and clinical outcome.
article_processing_charge: No
article_type: original
author:
- first_name: Dan
full_name: Landau, Dan
last_name: Landau
- first_name: Eugen
full_name: Tausch, Eugen
last_name: Tausch
- first_name: Amaro
full_name: Taylor Weiner, Amaro
last_name: Taylor Weiner
- first_name: Chip
full_name: Stewart, Chip
last_name: Stewart
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Jasmin
full_name: Bahlo, Jasmin
last_name: Bahlo
- first_name: Sandra
full_name: Kluth, Sandra
last_name: Kluth
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Michael
full_name: Lawrence, Michael
last_name: Lawrence
- first_name: Sebastian
full_name: Böttcher, Sebastian
last_name: Böttcher
- first_name: Scott
full_name: Carter, Scott
last_name: Carter
- first_name: Kristian
full_name: Cibulskis, Kristian
last_name: Cibulskis
- first_name: Daniel
full_name: Mertens, Daniel
last_name: Mertens
- first_name: Carrie
full_name: Sougnez, Carrie
last_name: Sougnez
- first_name: Mara
full_name: Rosenberg, Mara
last_name: Rosenberg
- first_name: Julian
full_name: Hess, Julian
last_name: Hess
- first_name: Jennifer
full_name: Edelmann, Jennifer
last_name: Edelmann
- first_name: Sabrina
full_name: Kless, Sabrina
last_name: Kless
- first_name: Michael
full_name: Kneba, Michael
last_name: Kneba
- first_name: Matthias
full_name: Ritgen, Matthias
last_name: Ritgen
- first_name: Anna
full_name: Fink, Anna
last_name: Fink
- first_name: Kirsten
full_name: Fischer, Kirsten
last_name: Fischer
- first_name: Stacey
full_name: Gabriel, Stacey
last_name: Gabriel
- first_name: Eric
full_name: Lander, Eric
last_name: Lander
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Hartmut
full_name: Döhner, Hartmut
last_name: Döhner
- first_name: Michael
full_name: Hallek, Michael
last_name: Hallek
- first_name: Donna
full_name: Neuberg, Donna
last_name: Neuberg
- first_name: Gad
full_name: Getz, Gad
last_name: Getz
- first_name: Stephan
full_name: Stilgenbauer, Stephan
last_name: Stilgenbauer
- first_name: Catherine
full_name: Wu, Catherine
last_name: Wu
citation:
ama: Landau D, Tausch E, Taylor Weiner A, et al. Mutations driving CLL and their
evolution in progression and relapse. Nature. 2015;526(7574):525-530. doi:10.1038/nature15395
apa: Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo,
J., … Wu, C. (2015). Mutations driving CLL and their evolution in progression
and relapse. Nature. Nature Publishing Group. https://doi.org/10.1038/nature15395
chicago: Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes
Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution
in Progression and Relapse.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature15395.
ieee: D. Landau et al., “Mutations driving CLL and their evolution in progression
and relapse,” Nature, vol. 526, no. 7574. Nature Publishing Group, pp.
525–530, 2015.
ista: Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S,
Božić I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C,
Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K,
Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer
S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse.
Nature. 526(7574), 525–530.
mla: Landau, Dan, et al. “Mutations Driving CLL and Their Evolution in Progression
and Relapse.” Nature, vol. 526, no. 7574, Nature Publishing Group, 2015,
pp. 525–30, doi:10.1038/nature15395.
short: D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo,
S. Kluth, I. Božić, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens,
C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen,
A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D.
Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.
date_created: 2018-12-11T11:53:21Z
date_published: 2015-10-22T00:00:00Z
date_updated: 2021-01-12T06:52:23Z
day: '22'
department:
- _id: KrCh
doi: 10.1038/nature15395
ec_funded: 1
external_id:
pmid:
- '26466571'
intvolume: ' 526'
issue: '7574'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815041/
month: '10'
oa: 1
oa_version: Submitted Version
page: 525 - 530
pmid: 1
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: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5484'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mutations driving CLL and their evolution in progression and relapse
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 526
year: '2015'
...
---
_id: '1666'
abstract:
- lang: eng
text: Evolution of gene regulation is crucial for our understanding of the phenotypic
differences between species, populations and individuals. Sequence-specific binding
of transcription factors to the regulatory regions on the DNA is a key regulatory
mechanism that determines gene expression and hence heritable phenotypic variation.
We use a biophysical model for directional selection on gene expression to estimate
the rates of gain and loss of transcription factor binding sites (TFBS) in finite
populations under both point and insertion/deletion mutations. Our results show
that these rates are typically slow for a single TFBS in an isolated DNA region,
unless the selection is extremely strong. These rates decrease drastically with
increasing TFBS length or increasingly specific protein-DNA interactions, making
the evolution of sites longer than ∼ 10 bp unlikely on typical eukaryotic speciation
timescales. Similarly, evolution converges to the stationary distribution of binding
sequences very slowly, making the equilibrium assumption questionable. The availability
of longer regulatory sequences in which multiple binding sites can evolve simultaneously,
the presence of “pre-sites” or partially decayed old sites in the initial sequence,
and biophysical cooperativity between transcription factors, can all facilitate
gain of TFBS and reconcile theoretical calculations with timescales inferred from
comparative genomics.
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Tugrul M, Paixao T, Barton NH, Tkačik G. Dynamics of transcription factor binding
site evolution. PLoS Genetics. 2015;11(11). doi:10.1371/journal.pgen.1005639
apa: Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Dynamics of
transcription factor binding site evolution. PLoS Genetics. Public Library
of Science. https://doi.org/10.1371/journal.pgen.1005639
chicago: Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Dynamics
of Transcription Factor Binding Site Evolution.” PLoS Genetics. Public
Library of Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.
ieee: M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Dynamics of transcription
factor binding site evolution,” PLoS Genetics, vol. 11, no. 11. Public
Library of Science, 2015.
ista: Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Dynamics of transcription factor
binding site evolution. PLoS Genetics. 11(11).
mla: Tugrul, Murat, et al. “Dynamics of Transcription Factor Binding Site Evolution.”
PLoS Genetics, vol. 11, no. 11, Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.
short: M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, PLoS Genetics 11 (2015).
date_created: 2018-12-11T11:53:21Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2023-09-07T11:53:49Z
day: '06'
ddc:
- '576'
department:
- _id: NiBa
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pgen.1005639
ec_funded: 1
file:
- access_level: open_access
checksum: a4e72fca5ccf40ddacf4d08c8e46b554
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:58Z
date_updated: 2020-07-14T12:45:10Z
file_id: '4657'
file_name: IST-2016-463-v1+1_journal.pgen.1005639.pdf
file_size: 2580778
relation: main_file
file_date_updated: 2020-07-14T12:45:10Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: PLoS Genetics
publication_status: published
publisher: Public Library of Science
publist_id: '5483'
pubrep_id: '463'
quality_controlled: '1'
related_material:
record:
- id: '9712'
relation: research_data
status: public
- id: '1131'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Dynamics of transcription factor binding site evolution
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2015'
...
---
_id: '1667'
abstract:
- lang: eng
text: We consider parametric version of fixed-delay continuoustime Markov chains
(or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay
transitions are specified by parameters, rather than concrete values. Our goal
is to synthesize values of these parameters that, for a given cost function, minimise
expected total cost incurred before reaching a given set of target states. We
show that under mild assumptions, optimal values of parameters can be effectively
approximated using translation to a Markov decision process (MDP) whose actions
correspond to discretized values of these parameters. To this end we identify
and overcome several interesting phenomena arising in systems with fixed delays.
acknowledgement: The research leading to these results has received funding from the
People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement n∘ [291734]. This work is partly
supported by the German Research Council (DFG) as part of the Transregional Collaborative
Research Center AVACS (SFB/TR 14), by the EU 7th Framework Programme under grant
agreement no. 295261 (MEALS) and 318490 (SENSATION), by the Czech Science Foundation,
grant No. 15-17564S, and by the CAS/SAFEA International Partnership Program for
Creative Research Teams.
alternative_title:
- LNCS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: L'Uboš
full_name: Korenčiak, L'Uboš
last_name: Korenčiak
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Vojtěch
full_name: Řehák, Vojtěch
last_name: Řehák
citation:
ama: Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. Optimizing performance
of continuous-time stochastic systems using timeout synthesis. 2015;9259:141-159.
doi:10.1007/978-3-319-22264-6_10
apa: 'Brázdil, T., Korenčiak, L., Krčál, J., Novotný, P., & Řehák, V. (2015).
Optimizing performance of continuous-time stochastic systems using timeout synthesis.
Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer.
https://doi.org/10.1007/978-3-319-22264-6_10'
chicago: Brázdil, Tomáš, L’Uboš Korenčiak, Jan Krčál, Petr Novotný, and Vojtěch
Řehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout
Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22264-6_10.
ieee: T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing
performance of continuous-time stochastic systems using timeout synthesis,” vol.
9259. Springer, pp. 141–159, 2015.
ista: Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance
of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.
mla: Brázdil, Tomáš, et al. Optimizing Performance of Continuous-Time Stochastic
Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10.
short: T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, V. Řehák, 9259 (2015) 141–159.
conference:
end_date: 2015-09-03
location: Madrid, Spain
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2015-09-01
date_created: 2018-12-11T11:53:22Z
date_published: 2015-08-22T00:00:00Z
date_updated: 2021-01-12T06:52:24Z
day: '22'
department:
- _id: KrCh
doi: 10.1007/978-3-319-22264-6_10
ec_funded: 1
intvolume: ' 9259'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.4777
month: '08'
oa: 1
oa_version: Preprint
page: 141 - 159
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5482'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Optimizing performance of continuous-time stochastic systems using timeout
synthesis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9259
year: '2015'
...
---
_id: '1668'
abstract:
- lang: eng
text: "We revisit the security (as a pseudorandom permutation) of cascading-based
constructions for block-cipher key-length extension. Previous works typically
considered the extreme case where the adversary is given the entire codebook of
the construction, the only complexity measure being the number qe of queries to
the underlying ideal block cipher, representing adversary’s secret-key-independent
computation. Here, we initiate a systematic study of the more natural case of
an adversary restricted to adaptively learning a number qc of plaintext/ciphertext
pairs that is less than the entire codebook. For any such qc, we aim to determine
the highest number of block-cipher queries qe the adversary can issue without
being able to successfully distinguish the construction (under a secret key) from
a random permutation.\r\nMore concretely, we show the following results for key-length
extension schemes using a block cipher with n-bit blocks and κ-bit keys:\r\nPlain
cascades of length ℓ=2r+1 are secure whenever qcqre≪2r(κ+n), qc≪2κ and qe≪22κ.
The bound for r=1 also applies to two-key triple encryption (as used within Triple
DES).\r\nThe r-round XOR-cascade is secure as long as qcqre≪2r(κ+n), matching
an attack by Gaži (CRYPTO 2013).\r\nWe fully characterize the security of Gaži
and Tessaro’s two-call "
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Jooyoung
full_name: Lee, Jooyoung
last_name: Lee
- first_name: Yannick
full_name: Seurin, Yannick
last_name: Seurin
- first_name: John
full_name: Steinberger, John
last_name: Steinberger
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. Relaxing full-codebook
security: A refined analysis of key-length extension schemes. 2015;9054:319-341.
doi:10.1007/978-3-662-48116-5_16'
apa: 'Gazi, P., Lee, J., Seurin, Y., Steinberger, J., & Tessaro, S. (2015).
Relaxing full-codebook security: A refined analysis of key-length extension schemes.
Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer. https://doi.org/10.1007/978-3-662-48116-5_16'
chicago: 'Gazi, Peter, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano
Tessaro. “Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension
Schemes.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48116-5_16.'
ieee: 'P. Gazi, J. Lee, Y. Seurin, J. Steinberger, and S. Tessaro, “Relaxing full-codebook
security: A refined analysis of key-length extension schemes,” vol. 9054. Springer,
pp. 319–341, 2015.'
ista: 'Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. 2015. Relaxing full-codebook
security: A refined analysis of key-length extension schemes. 9054, 319–341.'
mla: 'Gazi, Peter, et al. Relaxing Full-Codebook Security: A Refined Analysis
of Key-Length Extension Schemes. Vol. 9054, Springer, 2015, pp. 319–41, doi:10.1007/978-3-662-48116-5_16.'
short: P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 319–341.
conference:
end_date: 2015-03-11
location: Istanbul, Turkey
name: 'FSE: Fast Software Encryption'
start_date: 2015-03-08
date_created: 2018-12-11T11:53:22Z
date_published: 2015-08-12T00:00:00Z
date_updated: 2020-08-11T10:09:26Z
day: '12'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48116-5_16
ec_funded: 1
intvolume: ' 9054'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2015/397
month: '08'
oa: 1
oa_version: Submitted Version
page: 319 - 341
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5481'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'Relaxing full-codebook security: A refined analysis of key-length extension
schemes'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9054
year: '2015'
...
---
_id: '1669'
abstract:
- lang: eng
text: Computational notions of entropy (a.k.a. pseudoentropy) have found many applications,
including leakage-resilient cryptography, deterministic encryption or memory delegation.
The most important tools to argue about pseudoentropy are chain rules, which quantify
by how much (in terms of quantity and quality) the pseudoentropy of a given random
variable X decreases when conditioned on some other variable Z (think for example
of X as a secret key and Z as information leaked by a side-channel). In this paper
we give a very simple and modular proof of the chain rule for HILL pseudoentropy,
improving best known parameters. Our version allows for increasing the acceptable
length of leakage in applications up to a constant factor compared to the best
previous bounds. As a contribution of independent interest, we provide a comprehensive
study of all known versions of the chain rule, comparing their worst-case strength
and limitations.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Maciej
full_name: Skórski, Maciej
last_name: Skórski
citation:
ama: Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98.
doi:10.1007/978-3-319-22174-8_5
apa: 'Pietrzak, K. Z., & Skórski, M. (2015). The chain rule for HILL pseudoentropy,
revisited. Presented at the LATINCRYPT: Cryptology and Information Security in
Latin America, Guadalajara, Mexico: Springer. https://doi.org/10.1007/978-3-319-22174-8_5'
chicago: Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy,
Revisited.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22174-8_5.
ieee: K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,”
vol. 9230. Springer, pp. 81–98, 2015.
ista: Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited.
9230, 81–98.
mla: Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy,
Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.
short: K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.
conference:
end_date: 2015-08-26
location: Guadalajara, Mexico
name: 'LATINCRYPT: Cryptology and Information Security in Latin America'
start_date: 2015-08-23
date_created: 2018-12-11T11:53:22Z
date_published: 2015-08-15T00:00:00Z
date_updated: 2021-01-12T06:52:24Z
day: '15'
ddc:
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-319-22174-8_5
ec_funded: 1
file:
- access_level: open_access
checksum: 8cd4215b83efba720e8cf27c23ff4781
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:29Z
date_updated: 2020-07-14T12:45:11Z
file_id: '5351'
file_name: IST-2016-669-v1+1_599.pdf
file_size: 443340
relation: main_file
file_date_updated: 2020-07-14T12:45:11Z
has_accepted_license: '1'
intvolume: ' 9230'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 81 - 98
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5480'
pubrep_id: '669'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: The chain rule for HILL pseudoentropy, revisited
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9230
year: '2015'
...