---
_id: '326'
author:
- first_name: Frederic
full_name: Heihoff, Frederic
last_name: Heihoff
citation:
ama: Heihoff F. A Group Signature Scheme Based on the LSRW Assumption. Universität
Paderborn; 2015.
apa: Heihoff, F. (2015). A group signature scheme based on the LSRW assumption.
Universität Paderborn.
bibtex: '@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption},
publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }'
chicago: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption.
Universität Paderborn, 2015.
ieee: F. Heihoff, A group signature scheme based on the LSRW assumption.
Universität Paderborn, 2015.
mla: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption.
Universität Paderborn, 2015.
short: F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
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 based on the LSRW assumption
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '327'
abstract:
- lang: eng
text: We consider the problem of resource discovery in distributed systems. In particular
we give an algorithm, such that each node in a network discovers the address of
any other node in the network. We model the knowledge of the nodes as a virtual
overlay network given by a directed graph such that complete knowledge of all
nodes corresponds to a complete graph in the overlay network. Although there are
several solutions for resource discovery, our solution is the first that achieves
worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n))
or bits (O(nlogn)O(nlogn)) a node receives or sends coincides with the lower
bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message
complexity optimal solution for resource discovery. Theoretical Computer Science.
2015:67-79. doi:10.1016/j.tcs.2014.11.027
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2015). A deterministic
worst-case message complexity optimal solution for resource discovery. Theoretical
Computer Science, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic
worst-case message complexity optimal solution for resource discovery}, DOI={10.1016/j.tcs.2014.11.027},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79}
}'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
Theoretical Computer Science, 2015, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case
message complexity optimal solution for resource discovery,” Theoretical Computer
Science, pp. 67–79, 2015.
mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery.” Theoretical Computer Science,
Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science
(2015) 67–79.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:08Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2014.11.027
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:38:02Z
date_updated: 2018-03-20T07:38:02Z
file_id: '1427'
file_name: 327-KKS15-TOCS_01.pdf
file_size: 398044
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:38:02Z
has_accepted_license: '1'
page: 67-79
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: A deterministic worst-case message complexity optimal solution for resource
discovery
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3364'
author:
- first_name: Christoph
full_name: Knorr, Christoph
last_name: Knorr
citation:
ama: Knorr C. Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten.
Universität Paderborn; 2015.
apa: Knorr, C. (2015). Evaluation von Bildverarbeitungsalgorithmen in heterogenen
Rechenknoten. Universität Paderborn.
bibtex: '@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in
heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph},
year={2015} }'
chicago: Knorr, Christoph. Evaluation von Bildverarbeitungsalgorithmen in heterogenen
Rechenknoten. Universität Paderborn, 2015.
ieee: C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten.
Universität Paderborn, 2015.
mla: Knorr, Christoph. Evaluation von Bildverarbeitungsalgorithmen in heterogenen
Rechenknoten. Universität Paderborn, 2015.
short: C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten,
Universität Paderborn, 2015.
date_created: 2018-06-26T14:06:07Z
date_updated: 2022-01-06T06:59:13Z
department:
- _id: '78'
language:
- iso: ger
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '3815'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Kiesel J, Stein B. Sentiment Flow - A General Model of Web Review
Argumentation. In: Tsujii J, Hajic J, eds. Proceedings of the 2015 Conference
on Empirical Methods in Natural Language Processing. Lecture Notes in Computer
Science. ; 2015:601-611. doi:10.18653/v1/D15-1072'
apa: Wachsmuth, H., Kiesel, J., & Stein, B. (2015). Sentiment Flow - A General
Model of Web Review Argumentation. In J. Tsujii & J. Hajic (Eds.), Proceedings
of the 2015 Conference on Empirical Methods in Natural Language Processing
(pp. 601–611). https://doi.org/10.18653/v1/D15-1072
bibtex: '@inproceedings{Wachsmuth_Kiesel_Stein_2015, series={Lecture Notes in Computer
Science}, title={Sentiment Flow - A General Model of Web Review Argumentation},
DOI={10.18653/v1/D15-1072},
booktitle={Proceedings of the 2015 Conference on Empirical Methods in Natural
Language Processing}, author={Wachsmuth, Henning and Kiesel, Johannes and Stein,
Benno}, editor={Tsujii, Junichi and Hajic, JanEditors}, year={2015}, pages={601–611},
collection={Lecture Notes in Computer Science} }'
chicago: Wachsmuth, Henning, Johannes Kiesel, and Benno Stein. “Sentiment Flow -
A General Model of Web Review Argumentation.” In Proceedings of the 2015 Conference
on Empirical Methods in Natural Language Processing, edited by Junichi Tsujii
and Jan Hajic, 601–11. Lecture Notes in Computer Science, 2015. https://doi.org/10.18653/v1/D15-1072.
ieee: H. Wachsmuth, J. Kiesel, and B. Stein, “Sentiment Flow - A General Model of
Web Review Argumentation,” in Proceedings of the 2015 Conference on Empirical
Methods in Natural Language Processing, 2015, pp. 601–611.
mla: Wachsmuth, Henning, et al. “Sentiment Flow - A General Model of Web Review
Argumentation.” Proceedings of the 2015 Conference on Empirical Methods in
Natural Language Processing, edited by Junichi Tsujii and Jan Hajic, 2015,
pp. 601–11, doi:10.18653/v1/D15-1072.
short: 'H. Wachsmuth, J. Kiesel, B. Stein, in: J. Tsujii, J. Hajic (Eds.), Proceedings
of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015,
pp. 601–611.'
date_created: 2018-08-02T13:38:41Z
date_updated: 2022-01-06T06:59:37Z
department:
- _id: '600'
doi: 10.18653/v1/D15-1072
editor:
- first_name: Junichi
full_name: Tsujii, Junichi
last_name: Tsujii
- first_name: Jan
full_name: Hajic, Jan
last_name: Hajic
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/D15-1072.pdf
page: 601-611
publication: Proceedings of the 2015 Conference on Empirical Methods in Natural Language
Processing
publication_identifier:
isbn:
- 978-3-319-25740-2
series_title: Lecture Notes in Computer Science
status: public
title: Sentiment Flow - A General Model of Web Review Argumentation
type: conference
user_id: '82920'
year: '2015'
...
---
_id: '3879'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: Wachsmuth H. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining.;
2015. doi:http://dx.doi.org/10.1007/978-3-319-25741-9
apa: Wachsmuth, H. (2015). Text Analysis Pipelines - Towards Ad-hoc Large-scale
Text Mining. http://dx.doi.org/10.1007/978-3-319-25741-9
bibtex: '@book{Wachsmuth_2015, series={Lecture Notes in Computer Science}, title={Text
Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining}, DOI={http://dx.doi.org/10.1007/978-3-319-25741-9},
author={Wachsmuth, Henning}, year={2015}, collection={Lecture Notes in Computer
Science} }'
chicago: Wachsmuth, Henning. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale
Text Mining. Lecture Notes in Computer Science, 2015. http://dx.doi.org/10.1007/978-3-319-25741-9.
ieee: H. Wachsmuth, Text Analysis Pipelines - Towards Ad-hoc Large-scale Text
Mining. 2015.
mla: Wachsmuth, Henning. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale
Text Mining. 2015, doi:http://dx.doi.org/10.1007/978-3-319-25741-9.
short: H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining,
2015.
date_created: 2018-08-11T16:15:08Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '600'
doi: http://dx.doi.org/10.1007/978-3-319-25741-9
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-319-25740-2
series_title: Lecture Notes in Computer Science
status: public
title: Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining
type: book
user_id: '82920'
year: '2015'
...
---
_id: '290'
abstract:
- lang: eng
text: 'Model transformation is a key concept in model-driven software engineering.
The definition of model transformations is usually based on meta-models describing
the abstract syntax of languages. While meta-models are thereby able to abstract
from uperfluous details of concrete syntax, they often loose structural information
inherent in languages, like information on model elements always occurring together
in particular shapes. As a consequence, model transformations cannot naturally
re-use language structures, thus leading to unnecessary complexity in their development
as well as in quality assurance.In this paper, we propose a new approach to model
transformation development which allows to simplify the developed transformations
and improve their quality via the exploitation of the languages׳ structures. The
approach is based on context-free graph grammars and transformations defined by
pairing productions of source and target grammars. We show that such transformations
have important properties: they terminate and are sound, complete, and deterministic.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition,
execution, and quality properties. Computer Languages, Systems & Structures.
2015:116-138. doi:10.1016/j.cl.2015.05.003'
apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations:
Definition, execution, and quality properties. Computer Languages, Systems
& Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003'
bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations:
Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003},
journal={Computer Languages, Systems & Structures}, publisher={Elsevier},
author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015},
pages={116–138} }'
chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model
Transformations: Definition, Execution, and Quality Properties.” Computer Languages,
Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.'
ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations:
Definition, execution, and quality properties,” Computer Languages, Systems
& Structures, pp. 116–138, 2015.'
mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution,
and Quality Properties.” Computer Languages, Systems & Structures,
Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.'
short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures
(2015) 116–138.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:22:03Z
date_updated: 2018-03-21T09:22:03Z
file_id: '1464'
file_name: 290-BSW15-main.pdf
file_size: 1329478
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:22:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 116-138
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Languages, Systems & Structures
publisher: Elsevier
status: public
title: 'Grammar-based model transformations: Definition, execution, and quality properties'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '2921'
author:
- first_name: Olivier
full_name: Blazy, Olivier
last_name: Blazy
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Jiaxin
full_name: Pan, Jiaxin
last_name: Pan
citation:
ama: 'Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon
Hash Functions. In: Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2015:256-279. doi:10.1007/978-3-662-46447-2_12'
apa: 'Blazy, O., Kakvi, S., Kiltz, E., & Pan, J. (2015). Tightly-Secure Signatures
from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp.
256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-46447-2_12'
bibtex: '@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure
Signatures from Chameleon Hash Functions}, DOI={10.1007/978-3-662-46447-2_12},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}, year={2015},
pages={256–279} }'
chicago: 'Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure
Signatures from Chameleon Hash Functions.” In Lecture Notes in Computer Science,
256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. https://doi.org/10.1007/978-3-662-46447-2_12.'
ieee: 'O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from
Chameleon Hash Functions,” in Lecture Notes in Computer Science, Berlin,
Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.'
mla: Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.”
Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp.
256–79, doi:10.1007/978-3-662-46447-2_12.
short: 'O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.'
date_created: 2018-05-25T12:46:08Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46447-2_12
extern: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/1021.pdf
oa: '1'
page: 256-279
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783662464465'
- '9783662464472'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Tightly-Secure Signatures from Chameleon Hash Functions
type: book_chapter
user_id: '66268'
year: '2015'
...
---
_id: '297'
author:
- first_name: Martin
full_name: Sosniak, Martin
last_name: Sosniak
citation:
ama: Sosniak M. Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn; 2015.
apa: Sosniak, M. (2015). Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn.
bibtex: '@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded
Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015}
}'
chicago: Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn, 2015.
ieee: M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn, 2015.
mla: Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn, 2015.
short: M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Evaluation of Pairing Optimization for Embedded Platforms
type: mastersthesis
user_id: '25078'
year: '2015'
...
---
_id: '299'
author:
- first_name: Britta
full_name: Gerken, Britta
last_name: Gerken
citation:
ama: Gerken B. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie.
Universität Paderborn; 2015.
apa: Gerken, B. (2015). Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn.
bibtex: '@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015}
}'
chicago: Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn, 2015.
ieee: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn, 2015.
mla: Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn, 2015.
short: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '301'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
citation:
ama: Bobolz J. Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn; 2015.
apa: Bobolz, J. (2015). Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn.
bibtex: '@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous
Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015}
}'
chicago: Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn, 2015.
ieee: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn, 2015.
mla: Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn, 2015.
short: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:47:11Z
date_updated: 2018-07-20T09:54:22Z
file_id: '1443'
file_name: 301-thesis_jbobolz_final_02.pdf
file_size: 1214027
relation: main_file
file_date_updated: 2018-07-20T09:54:22Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Efficient Verifier-Local Revocation for Anonymous Credentials
type: mastersthesis
urn: '3016'
user_id: '27207'
year: '2015'
...
---
_id: '302'
author:
- first_name: Christian
full_name: Stroh, Christian
last_name: Stroh
citation:
ama: Stroh C. Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn; 2015.
apa: Stroh, C. (2015). Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn.
bibtex: '@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous
Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015}
}'
chicago: Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn, 2015.
ieee: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn, 2015.
mla: Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn, 2015.
short: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Efficient Attributes for Pairing-Based Anonymous Credentials
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '304'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
citation:
ama: Koutsopoulos A. Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn; 2015.
apa: Koutsopoulos, A. (2015). Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn.
bibtex: '@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological
Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos,
Andreas}, year={2015} }'
chicago: Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn, 2015.
ieee: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn, 2015.
mla: Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn, 2015.
short: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:53Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:46:19Z
date_updated: 2018-03-20T07:46:19Z
file_id: '1441'
file_name: 304-Dissertation_-_Koutsopoulos.pdf
file_size: 2275834
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:46:19Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Dynamics and Efficiency in Topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '305'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
citation:
ama: Kniesburges S. Distributed Data Structures and the Power of Topological
Self-Stabilization. Universität Paderborn; 2015.
apa: Kniesburges, S. (2015). Distributed Data Structures and the Power of topological
Self-Stabilization. Universität Paderborn.
bibtex: '@book{Kniesburges_2015, title={Distributed Data Structures and the Power
of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges,
Sebastian}, year={2015} }'
chicago: Kniesburges, Sebastian. Distributed Data Structures and the Power of
Topological Self-Stabilization. Universität Paderborn, 2015.
ieee: S. Kniesburges, Distributed Data Structures and the Power of topological
Self-Stabilization. Universität Paderborn, 2015.
mla: Kniesburges, Sebastian. Distributed Data Structures and the Power of Topological
Self-Stabilization. Universität Paderborn, 2015.
short: S. Kniesburges, Distributed Data Structures and the Power of Topological
Self-Stabilization, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-13T09:14:43Z
date_updated: 2018-03-13T09:14:43Z
file_id: '1206'
file_name: 305-Dissertation_-_Kniesburges.pdf
file_size: 1709094
relation: main_file
success: 1
file_date_updated: 2018-03-13T09:14:43Z
has_accepted_license: '1'
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: Distributed Data Structures and the Power of topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '312'
author:
- first_name: Patrick
full_name: Schleiter, Patrick
last_name: Schleiter
citation:
ama: Schleiter P. Constructions of Fully Secure Predicate Encryption Schemes.
Universität Paderborn; 2015.
apa: Schleiter, P. (2015). Constructions of Fully Secure Predicate Encryption
Schemes. Universität Paderborn.
bibtex: '@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption
Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015}
}'
chicago: Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption
Schemes. Universität Paderborn, 2015.
ieee: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes.
Universität Paderborn, 2015.
mla: Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption Schemes.
Universität Paderborn, 2015.
short: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:52Z
date_updated: 2022-01-06T06:58:57Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:44:55Z
date_updated: 2018-03-20T07:44:55Z
file_id: '1439'
file_name: 312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf
file_size: 721996
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:44:55Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Constructions of Fully Secure Predicate Encryption Schemes
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '3120'
author:
- first_name: Florian
full_name: Böhl, Florian
last_name: Böhl
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Jessica
full_name: Koch, Jessica
last_name: Koch
- first_name: Christoph
full_name: Striecks, Christoph
last_name: Striecks
citation:
ama: 'Böhl F, Hofheinz D, Jager T, Koch J, Striecks C. Confined Guessing: New Signatures
From Standard Assumptions. J Cryptology. 2015;(1):176--208. doi:10.1007/s00145-014-9183-z'
apa: 'Böhl, F., Hofheinz, D., Jager, T., Koch, J., & Striecks, C. (2015). Confined
Guessing: New Signatures From Standard Assumptions. J. Cryptology, (1),
176--208. https://doi.org/10.1007/s00145-014-9183-z'
bibtex: '@article{Böhl_Hofheinz_Jager_Koch_Striecks_2015, title={Confined Guessing:
New Signatures From Standard Assumptions}, DOI={10.1007/s00145-014-9183-z},
number={1}, journal={J. Cryptology}, author={Böhl, Florian and Hofheinz, Dennis
and Jager, Tibor and Koch, Jessica and Striecks, Christoph}, year={2015}, pages={176--208}
}'
chicago: 'Böhl, Florian, Dennis Hofheinz, Tibor Jager, Jessica Koch, and Christoph
Striecks. “Confined Guessing: New Signatures From Standard Assumptions.” J.
Cryptology, no. 1 (2015): 176--208. https://doi.org/10.1007/s00145-014-9183-z.'
ieee: 'F. Böhl, D. Hofheinz, T. Jager, J. Koch, and C. Striecks, “Confined Guessing:
New Signatures From Standard Assumptions,” J. Cryptology, no. 1, pp. 176--208,
2015.'
mla: 'Böhl, Florian, et al. “Confined Guessing: New Signatures From Standard Assumptions.”
J. Cryptology, no. 1, 2015, pp. 176--208, doi:10.1007/s00145-014-9183-z.'
short: F. Böhl, D. Hofheinz, T. Jager, J. Koch, C. Striecks, J. Cryptology (2015)
176--208.
date_created: 2018-06-07T09:17:17Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/s00145-014-9183-z
extern: '1'
issue: '1'
page: 176--208
publication: J. Cryptology
status: public
title: 'Confined Guessing: New Signatures From Standard Assumptions'
type: journal_article
user_id: '38235'
year: '2015'
...
---
_id: '3121'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
- first_name: Juraj
full_name: Somorovsky, Juraj
last_name: Somorovsky
citation:
ama: 'Jager T, Schwenk J, Somorovsky J. On the Security of TLS 1.3 and QUIC Against
Weaknesses in PKCS#1 v1.5 Encryption. In: Proceedings of the 22nd ACM SIGSAC
Conference on Computer and Communications Security, Denver, CO, USA, October 12-16,
2015. ; 2015:1185--1196. doi:10.1145/2810103.2813657'
apa: Jager, T., Schwenk, J., & Somorovsky, J. (2015). On the Security of TLS
1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption. In Proceedings of
the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver,
CO, USA, October 12-16, 2015 (pp. 1185--1196). https://doi.org/10.1145/2810103.2813657
bibtex: '@inproceedings{Jager_Schwenk_Somorovsky_2015, title={On the Security of
TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption}, DOI={10.1145/2810103.2813657},
booktitle={Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications
Security, Denver, CO, USA, October 12-16, 2015}, author={Jager, Tibor and Schwenk,
Jörg and Somorovsky, Juraj}, year={2015}, pages={1185--1196} }'
chicago: Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “On the Security of TLS
1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.” In Proceedings
of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver,
CO, USA, October 12-16, 2015, 1185--1196, 2015. https://doi.org/10.1145/2810103.2813657.
ieee: T. Jager, J. Schwenk, and J. Somorovsky, “On the Security of TLS 1.3 and QUIC
Against Weaknesses in PKCS#1 v1.5 Encryption,” in Proceedings of the 22nd ACM
SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October
12-16, 2015, 2015, pp. 1185--1196.
mla: Jager, Tibor, et al. “On the Security of TLS 1.3 and QUIC Against Weaknesses
in PKCS#1 v1.5 Encryption.” Proceedings of the 22nd ACM SIGSAC Conference on
Computer and Communications Security, Denver, CO, USA, October 12-16, 2015,
2015, pp. 1185--1196, doi:10.1145/2810103.2813657.
short: 'T. Jager, J. Schwenk, J. Somorovsky, in: Proceedings of the 22nd ACM SIGSAC
Conference on Computer and Communications Security, Denver, CO, USA, October 12-16,
2015, 2015, pp. 1185--1196.'
date_created: 2018-06-07T09:17:47Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1145/2810103.2813657
extern: '1'
page: 1185--1196
publication: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications
Security, Denver, CO, USA, October 12-16, 2015
status: public
title: On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption
type: conference
user_id: '38235'
year: '2015'
...
---
_id: '3122'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
- first_name: Juraj
full_name: Somorovsky, Juraj
last_name: Somorovsky
citation:
ama: 'Jager T, Schwenk J, Somorovsky J. Practical Invalid Curve Attacks on TLS-ECDH.
In: Computer Security - ESORICS 2015 - 20th European Symposium on Research
in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part
I. ; 2015:407--425. doi:10.1007/978-3-319-24174-6_21'
apa: Jager, T., Schwenk, J., & Somorovsky, J. (2015). Practical Invalid Curve
Attacks on TLS-ECDH. In Computer Security - ESORICS 2015 - 20th European Symposium
on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings,
Part I (pp. 407--425). https://doi.org/10.1007/978-3-319-24174-6_21
bibtex: '@inproceedings{Jager_Schwenk_Somorovsky_2015, title={Practical Invalid
Curve Attacks on TLS-ECDH}, DOI={10.1007/978-3-319-24174-6_21},
booktitle={Computer Security - ESORICS 2015 - 20th European Symposium on Research
in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part
I}, author={Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}, year={2015},
pages={407--425} }'
chicago: Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “Practical Invalid Curve
Attacks on TLS-ECDH.” In Computer Security - ESORICS 2015 - 20th European Symposium
on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings,
Part I, 407--425, 2015. https://doi.org/10.1007/978-3-319-24174-6_21.
ieee: T. Jager, J. Schwenk, and J. Somorovsky, “Practical Invalid Curve Attacks
on TLS-ECDH,” in Computer Security - ESORICS 2015 - 20th European Symposium
on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings,
Part I, 2015, pp. 407--425.
mla: Jager, Tibor, et al. “Practical Invalid Curve Attacks on TLS-ECDH.” Computer
Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security,
Vienna, Austria, September 21-25, 2015, Proceedings, Part I, 2015, pp. 407--425,
doi:10.1007/978-3-319-24174-6_21.
short: 'T. Jager, J. Schwenk, J. Somorovsky, in: Computer Security - ESORICS 2015
- 20th European Symposium on Research in Computer Security, Vienna, Austria, September
21-25, 2015, Proceedings, Part I, 2015, pp. 407--425.'
date_created: 2018-06-07T09:18:33Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-319-24174-6_21
extern: '1'
page: 407--425
publication: Computer Security - ESORICS 2015 - 20th European Symposium on Research
in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part
I
status: public
title: Practical Invalid Curve Attacks on TLS-ECDH
type: conference
user_id: '38235'
year: '2015'
...
---
_id: '3123'
author:
- first_name: Felix
full_name: Heuer, Felix
last_name: Heuer
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Sven
full_name: Schäge, Sven
last_name: Schäge
citation:
ama: 'Heuer F, Jager T, Kiltz E, Schäge S. On the Selective Opening Security of
Practical Public-Key Encryption Schemes. In: Public-Key Cryptography - PKC
2015 - 18th IACR International Conference on Practice and Theory in Public-Key
Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings.
; 2015:27--51. doi:10.1007/978-3-662-46447-2_2'
apa: Heuer, F., Jager, T., Kiltz, E., & Schäge, S. (2015). On the Selective
Opening Security of Practical Public-Key Encryption Schemes. In Public-Key
Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory
in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings
(pp. 27--51). https://doi.org/10.1007/978-3-662-46447-2_2
bibtex: '@inproceedings{Heuer_Jager_Kiltz_Schäge_2015, title={On the Selective Opening
Security of Practical Public-Key Encryption Schemes}, DOI={10.1007/978-3-662-46447-2_2},
booktitle={Public-Key Cryptography - PKC 2015 - 18th IACR International Conference
on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March
30 - April 1, 2015, Proceedings}, author={Heuer, Felix and Jager, Tibor and Kiltz,
Eike and Schäge, Sven}, year={2015}, pages={27--51} }'
chicago: Heuer, Felix, Tibor Jager, Eike Kiltz, and Sven Schäge. “On the Selective
Opening Security of Practical Public-Key Encryption Schemes.” In Public-Key
Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory
in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings,
27--51, 2015. https://doi.org/10.1007/978-3-662-46447-2_2.
ieee: F. Heuer, T. Jager, E. Kiltz, and S. Schäge, “On the Selective Opening Security
of Practical Public-Key Encryption Schemes,” in Public-Key Cryptography - PKC
2015 - 18th IACR International Conference on Practice and Theory in Public-Key
Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings,
2015, pp. 27--51.
mla: Heuer, Felix, et al. “On the Selective Opening Security of Practical Public-Key
Encryption Schemes.” Public-Key Cryptography - PKC 2015 - 18th IACR International
Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD,
USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 27--51, doi:10.1007/978-3-662-46447-2_2.
short: 'F. Heuer, T. Jager, E. Kiltz, S. Schäge, in: Public-Key Cryptography - PKC
2015 - 18th IACR International Conference on Practice and Theory in Public-Key
Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015,
pp. 27--51.'
date_created: 2018-06-07T09:19:04Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46447-2_2
extern: '1'
page: 27--51
publication: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference
on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March
30 - April 1, 2015, Proceedings
status: public
title: On the Selective Opening Security of Practical Public-Key Encryption Schemes
type: conference
user_id: '38235'
year: '2015'
...
---
_id: '3124'
author:
- first_name: Florian
full_name: Bergsma, Florian
last_name: Bergsma
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
citation:
ama: 'Bergsma F, Jager T, Schwenk J. One-Round Key Exchange with Strong Security:
An Efficient and Generic Construction in the Standard Model. In: Public-Key
Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory
in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings.
; 2015:477--494. doi:10.1007/978-3-662-46447-2_21'
apa: 'Bergsma, F., Jager, T., & Schwenk, J. (2015). One-Round Key Exchange with
Strong Security: An Efficient and Generic Construction in the Standard Model.
In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference
on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March
30 - April 1, 2015, Proceedings (pp. 477--494). https://doi.org/10.1007/978-3-662-46447-2_21'
bibtex: '@inproceedings{Bergsma_Jager_Schwenk_2015, title={One-Round Key Exchange
with Strong Security: An Efficient and Generic Construction in the Standard Model},
DOI={10.1007/978-3-662-46447-2_21},
booktitle={Public-Key Cryptography - PKC 2015 - 18th IACR International Conference
on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March
30 - April 1, 2015, Proceedings}, author={Bergsma, Florian and Jager, Tibor and
Schwenk, Jörg}, year={2015}, pages={477--494} }'
chicago: 'Bergsma, Florian, Tibor Jager, and Jörg Schwenk. “One-Round Key Exchange
with Strong Security: An Efficient and Generic Construction in the Standard Model.”
In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference
on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March
30 - April 1, 2015, Proceedings, 477--494, 2015. https://doi.org/10.1007/978-3-662-46447-2_21.'
ieee: 'F. Bergsma, T. Jager, and J. Schwenk, “One-Round Key Exchange with Strong
Security: An Efficient and Generic Construction in the Standard Model,” in Public-Key
Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory
in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings,
2015, pp. 477--494.'
mla: 'Bergsma, Florian, et al. “One-Round Key Exchange with Strong Security: An
Efficient and Generic Construction in the Standard Model.” Public-Key Cryptography
- PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key
Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings,
2015, pp. 477--494, doi:10.1007/978-3-662-46447-2_21.'
short: 'F. Bergsma, T. Jager, J. Schwenk, in: Public-Key Cryptography - PKC 2015
- 18th IACR International Conference on Practice and Theory in Public-Key Cryptography,
Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 477--494.'
date_created: 2018-06-07T09:19:47Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46447-2_21
extern: '1'
page: 477--494
publication: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference
on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March
30 - April 1, 2015, Proceedings
status: public
title: 'One-Round Key Exchange with Strong Security: An Efficient and Generic Construction
in the Standard Model'
type: conference
user_id: '38235'
year: '2015'
...
---
_id: '3125'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
citation:
ama: 'Jager T. Verifiable Random Functions from Weaker Assumptions. In: Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland,
March 23-25, 2015, Proceedings, Part {II}. ; 2015:121--143. doi:10.1007/978-3-662-46497-7_5'
apa: Jager, T. (2015). Verifiable Random Functions from Weaker Assumptions. In Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland,
March 23-25, 2015, Proceedings, Part {II} (pp. 121--143). https://doi.org/10.1007/978-3-662-46497-7_5
bibtex: '@inproceedings{Jager_2015, title={Verifiable Random Functions from Weaker
Assumptions}, DOI={10.1007/978-3-662-46497-7_5},
booktitle={Theory of Cryptography - 12th Theory of Cryptography Conference, TCC
2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}}, author={Jager,
Tibor}, year={2015}, pages={121--143} }'
chicago: Jager, Tibor. “Verifiable Random Functions from Weaker Assumptions.” In
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015,
Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 121--143, 2015.
https://doi.org/10.1007/978-3-662-46497-7_5.
ieee: T. Jager, “Verifiable Random Functions from Weaker Assumptions,” in Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland,
March 23-25, 2015, Proceedings, Part {II}, 2015, pp. 121--143.
mla: Jager, Tibor. “Verifiable Random Functions from Weaker Assumptions.” Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland,
March 23-25, 2015, Proceedings, Part {II}, 2015, pp. 121--143, doi:10.1007/978-3-662-46497-7_5.
short: 'T. Jager, in: Theory of Cryptography - 12th Theory of Cryptography Conference,
TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 2015, pp.
121--143.'
date_created: 2018-06-07T09:20:19Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46497-7_5
extern: '1'
page: 121--143
publication: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC
2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}
status: public
title: Verifiable Random Functions from Weaker Assumptions
type: conference
user_id: '38235'
year: '2015'
...