---
_id: '34963'
author:
- first_name: A
full_name: Anonymous, A
last_name: Anonymous
citation:
ama: Anonymous A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference.;
2022.
apa: Anonymous, A. (2022). Cost of Privacy-preserving SMPC Protocols for NN-Based
Inference.
bibtex: '@book{Anonymous_2022, title={Cost of Privacy-preserving SMPC Protocols
for NN-Based Inference}, author={Anonymous, A}, year={2022} }'
chicago: Anonymous, A. Cost of Privacy-Preserving SMPC Protocols for NN-Based
Inference, 2022.
ieee: A. Anonymous, Cost of Privacy-preserving SMPC Protocols for NN-Based Inference.
2022.
mla: Anonymous, A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference.
2022.
short: A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference,
2022.
date_created: 2022-12-24T00:16:39Z
date_updated: 2023-01-10T10:31:49Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Cost of Privacy-preserving SMPC Protocols for NN-Based Inference
type: mastersthesis
user_id: '41047'
year: '2022'
...
---
_id: '28998'
author:
- first_name: Dennis
full_name: Suermann, Dennis
last_name: Suermann
citation:
ama: Suermann D. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des
Relay-Layers.; 2021.
apa: Suermann, D. (2021). Schutz und Stabilisierung von Overlay-Netzwerken mithilfe
des Relay-Layers.
bibtex: '@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken
mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }'
chicago: Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe
Des Relay-Layers, 2021.
ieee: D. Suermann, Schutz und Stabilisierung von Overlay-Netzwerken mithilfe
des Relay-Layers. 2021.
mla: Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe
Des Relay-Layers. 2021.
short: D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des
Relay-Layers, 2021.
date_created: 2021-12-16T06:41:25Z
date_updated: 2022-01-06T06:58:43Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '21197'
author:
- first_name: Ma
full_name: Mengshi, Ma
last_name: Mengshi
citation:
ama: Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter.; 2021.
apa: Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with
a Low Diameter.
bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning
Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }'
chicago: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with
a Low Diameter, 2021.
ieee: M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter. 2021.
mla: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter. 2021.
short: M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter, 2021.
date_created: 2021-02-09T07:09:22Z
date_updated: 2022-01-06T06:54:49Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '22283'
abstract:
- lang: eng
text: " We show how to construct an overlay network of constant degree and diameter
$O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected
graph.\r\n We assume a synchronous communication network in which nodes can
send messages to nodes they know the identifier of and establish new connections
by sending node identifiers.\r\n If the initial network's graph is weakly connected
and has constant degree, then our algorithm constructs the desired topology with
each node sending and receiving only $O(\\log n)$ messages in each round in time
$O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm
of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster
than by using pointer jumping for $O(\\log n)$ rounds (which would even require
each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n
\ We achieve this speedup by using short random walks to repeatedly establish
random connections between the nodes that quickly reduce the conductance of the
graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally,
we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid
networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes
possess two different modes of communication, we assume that communication of
the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically
many messages can be communicated over edges that have been established throughout
an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary
degree, we show how to compute connected components, a spanning tree, and biconnected
components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute
an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial
degree of $G$."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction
of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles
of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932'
apa: 'Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal
Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM.
https://doi.org/10.1145/3465084.3467932'
bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York},
title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932},
booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian
and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor}
}'
chicago: 'Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian
Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren
Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.'
ieee: T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction
of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed
Computing (PODC ’21), Virtual.
mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of
the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21),
edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
short: 'T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel
(Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21), ACM, New York, n.d.'
conference:
end_date: 2021-07-30
location: Virtual
name: ACM Symposium on Principles of Distributed Computing (PODC)
start_date: 2021-07-26
date_created: 2021-06-06T19:10:26Z
date_updated: 2022-01-06T06:55:30Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1145/3465084.3467932
editor:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2021-06-06T19:12:49Z
date_updated: 2021-06-06T19:12:49Z
file_id: '22284'
file_name: Wicked_Fast_Overlay_Construction(1).pdf
file_size: 590875
relation: main_file
success: 1
file_date_updated: 2021-06-06T19:12:49Z
has_accepted_license: '1'
language:
- iso: eng
place: New York
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC '21)
publication_status: accepted
publisher: ACM
status: public
title: Time-Optimal Construction of Overlays
type: conference
user_id: '477'
year: '2021'
...
---
_id: '22057'
abstract:
- lang: eng
text: "We construct more efficient cryptosystems with provable\r\nsecurity against
adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard
model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient,
selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal,
Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost
efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters
and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n–
Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased
IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption,
has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves
full adaptive security with\r\npublic parameters of size only O(log λ). The other
is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext
is\r\nonly a single group element and the security reduction is quadrat-\r\nically
tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n–
A very efficient adaptively-secure verifiable random function where\r\nproofs,
public keys, and secret keys have size O(log λ).\r\nAs a technical contribution
we introduce blockwise partitioning, which\r\nleverages the assumption that a
cryptographic hash function is weak\r\nnear-collision resistant to prove full
adaptive security of cryptosystems."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs
via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021.
Cham; 2021. doi:10.1007/978-3-030-75245-3_22'
apa: Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography
– PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22
bibtex: '@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22},
booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek,
Rafael and Niehues, David}, year={2021} }'
chicago: Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography
– PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22.
ieee: T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and
VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021,
Cham, 2021.
mla: Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision
Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.
short: 'T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021,
Cham, 2021.'
date_created: 2021-05-10T15:56:24Z
date_updated: 2022-01-06T06:55:23Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75245-3_22
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:02:02Z
date_updated: 2021-05-10T16:02:02Z
file_id: '22058'
file_name: Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via
N.pdf
file_size: 701068
relation: main_file
file_date_updated: 2021-05-10T16:02:02Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752446'
- '9783030752453'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '22059'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan
(FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public
verification key and proofs accompanying the\r\noutput enable all parties to verify
the correctness of the output. How-\r\never, all known standard model VRFs have
a reduction loss that is much\r\nworse than what one would expect from known optimal
constructions of\r\nclosely related primitives like unique signatures. We show
that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption
has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries.
To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16)
to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We
answer this ques-\r\ntion in the affirmative by presenting the first VRF with
a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat
achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability
of tight verifiable\r\nrandom functions: We show that a security loss of Q is
unavoidable and\r\npresent the first construction that achieves this bound."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key
Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3'
apa: Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In
Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3
bibtex: '@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions
with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3},
booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021}
}'
chicago: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In
Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3.
ieee: D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key
Cryptography – PKC 2021, Cham, 2021.
mla: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key
Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3.
short: 'D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.'
date_created: 2021-05-10T16:07:50Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75248-4_3
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:09:17Z
date_updated: 2021-05-10T16:09:17Z
file_id: '22060'
file_name: Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf
file_size: 697361
relation: main_file
file_date_updated: 2021-05-10T16:09:17Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752477'
- '9783030752484'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Verifiable Random Functions with Optimal Tightness
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '26645'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Raphael
full_name: Heitjohann, Raphael
last_name: Heitjohann
- first_name: Jeremy
full_name: Fell, Jeremy
last_name: Fell
citation:
ama: 'Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast
Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.'
apa: 'Bobolz, J., Eidens, F., Heitjohann, R., & Fell, J. (2021). Cryptimeleon:
A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.
IACR eprint.'
bibtex: '@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library
for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR
eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell,
Jeremy}, year={2021} }'
chicago: 'Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon:
A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR
eprint, 2021.'
ieee: 'J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library
for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint,
2021.'
mla: 'Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving
Cryptographic Schemes. IACR eprint, 2021.'
short: J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).
date_created: 2021-10-21T07:51:32Z
date_updated: 2022-11-18T09:38:42Z
department:
- _id: '64'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/961
oa: '1'
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '82'
name: SFB 901 - Project Area T
- _id: '84'
name: SFB 901 -Subproject T2
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publisher: IACR eprint
status: public
title: 'Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic
Schemes'
type: preprint
user_id: '477'
year: '2021'
...
---
_id: '29566'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Stephan
full_name: Krenn, Stephan
last_name: Krenn
- first_name: Sebastian
full_name: Ramacher, Sebastian
last_name: Ramacher
- first_name: Kai
full_name: Samelin, Kai
last_name: Samelin
citation:
ama: 'Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based
Credentials. In: Cryptology and Network Security. Springer International
Publishing; 2021. doi:10.1007/978-3-030-92548-2_9'
apa: Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., & Samelin, K. (2021).
Issuer-Hiding Attribute-Based Credentials. Cryptology and Network Security.
https://doi.org/10.1007/978-3-030-92548-2_9
bibtex: '@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham},
title={Issuer-Hiding Attribute-Based Credentials}, DOI={10.1007/978-3-030-92548-2_9},
booktitle={Cryptology and Network Security}, publisher={Springer International
Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher,
Sebastian and Samelin, Kai}, year={2021} }'
chicago: 'Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai
Samelin. “Issuer-Hiding Attribute-Based Credentials.” In Cryptology and Network
Security. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-92548-2_9.'
ieee: 'J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding
Attribute-Based Credentials,” 2021, doi: 10.1007/978-3-030-92548-2_9.'
mla: Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” Cryptology
and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.
short: 'J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology
and Network Security, Springer International Publishing, Cham, 2021.'
date_created: 2022-01-27T13:00:21Z
date_updated: 2022-01-27T13:02:23Z
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-030-92548-2_9
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: Cryptology and Network Security
publication_identifier:
isbn:
- '9783030925475'
- '9783030925482'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Issuer-Hiding Attribute-Based Credentials
type: conference
user_id: '27207'
year: '2021'
...
---
_id: '19551'
author:
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
citation:
ama: 'Kurek R. Efficient Forward-Secure Threshold Public Key Encryption. In: K.
Liu J, Cui H, eds. Information Security and Privacy - 25th Australasian Conference,
{ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings.
Vol 12248. Lecture Notes in Computer Science. Springer; 2020:330-349. doi:10.1007/978-3-030-55304-3\_17'
apa: Kurek, R. (2020). Efficient Forward-Secure Threshold Public Key Encryption.
In J. K. Liu & H. Cui (Eds.), Information Security and Privacy - 25th Australasian
Conference, {ACISP} 2020, Perth, WA, Australia, November 30 - December 2, 2020,
Proceedings (Vol. 12248, pp. 330–349). Springer. https://doi.org/10.1007/978-3-030-55304-3\_17
bibtex: '@inproceedings{Kurek_2020, series={Lecture Notes in Computer Science},
title={Efficient Forward-Secure Threshold Public Key Encryption}, volume={12248},
DOI={10.1007/978-3-030-55304-3\_17},
booktitle={Information Security and Privacy - 25th Australasian Conference, {ACISP}
2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings}, publisher={Springer},
author={Kurek, Rafael}, editor={K. Liu, Joseph and Cui, HuiEditors}, year={2020},
pages={330–349}, collection={Lecture Notes in Computer Science} }'
chicago: Kurek, Rafael. “Efficient Forward-Secure Threshold Public Key Encryption.”
In Information Security and Privacy - 25th Australasian Conference, {ACISP}
2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings, edited
by Joseph K. Liu and Hui Cui, 12248:330–49. Lecture Notes in Computer Science.
Springer, 2020. https://doi.org/10.1007/978-3-030-55304-3\_17.
ieee: R. Kurek, “Efficient Forward-Secure Threshold Public Key Encryption,” in Information
Security and Privacy - 25th Australasian Conference, {ACISP} 2020, Perth, WA,
Australia, November 30 - December 2, 2020, Proceedings, 2020, vol. 12248,
pp. 330–349.
mla: Kurek, Rafael. “Efficient Forward-Secure Threshold Public Key Encryption.”
Information Security and Privacy - 25th Australasian Conference, {ACISP} 2020,
Perth, WA, Australia, November 30 - December 2, 2020, Proceedings, edited
by Joseph K. Liu and Hui Cui, vol. 12248, Springer, 2020, pp. 330–49, doi:10.1007/978-3-030-55304-3\_17.
short: 'R. Kurek, in: J. K. Liu, H. Cui (Eds.), Information Security and Privacy
- 25th Australasian Conference, {ACISP} 2020, Perth, WA, Australia, November 30
- December 2, 2020, Proceedings, Springer, 2020, pp. 330–349.'
date_created: 2020-09-18T05:59:11Z
date_updated: 2022-01-06T06:54:07Z
doi: 10.1007/978-3-030-55304-3\_17
editor:
- first_name: Joseph
full_name: K. Liu, Joseph
last_name: K. Liu
- first_name: Hui
full_name: Cui, Hui
last_name: Cui
intvolume: ' 12248'
language:
- iso: eng
page: 330-349
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Information Security and Privacy - 25th Australasian Conference, {ACISP}
2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Efficient Forward-Secure Threshold Public Key Encryption
type: conference
user_id: '15504'
volume: 12248
year: '2020'
...
---
_id: '19553'
author:
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
citation:
ama: 'Kurek R. Efficient Forward-Secure Threshold Signatures. In: Aoki K, Kanaoka
A, eds. Advances in Information and Computer Security - 15th International
Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings.
Vol 12231. Lecture Notes in Computer Science. Springer; 2020:239-260. doi:10.1007/978-3-030-58208-1\_14'
apa: Kurek, R. (2020). Efficient Forward-Secure Threshold Signatures. In K. Aoki
& A. Kanaoka (Eds.), Advances in Information and Computer Security - 15th
International Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4,
2020, Proceedings (Vol. 12231, pp. 239–260). Springer. https://doi.org/10.1007/978-3-030-58208-1\_14
bibtex: '@inproceedings{Kurek_2020, series={Lecture Notes in Computer Science},
title={Efficient Forward-Secure Threshold Signatures}, volume={12231}, DOI={10.1007/978-3-030-58208-1\_14},
booktitle={Advances in Information and Computer Security - 15th International
Workshop on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings},
publisher={Springer}, author={Kurek, Rafael}, editor={Aoki, Kazumaro and Kanaoka,
AkiraEditors}, year={2020}, pages={239–260}, collection={Lecture Notes in Computer
Science} }'
chicago: Kurek, Rafael. “Efficient Forward-Secure Threshold Signatures.” In Advances
in Information and Computer Security - 15th International Workshop on Security,
{IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings, edited by Kazumaro
Aoki and Akira Kanaoka, 12231:239–60. Lecture Notes in Computer Science. Springer,
2020. https://doi.org/10.1007/978-3-030-58208-1\_14.
ieee: R. Kurek, “Efficient Forward-Secure Threshold Signatures,” in Advances
in Information and Computer Security - 15th International Workshop on Security,
{IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings, 2020, vol. 12231,
pp. 239–260.
mla: Kurek, Rafael. “Efficient Forward-Secure Threshold Signatures.” Advances
in Information and Computer Security - 15th International Workshop on Security,
{IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings, edited by Kazumaro
Aoki and Akira Kanaoka, vol. 12231, Springer, 2020, pp. 239–60, doi:10.1007/978-3-030-58208-1\_14.
short: 'R. Kurek, in: K. Aoki, A. Kanaoka (Eds.), Advances in Information and Computer
Security - 15th International Workshop on Security, {IWSEC} 2020, Fukui, Japan,
September 2-4, 2020, Proceedings, Springer, 2020, pp. 239–260.'
date_created: 2020-09-18T06:00:42Z
date_updated: 2022-01-06T06:54:07Z
doi: 10.1007/978-3-030-58208-1\_14
editor:
- first_name: Kazumaro
full_name: Aoki, Kazumaro
last_name: Aoki
- first_name: Akira
full_name: Kanaoka, Akira
last_name: Kanaoka
intvolume: ' 12231'
language:
- iso: eng
page: 239-260
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Advances in Information and Computer Security - 15th International Workshop
on Security, {IWSEC} 2020, Fukui, Japan, September 2-4, 2020, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Efficient Forward-Secure Threshold Signatures
type: conference
user_id: '15504'
volume: 12231
year: '2020'
...
---
_id: '24710'
author:
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
citation:
ama: Kurek R. Efficient Cryptographic Constructions with Strong Security Guarantees.;
2020.
apa: Kurek, R. (2020). Efficient Cryptographic Constructions with Strong Security
Guarantees.
bibtex: '@book{Kurek_2020, title={Efficient Cryptographic Constructions with Strong
Security Guarantees}, author={Kurek, Rafael}, year={2020} }'
chicago: Kurek, Rafael. Efficient Cryptographic Constructions with Strong Security
Guarantees, 2020.
ieee: R. Kurek, Efficient Cryptographic Constructions with Strong Security Guarantees.
2020.
mla: Kurek, Rafael. Efficient Cryptographic Constructions with Strong Security
Guarantees. 2020.
short: R. Kurek, Efficient Cryptographic Constructions with Strong Security Guarantees,
2020.
date_created: 2021-09-20T11:40:56Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2021-09-20T11:40:38Z
date_updated: 2021-09-20T11:40:38Z
file_id: '24711'
file_name: DissertationKurek.pdf
file_size: 973756
relation: main_file
success: 1
file_date_updated: 2021-09-20T11:40:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
title: Efficient Cryptographic Constructions with Strong Security Guarantees
type: dissertation
user_id: '15504'
year: '2020'
...
---
_id: '21396'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs) are essentially digital signatures with
additional properties, namely verifiable uniqueness and pseudorandomness, which
make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated
Denial of Existence and the CONIKS key management system, or in the random committee
selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on
admissible hash functions (AHFs) to achieve security against adaptive attacks
in the standard model. Known AHF constructions are based on error-correcting codes,
which yield asymptotically efficient constructions. However, previous works do
not clarify how the code should be instantiated concretely in the real world.
The rate and the minimal distance of the selected code have significant impact
on the efficiency of the resulting cryptosystem, therefore it is unclear if and
how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we
explain inherent limitations of code-based AHFs. Concretely, we assume that even
if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch
bounds, existing AHF-based constructions of verifiable random functions (VRFs)
can only be instantiated quite inefficiently. Then we introduce and construct
computational AHFs (cAHFs). While classical AHFs are information-theoretic, and
therefore work even in presence of computationally unbounded adversaries, cAHFs
provide only security against computationally bounded adversaries. However, we
show that cAHFs can be instantiated significantly more efficiently. Finally, we
use our cAHF to construct the currently most efficient verifiable random function
with full adaptive security in the standard model."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions
and Efficient Verifiable Random Functions. In: Lecture Notes in Computer Science.
Cham; 2020. doi:10.1007/978-3-030-38471-5_13'
apa: Jager, T., & Niehues, D. (2020). On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions. In Lecture Notes
in Computer Science. Cham. https://doi.org/10.1007/978-3-030-38471-5_13
bibtex: '@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability
of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={10.1007/978-3-030-38471-5_13},
booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues,
David}, year={2020} }'
chicago: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of
Admissible Hash Functions and Efficient Verifiable Random Functions.” In Lecture
Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-38471-5_13.
ieee: T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions,” in Lecture Notes
in Computer Science, Cham, 2020.
mla: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions.” Lecture Notes in
Computer Science, 2020, doi:10.1007/978-3-030-38471-5_13.
short: 'T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.'
conference:
end_date: 2019-08-16
location: Waterloo, Canada
name: Selected Areas in Cryptography
start_date: 2019-08-12
date_created: 2021-03-08T16:50:31Z
date_updated: 2022-01-06T06:54:58Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-38471-5_13
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-03-08T17:02:37Z
date_updated: 2021-03-08T17:02:37Z
file_id: '21399'
file_name: Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible
Ha.pdf
file_size: 706743
relation: main_file
file_date_updated: 2021-03-08T17:02:37Z
has_accepted_license: '1'
keyword:
- Admissible hash functions
- Verifiable random functions
- Error-correcting codes
- Provable security
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030384708'
- '9783030384715'
issn:
- 0302-9743
- 1611-3349
publication_status: published
quality_controlled: '1'
related_material:
link:
- relation: later_version
url: https://eprint.iacr.org/2019/1335.pdf
status: public
title: On the Real-World Instantiability of Admissible Hash Functions and Efficient
Verifiable Random Functions
type: book_chapter
user_id: '36113'
year: '2020'
...
---
_id: '18520'
author:
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Setzer A. Local Graph Transformation Primitives For Some Basic Problems
In Overlay Networks. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-1026
apa: Setzer, A. (2020). Local Graph Transformation Primitives For Some Basic
Problems In Overlay Networks. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1026
bibtex: '@book{Setzer_2020, title={Local Graph Transformation Primitives For Some
Basic Problems In Overlay Networks}, DOI={10.17619/UNIPB/1-1026},
publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }'
chicago: Setzer, Alexander. Local Graph Transformation Primitives For Some Basic
Problems In Overlay Networks. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-1026.
ieee: A. Setzer, Local Graph Transformation Primitives For Some Basic Problems
In Overlay Networks. Universität Paderborn, 2020.
mla: Setzer, Alexander. Local Graph Transformation Primitives For Some Basic
Problems In Overlay Networks. Universität Paderborn, 2020, doi:10.17619/UNIPB/1-1026.
short: A. Setzer, Local Graph Transformation Primitives For Some Basic Problems
In Overlay Networks, Universität Paderborn, 2020.
date_created: 2020-08-28T06:50:29Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-1026
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
type: dissertation
user_id: '477'
year: '2020'
...
---
_id: '18637'
author:
- first_name: Patrick
full_name: Schürmann, Patrick
last_name: Schürmann
citation:
ama: Schürmann P. A Group Signature Scheme from Flexible Public Key Signatures
and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn;
2020.
apa: Schürmann, P. (2020). A Group Signature Scheme from Flexible Public Key
Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität
Paderborn.
bibtex: '@book{Schürmann_2020, title={A Group Signature Scheme from Flexible Public
Key Signatures and Structure-Preserving Signatures on Equivalence Classes}, publisher={Universität
Paderborn}, author={Schürmann, Patrick}, year={2020} }'
chicago: Schürmann, Patrick. A Group Signature Scheme from Flexible Public Key
Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität
Paderborn, 2020.
ieee: P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures
and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn,
2020.
mla: Schürmann, Patrick. A Group Signature Scheme from Flexible Public Key Signatures
and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn,
2020.
short: P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures
and Structure-Preserving Signatures on Equivalence Classes, Universität Paderborn,
2020.
date_created: 2020-08-29T13:24:51Z
date_updated: 2022-01-06T06:53:50Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: feidens
date_created: 2020-10-23T08:36:34Z
date_updated: 2020-10-23T08:36:34Z
description: This is a bachelor thesis.
file_id: '20186'
file_name: thesis_schuermann_published.pdf
file_size: 1060142
relation: main_file
file_date_updated: 2020-10-23T08:36:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving
Signatures on Equivalence Classes
type: bachelorsthesis
user_id: '25078'
year: '2020'
...
---
_id: '18639'
author:
- first_name: Tobias
full_name: Terfort, Tobias
last_name: Terfort
citation:
ama: Terfort T. Enhancing Security by Usage of Universal One-Way Hash Functions.
Universität Paderborn; 2020.
apa: Terfort, T. (2020). Enhancing Security by Usage of Universal One-Way Hash
Functions. Universität Paderborn.
bibtex: '@book{Terfort_2020, title={Enhancing Security by Usage of Universal One-Way
Hash Functions}, publisher={Universität Paderborn}, author={Terfort, Tobias},
year={2020} }'
chicago: Terfort, Tobias. Enhancing Security by Usage of Universal One-Way Hash
Functions. Universität Paderborn, 2020.
ieee: T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions.
Universität Paderborn, 2020.
mla: Terfort, Tobias. Enhancing Security by Usage of Universal One-Way Hash Functions.
Universität Paderborn, 2020.
short: T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions,
Universität Paderborn, 2020.
date_created: 2020-08-29T13:30:56Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '7'
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Enhancing Security by Usage of Universal One-Way Hash Functions
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '15770'
author:
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
citation:
ama: Warner D. On the Complexity of Local Transformations in SDN Overlays.
Universität Paderborn; 2020.
apa: Warner, D. (2020). On the complexity of local transformations in SDN overlays.
Universität Paderborn.
bibtex: '@book{Warner_2020, title={On the complexity of local transformations in
SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020}
}'
chicago: Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays.
Universität Paderborn, 2020.
ieee: D. Warner, On the complexity of local transformations in SDN overlays.
Universität Paderborn, 2020.
mla: Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays.
Universität Paderborn, 2020.
short: D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität
Paderborn, 2020.
date_created: 2020-02-04T13:47:02Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: On the complexity of local transformations in SDN overlays
type: mastersthesis
user_id: '477'
year: '2020'
...
---
_id: '13770'
author:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT
Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering.
2020;62(6):467-481. doi:10.1007/s12599-019-00627-x'
apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020).
A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information
Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x'
bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case
for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x},
number={6}, journal={Business & Information Systems Engineering}, publisher={Springer},
author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and
Wehrheim, Heike}, year={2020}, pages={467–481} }'
chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike
Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business &
Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x.'
ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for
a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems
Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.'
mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”
Business & Information Systems Engineering, vol. 62, no. 6, Springer,
2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.'
short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &
Information Systems Engineering 62 (2020) 467–481.
date_created: 2019-10-10T13:41:06Z
date_updated: 2022-12-02T09:27:17Z
ddc:
- '004'
department:
- _id: '276'
- _id: '75'
- _id: '63'
- _id: '77'
doi: 10.1007/s12599-019-00627-x
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-12-12T10:24:47Z
date_updated: 2019-12-12T10:24:47Z
file_id: '15311'
file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf
file_size: 454532
relation: main_file
success: 1
file_date_updated: 2019-12-12T10:24:47Z
has_accepted_license: '1'
intvolume: ' 62'
issue: '6'
language:
- iso: eng
page: 467-481
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
- _id: '82'
name: SFB 901 - Project Area T
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '6'
name: SFB 901 - Subproject A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '9'
name: SFB 901 - Subproject B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '15'
name: SFB 901 - Subproject C3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '83'
name: SFB 901 -Subproject T1
- _id: '84'
name: SFB 901 -Subproject T2
- _id: '107'
name: SFB 901 -Subproject T3
- _id: '158'
name: 'SFB 901 - T4: SFB 901 -Subproject T4'
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: 'A Case for a New IT Ecosystem: On-The-Fly Computing'
type: journal_article
user_id: '477'
volume: 62
year: '2020'
...
---
_id: '18638'
author:
- first_name: Paul
full_name: Kramer, Paul
id: '64594'
last_name: Kramer
citation:
ama: Kramer P. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn;
2020.
apa: Kramer, P. (2020). Comparison of Zero-Knowledge Range Proofs. Universität
Paderborn.
bibtex: '@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität
Paderborn}, author={Kramer, Paul}, year={2020} }'
chicago: Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität
Paderborn, 2020.
ieee: P. Kramer, Comparison of Zero-Knowledge Range Proofs. Universität Paderborn,
2020.
mla: Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität
Paderborn, 2020.
short: P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn,
2020.
date_created: 2020-08-29T13:27:11Z
date_updated: 2022-10-17T10:56:59Z
department:
- _id: '7'
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Comparison of Zero-Knowledge Range Proofs
type: bachelorsthesis
user_id: '25078'
year: '2020'
...
---
_id: '6976'
abstract:
- lang: eng
text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes
joining and leaving the network. We assume an adversary that may churn a\r\nconstant
fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds.
In particular, the adversary has an almost up-to-date information of\r\nthe network
topology as it can observe an only slightly outdated topology that\r\nis at least
$2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction
that new nodes can only join the network via nodes that have taken\r\npart in
the network for at least one round.\r\n Our contributions are as follows: First,
we show that it is impossible to\r\nmaintain a connected topology if adversary
has up-to-date information about the\r\nnodes' connections. Further, we show that
our restriction concerning the join\r\nis also necessary. As our main result present
an algorithm that constructs a\r\nnew overlay- completely independent of all previous
overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only
$\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose
the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which
will be maintained by the\r\nalgorithm. However, our approaches can be transferred
to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Vipin Ravindran
full_name: Vijayalakshmi, Vipin Ravindran
last_name: Vijayalakshmi
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your
Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date
Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and
Distributed Processing Symposium (IPDPS ’19). IEEE.'
apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two
Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn
with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro,
Brazil: IEEE.'
bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps
Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with
an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd
International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE},
author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}
}'
chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler.
“Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19). IEEE, n.d.
ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead
of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost
Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel
and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.
mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining
a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), IEEE.
short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19), IEEE, n.d.'
conference:
end_date: 24.05.19
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 20.05.19
date_created: 2019-01-24T18:53:11Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2019-01-26T16:09:08Z
date_updated: 2019-01-26T16:09:08Z
file_id: '7007'
file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf
file_size: 638020
relation: main_file
success: 1
file_date_updated: 2019-01-26T16:09:08Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
publication_status: accepted
publisher: IEEE
status: public
title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-date Adversary
type: conference
user_id: '34727'
year: '2019'
...
---
_id: '14830'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Jonas
full_name: Lefevre, Jonas
last_name: Lefevre
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory
Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4
apa: Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric
Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4
bibtex: '@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs},
volume={63}, DOI={10.1007/s00224-017-9823-4},
number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre,
Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }'
chicago: 'Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing
Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.'
ieee: R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,”
Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019.
mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst.,
vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
short: R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.
date_created: 2019-11-06T10:54:58Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1007/s00224-017-9823-4
intvolume: ' 63'
issue: '2'
language:
- iso: eng
page: 177-199
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Theory Comput. Syst.
status: public
title: Self-Stabilizing Metric Graphs
type: journal_article
user_id: '15504'
volume: 63
year: '2019'
...